From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine

This paper presents the derivation of an executable Krivine abstract machine from a small step interpreter for the simply typed lambda calculus in the dependently typed programming language Agda.

Bibliographic Details
Main Author: Wouter Swierstra
Format: Article
Language:English
Published: Open Publishing Association 2012-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1202.2924v1