ProPa-Slides

Summer Term 2024

• Orga slides
• Haskell slides
• Prolog slides
• combined version for taking notes

Additional lecture material:

• week02:
  • about Variables and Functions
  • Example01.hs
  • Python “functions”
  • Fibonacci-naiv.hs
  • Fibonacci-effizient.hs
• week03:
  • about Syntax Trees
  • Example02.hs
  • example calculations
  • inductive proof
  • lazy evaluation
• week04:
  • about Algebraic Manipulation
  • Example03.hs
  • Example04.hs
  • Example05.hs
  • Example06.hs
• week05:
  • Example07.hs
  • about Types - Examples
  • ListMangling.hs
  • visualization for fibList
  • visualization for compress
• week06:
  • for Repetition and Remarks
  • Example08.hs
  • Example09.hs
  • about exam task
  • examples in class
• week07:
  • Example10.hs
  • C example in class
  • Haskell examples in class
• week08:
  • about Syntax for Anonymous Functions
  • type inference example
  • list comprehension translation
  • examples in class
• week09:
  • about Tree Representation and Matching
  • More Examples
  • Example11.hs
• week10:
  • about List Structures and foldr
  • about Lazy Evaluation
  • Example12.hs
  • graph example from presence session
  • examples in class
• week11:
  • foldr vs. foldl
  • UML State Diagram
  • … realized in Elm
  • TicTacToe in Elm
• week12:
  • a derivation tree
  • a resolution example
  • more features for TicTacToe
• week13:
  • about Haskell-to-Prolog
  • illustration of insert/3
  • illustration of permutation/2
  • upruns/2 definition by direct checks on input
  • upruns/2 definition by checks with respect to processed rest list (foldr-like)
  • upruns/2 definition more declaratively, “by checks on output”
  • decomposition for recursive step of third upruns/2 implementation
• week14:
  • illustration of isSorted/1 from the lecture
  • Prolog code for Einstein Puzzle
• week15:
  • scribblings about inefficient and efficient reverse: 1, 2, 3, 4