Higher-Order and Symbolic Computation

, Volume 20, Issue 3, pp 333–335

State-transition machines, revisited

Authors

    • Computing and Information Science DepartmentKansas State University
Article

DOI: 10.1007/s10990-007-9017-x

Cite this article as:
Schmidt, D.A. Higher-Order Symb Comput (2007) 20: 333. doi:10.1007/s10990-007-9017-x

Abstract

History and context are given regarding the development of the WNF-machine, the first example of a Krivine machine.

Keywords

Lambda-calculusDenotational semanticsDefunctionalizationContinuation-passing styleKrivine machine

Copyright information

© Springer Science+Business Media, LLC 2007