This note covers
the following topics: introduction, pattern matching, The Sieve of Eratosthenes,
Fibonacci Series, Folding Lists, Data types, An expression evaluator, Lambda
Calculus, Modules, type inference, Uni cation algorithm, The type inference
algorithm, Type classes, Functions with varible number of arguments.
This note covers the following topics: O'Caml, Simple Data, Thinking
Recursively, Poly-HO: Polymorphism and Higher-Order Programming, Pipelines,
Datatypes, The Functional Evaluation Model, Functional Space Model, Equational
Reasoning, Modules and Functors, Modular Reasoning, Mutable Data Structures and
Imperative Interfaces, Threads, Locks and Mutable Data, Parallel Complexity
Model, Parallel Scans and Filters.
This note covers the
following topics: Introduction to Haskell and Lazy, Functional Programming,
Datatypes, Programs and Proofs, Simple Graphics, Polymorphism, Trees, Regions,
Proofs by Induction, The Haskell Class System, Simple Animations, Infinite Lists
and Streams, Reactive Animations, Higher Order Types, Functional Music and
Interpreting Music.
This note explains the
fundamental programming concepts such as recursion, abstraction, higher-order
functions and data types, whilst at the same time emphasizing the practical use
of such constructs by applying them within a graphical environment.
This note covers the
following topics: The Memory Management, Graph Reduction , Garbage Collection,
Memory Allocation, Lambda Calculus, The four stroke reduction engine and A
list of Miranda's built-in functions.
This
note covers the following topics: programming paradigms, expressions types and
functions, name binding recursion iteration and continuation, higher order
functions, the order of evaluation, linguistic abstraction, laml, object
oriented programming in scheme, imperative programming in scheme.