Computer Science – Programming Languages
Scientific paper
2012-02-14
EPTCS 76, 2012, pp. 163-177
Computer Science
Programming Languages
In Proceedings MSFP 2012, arXiv:1202.2407
Scientific paper
10.4204/EPTCS.76.10
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.
No associations
LandOfFree
From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-88592