Elements of Functional ProgrammingThis book gives a lucid and thorough account of the concepts and techniques used in modern functional programming languages. Standard ML is used for notation, but the examples can be easily adapted to other functional languages. |
Contents
Functional Programming Concepts | 1 |
Support for Abstraction | 49 |
Programming with Lists | 79 |
Copyright | |
18 other sections not shown
Common terms and phrases
abstract type algorithm applied argument associated assume assumptions bindings bintree bool calculate Chapter closure compile components computation constant constructed constructors coord D₁ D₂ datatype defined denoted described domain E₁ E₂ eager evaluation Empty environment equations equivalent error evalV example exercise expression false flatten functional language functional programming graph higher order functions implementation induction input insert_oil int int int list int X int integer interaction introduce intset lambda calculus lazy evaluation let fun let val lookup node normal form notation padside pair parameter parser picture polymorphic primitive produce recursive definition representation result revonto rules SECD machine semantics sequence Standard ML string list stringcopy structural induction structure subexpressions substitution subtrees succ susplist T₁ tail recursive tree true tuple type definition type inference type int type operator type variables undefined V₁ val rec values of type