Welcome to the UnicaML wiki. This wiki contains teaching material for the LiP (Programming Languages) course at the University of Cagliari. It can also serve as a first introduction to Ocaml programming.

Read here for instructions about using this wiki.

1. Ocaml basics
   • Running Ocaml programs
   • Arithmetic expressions
   • Booleans and conditionals
   • Global and local definitions
   • Functions
2. Recursive programming and pattern matching
   • Recursive definitions
   • Tail recursion
   • Pattern matching
3. Higher-order functions and polymorphism
   • Higher-order functions
   • Polymorphism
   • Bounded and unbounded iteration
   • Currying and uncurrying
4. Lists
   • List constructors
   • Pattern matching on lists
   • Tail recursive functions on lists
   • Map and Filter combinators
   • Fold combinators
5. Types
   • Tuples
   • Records
   • Tagged unions
   • Recursive types

1. Interpreter of an imperative language
   • Specification of environment and store
   • Integer expressions
   • Global declarations
   • Assignment, arrays, sequence, conditional, while loops
2. A typed imperative language
   • Integer and boolean expressions
   • Typed declarations
   • Type checking
3. An assembly language
4. Compiler of an imperative language
5. Static analyses of imperative programs
   • Type-checking
   • Constant folding
6. Functions in imperative languages
   • Call by value
   • Call by name
   • Type-checking

1. Untyped λ-calculus: normal order evaluation of λ-terms
2. Programming in the untyped λ-calculus
3. Simply-typed λ-calculus: Operational interpreter
   • Recursive evaluator based on environments
   • Eager evaluation
   • Recursive functions
4. Simply-typed λ-calculus: Type inference à la Hindley-Milner
   • Simple types
   • Constraint typing rules
   • Unification