Haskell is Not Not ML

Add to your list(s) Download to your calendar using vCal

• Benjamin Rudiak-Gould (University of Cambridge)
• Friday 21 November 2008, 15:15-16:15
• GS15, Computer Laboratory.

If you have a question about this talk, please contact Boris Feigin.

In this talk I’ll describe a simple intermediate language which is useful for modeling the semantics of strict and non-strict variants of ML and also for compiling them to efficient machine code. The language (“IL”) is similar to core ML, but with continuations (logical negation) instead of functions (logical implication). IL is non-classical (T and ¬¬T are different types, for example), and classically equivalent types in IL turn out to model different forms of non-termination in ML —in particular, “Haskell” (non-strict) types are the double negation of “ML” (strict) types. IL can be compiled to efficient machine code in such a way that “ML” values have the same in-memory representation as fully-evaluated “Haskell” values, so IL can be used to compile ML and Haskell programs to a common virtual machine within which ML data can be passed to Haskell code at no cost and Haskell data can be passed to ML code with only the cost of a Haskell deepSeq.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Programming Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• GS15, Computer Laboratory
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.