| Willamette Mathematics Colloquium • Fall 2002 |
Technical Aspects of the Haskell Language  | Programs are sets of equational definitions
equational (or conditional-equational) substitution is vital to formal methods |
| Willamette Mathematics Colloquium • Fall 2002 |
Technical Aspects of the Haskell Language  | Programs are sets of equational definitions
|
| | Based on lambda calculus and combinators
these theories of pure functions inspire higher-order functions and lazy evaluation |
| Willamette Mathematics Colloquium • Fall 2002 |
Technical Aspects of the Haskell Language | | Programs are sets of equational definitions
|
| | Based on lambda calculus and combinators
|
| | Data structure definitions are (roughly) initial algebras
they also look like context-free grammars, thus encouraging embedded languages |
| Willamette Mathematics Colloquium • Fall 2002 |
Technical Aspects of the Haskell Language | | Programs are sets of equational definitions
|
| | Based on lambda calculus and combinators
|
| | Data structure definitions are (roughly) initial algebras
|
| | Strong, static type system provides security and flexibility
Hindley-Milner polymorphism allows convenient inference of types |
| Willamette Mathematics Colloquium • Fall 2002 |
Technical Aspects of the Haskell Language | | Programs are sets of equational definitions
|
| | Based on lambda calculus and combinators
|
| | Data structure definitions are (roughly) initial algebras
|
| | Strong, static type system provides security and flexibility
|
| | Type classes provide for representation independence and data abstraction
we can capture the abstract essence of a component without requiring a specific implementation |
| Willamette Mathematics Colloquium • Fall 2002 |
Technical Aspects of the Haskell Language | | Programs are sets of equational definitions
|
| | Based on lambda calculus and combinators
|
| | Data structure definitions are (roughly) initial algebras
|
| | Strong, static type system provides security and flexibility
|
| | Type classes provide for representation independence and data abstraction
|
| | Types as high-level sketches of structure
Haskell increasingly supports type-level features, encouraging high-level "programming-in-the-large" |