Accumulating bindings

Sam Lindley

Research output: Contribution to conferencePaperpeer-review


We give a Haskell implementation of Filinski’s normalisation by evaluation algorithm for the computational lambda-calculus with sums. Taking advantage of extensions to the GHC compiler, our implementation represents objectlanguage types as Haskell types and ensures that type errors are detected statically.Following Filinski, the implementation is parameterised over a residualising monad. The standard residualising monad for sums is a continuation monad. Defunctionalising the uses of the continuation monad we present the bindingtree monad as an alternative.
Original languageEnglish
Publication statusPublished - 2009
Event2009 Workshop on Normalization by Evaluation - Los Angeles, United States
Duration: 15 Aug 200915 Aug 2009


Conference2009 Workshop on Normalization by Evaluation
Country/TerritoryUnited States
CityLos Angeles


Dive into the research topics of 'Accumulating bindings'. Together they form a unique fingerprint.

Cite this