[PRL] CEK in Haskell

Wed Aug 31 11:42:50 EDT 2011

The CEK machine is my 'rendering' of Reynolds' interpreter. I needed state transitions instead of interpreter recursions so that I could 'count' more easily. 

The CEK machine is meant to be implemented easily in any language. I am glad to see that even Haskell is up to snuff. 

-- Matthias

On Aug 31, 2011, at 11:09 AM, David Van Horn wrote:

> Writing CEK-style interpreters (or semantics) in Haskell
> http://matt.might.net/articles/cek-machines/
> 
> I promise I had *zero* to do with this Haskell code.
> 
> David
> 
> _______________________________________________
> PRL mailing list
> PRL at lists.ccs.neu.edu
> https://lists.ccs.neu.edu/bin/listinfo/prl