The bologna optimal higher-order machine
From MaRDI portal
Publication:4339015
DOI10.1017/S0956796800001994zbMath0876.68018OpenAlexW2141493279MaRDI QIDQ4339015
Andrea Asperti, Andrea Naletto, Cecilia Giovannetti
Publication date: 4 June 1997
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796800001994
Related Items (10)
Abstract machines, optimal reduction, and streams ⋮ Recursive Functions with Pattern Matching in Interaction Nets ⋮ Lambda-calculus with director strings ⋮ An Interaction Net Encoding of Gödel’s System $$\mathcal {T}$$ ⋮ Interaction Nets with McCarthy's amb ⋮ Is the Optimal Implementation Inefficient? Elementarily Not ⋮ Interaction nets for linear logic ⋮ Encoding linear logic with interaction combinators ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus ⋮ A Local Graph-rewriting System for Deciding Equality in Sum-product Theories
This page was built for publication: The bologna optimal higher-order machine
