Loading...
Please wait, while we are loading the content...
Similar Documents
The sketch of a polymorphic symphony (2002).
| Content Provider | CiteSeerX |
|---|---|
| Author | Lämmel, Ralf |
| Abstract | Functional strategies were previously defined as first-class generic functions which can traverse into terms while mixing uniform and type-specific behaviour. The first-class status is witnessed by a combinator style of generic programming. This symphony reconstructs functional strategies as an amalgamation of certain bits of parametric polymorphism, type case, polytypism, and overloading. We illustrate the expressiveness and conciseness of this reconstruction by providing highly parameterized definitions of traversal schemes. The resulting style of generic programming is extremely lightweight and easy to use because it only involves two special combinators not yet present in standard functional programming. The reconstruction is geared towards Haskell, and it is supported by a generative tool YAGH—Yet Another Generic Haskell. |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Polymorphic Symphony Generic Programming Functional Strategy Generic Haskell Special Combinators Type Case Certain Bit Combinator Style Parameterized Definition First-class Status Towards Haskell Parametric Polymorphism Type-specific Behaviour Generative Tool Yagh Yet Standard Functional Programming Traversal Scheme Resulting Style First-class Generic Function |
| Content Type | Text |
