Functional Pearl: Type-safe pattern combinators

Courtesy Lambda the Ultimate - Programming Languages Weblog  Mon, 12/22/2008 - 10:35

Functional Pearl: Type-safe pattern combinators , by Morten Rhiger:

Macros still have not made their way into typed higher-order programming languages such as Haskell and Standard ML.

Therefore, to extend the expressiveness of Haskell or Standard ML gradually, one must express new linguistic features in terms of functions that fit within the static type systems of these languages.

This is particularly challenging when introducing features that span across multiple types and that bind variables.

We address this challenge...


 

More related items

Functional Pearl: Species and Functors and Types, Oh...
Functional Pearl: Species and Functors and Types, Oh My! Brent Yorgey, draft. We've discussed species many times before, and discussed at least one introduction for functional programmers....

Why Object-Oriented Languages Need Tail Calls
The Fortress blog has a recent post, Why Object-Oriented Languages Need Tail Calls, where Guy Steele argues for the necessity of proper tail call implementations without rehashing two of the...

Pure imperative programming
Two intensively studied intermediate representations in compiler theory are Static Single Assignment form (SSA) and CPS translations, and Richard Kelsey's 1995 paper, A Correspondence Between...


 

Post new comment

The content of this field is kept private and will not be shown publicly.
computer-internet.marc8.com