Contents: 

Introduction to Functional Programming (Haskell): 

• Syntax (Backus-Naur Form) 
• primitive data types, lists, tuples, strings 
• expressions, function definitions, recursion and iteration 
  • evaluation strategies of functional programs
  • higher-order functions
  • polymorphism 
  • type system and verification 
• Algebraic and abstract data types 
• input, output and Monads
• searching and sorting algorithms 

Introduction of computability: 

• Lambda calculus 
• Primitive Recursion 
• μ-Recursion 

Proofs of program properties: 

• Term Rewriting 
• Structural induction 
• Termination 

Implementation and programming technique: 

• Modular program design

• Simon Thompson: Haskell: The Craft of Functional Programming, 2nd Edition, Addison-Wesley, 1999
• Graham Hutton: Programming in Haskell, Cambridge University Press, 2007
• Bird, R./Wadler, Ph.: Einführung in Funktionale Programmierung, Hanser Verlag, 1982
• Hans Hermes: Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Springer-Verlag 1978

For the tutorial please refer to 19300004

Contents: 

Introduction to Functional Programming (Haskell): 

• Syntax (Backus-Naur Form) 
• primitive data types, lists, tuples, strings 
• expressions, function definitions, recursion and iteration 
  • evaluation strategies of functional programs
  • higher-order functions
  • polymorphism 
  • type system and verification 
• Algebraic and abstract data types 
• input, output and Monads
• searching and sorting algorithms 

Introduction of computability: 

• Lambda calculus 
• Primitive Recursion 
• μ-Recursion 

Proofs of program properties: 

• Term Rewriting 
• Structural induction 
• Termination 

Implementation and programming technique: 

• Modular program design

• Simon Thompson: Haskell: The Craft of Functional Programming, 2nd Edition, Addison-Wesley, 1999
• Graham Hutton: Programming in Haskell, Cambridge University Press, 2007
• Bird, R./Wadler, Ph.: Einführung in Funktionale Programmierung, Hanser Verlag, 1982
• Hans Hermes: Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Springer-Verlag 1978

For the tutorial please refer to 19300004

Contents: 

Introduction to Functional Programming (Haskell): 

• Syntax (Backus-Naur Form) 
• primitive data types, lists, tuples, strings 
• expressions, function definitions, recursion and iteration 
  • evaluation strategies of functional programs
  • higher-order functions
  • polymorphism 
  • type system and verification 
• Algebraic and abstract data types 
• input, output and Monads
• searching and sorting algorithms 

Introduction of computability: 

• Lambda calculus 
• Primitive Recursion 
• μ-Recursion 

Proofs of program properties: 

• Term Rewriting 
• Structural induction 
• Termination 

Implementation and programming technique: 

• Modular program design

• Simon Thompson: Haskell: The Craft of Functional Programming, 2nd Edition, Addison-Wesley, 1999
• Graham Hutton: Programming in Haskell, Cambridge University Press, 2007
• Bird, R./Wadler, Ph.: Einführung in Funktionale Programmierung, Hanser Verlag, 1982
• Hans Hermes: Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Springer-Verlag 1978

For the tutorial please refer to 19300004

Contents: 

Introduction to Functional Programming (Haskell): 

• Syntax (Backus-Naur Form) 
• primitive data types, lists, tuples, strings 
• expressions, function definitions, recursion and iteration 
  • evaluation strategies of functional programs
  • higher-order functions
  • polymorphism 
  • type system and verification 
• Algebraic and abstract data types 
• input, output and Monads
• searching and sorting algorithms 

Introduction of computability: 

• Lambda calculus 
• Primitive Recursion 
• μ-Recursion 

Proofs of program properties: 

• Term Rewriting 
• Structural induction 
• Termination 

Implementation and programming technique: 

• Modular program design

• Simon Thompson: Haskell: The Craft of Functional Programming, 2nd Edition, Addison-Wesley, 1999
• Graham Hutton: Programming in Haskell, Cambridge University Press, 2007
• Bird, R./Wadler, Ph.: Einführung in Funktionale Programmierung, Hanser Verlag, 1982
• Hans Hermes: Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Springer-Verlag 1978

For the tutorial please refer to 19300004