Abstract
This paper presents an efficient implementation of the λ-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as well as other approaches. We conclude the paper with extensive testing to demonstrate the capabilities of this evaluator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asperti, A., Giovannetti, C., Naletto, A.: The Bologna Optimal Higher-Order Machine. Journal of Functional Programming 6(6), 763–810 (1996)
Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Langua ges. Cambridge Tracts in Theoretical Computer Science, vol. 45. Cambridge University Press, Cambridge (1998)
Fernández, M., Mackie, I.: A calculus for interaction nets. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 170–187. Springer, Heidelberg (1999)
Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50(1), 1–102 (1987)
Gonthier, G., Abadi, M., Lévy, J.-J.: The geometry of optimal lambda reduction. In: Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL 1992), January 1992, pp. 15–26. ACM Press, New York (1992)
Lafont, Y.: Interaction nets. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990), January 1990, pp. 95–108. ACM Press, New York (1990)
Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990), January 1990, pp. 16–30. ACM Press, New York (1990)
Lang, F.: Modèles de la beta-réduction pour les implantations. PhD thesis, ENS Lyon (1998)
Lévy, J.-J.: Optimal reductions in the lambda calculus. In: Hindley, J.P., Seldin, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 159–191. Academic Press, London (1980)
Lippi, S.: Encoding left reduction in the lambda-calculus with interaction nets. Mathematical Structures in Computer Science 12(6), 797–822 (2002)
Mackie, I.: The Geometry of Implementation. PhD thesis, Department of Computing, Imperial College of Science, Technology and Medicine (September 1994)
Mackie, I.: YALE: Yet another lambda evaluator based on interaction nets. In: Proceedings of the 3rd International Conference on Functional Programming (ICFP 1998), pp. 117–128. ACM Press, New York (1998)
Mackie, I.: Interaction nets for linear logic. Theoretical Computer Science 247(1), 83–140 (2000)
Mackie, I., Pinto, J.S.: Encoding linear logic with interaction combinators. Information and Computation 176(2), 153–186 (2002)
Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice Hall International, Englewood Cliffs (1987)
Pinto, J.S.: Sequential and concurrent abstract machines for interaction nets. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 267–282. Springer, Heidelberg (2000)
Pinto, J.S.: Weak reduction and garbage collection in interaction nets. In: Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, Valencia, Spain (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mackie, I. (2004). Efficient λ-Evaluation with Interaction Nets. In: van Oostrom, V. (eds) Rewriting Techniques and Applications. RTA 2004. Lecture Notes in Computer Science, vol 3091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25979-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-25979-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22153-1
Online ISBN: 978-3-540-25979-4
eBook Packages: Springer Book Archive