Accumulating bindings

Research output: Contribution to conferencePaper

Abstract

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

Conference

Conference2009 Workshop on Normalization by Evaluation
CountryUnited States
CityLos Angeles
Period15/08/0915/08/09

Cite this

Lindley, S. (2009). Accumulating bindings. Paper presented at 2009 Workshop on Normalization by Evaluation, Los Angeles, United States.