Proof of termination of the rewriting system SUBST on CCL
Theoretical Computer Science
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
A representation of Lambda terms suitable for operations on their intensions
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving the three instruction machine
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
TIM: A simple, lazy abstract machine to execute supercombinatorics
Proceedings of the Functional Programming Languages and Computer Architecture
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Programming and Computing in HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Deriving a lazy abstract machine
Journal of Functional Programming
A functional correspondence between call-by-need evaluators and lazy abstract machines
Information Processing Letters
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
A concrete framework for environment machines
ACM Transactions on Computational Logic (TOCL)
State-transition machines, revisited
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Improving the lazy Krivine machine
Higher-Order and Symbolic Computation
On the correctness of the Krivine machine
Higher-Order and Symbolic Computation
Checking Dependent Types Using Compiled Code
Implementation and Application of Functional Languages
Central European Functional Programming School
From natural semantics to abstract machines
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Deriving interpretations of the gradually-typed lambda calculus
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
| Hi-index | 0.00 |
Two abstract machines reducing terms to their full normal form are presented in this paper. They are based on Krivine's abstract machine [Kri85] which uses an environment to store arguments of function calls. A proof of their correctness is then stated in the abstract framework of &lgr;&sgr;-calculus [Cur89].