The bologna optimal higher-order machine

DOI10.1017/S0956796800001994MaRDI QIDQ4339015zbMATH OpenOpenAlexFDO

Authors Andrea Asperti, Cecilia Giovannetti, Andrea Naletto

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

zbMATH Keywords

Bologna optimal higher-order machine

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 194911
• The optimal implementation of functional programming languages
• Interaction systems II: The practice of optimal reductions
• Optimizing abstract SECD machine code

Cited in

(11)

• A local graph-rewriting system for deciding equality in sum-product theories
• Encoding linear logic with interaction combinators
• Recursive Functions with Pattern Matching in Interaction Nets
• Lambda-calculus with director strings
• From functional programs to interaction nets via the rewriting calculus
• Is the Optimal Implementation Inefficient? Elementarily Not
• Interaction nets with McCarthy's \(\mathsf{amb}\)
• Ordered hypothesis machines
• Interaction nets for linear logic
• Abstract machines, optimal reduction, and streams
• An Interaction Net Encoding of Gödel’s System  $$\mathcal {T}$$

This page was built for publication: The bologna optimal higher-order machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339015)