YALE

DOI10.1145/289423.289434zbMath1369.68109OpenAlexW2025834181MaRDI QIDQ5348892

Ian Mackie

Publication date: 21 August 2017

Published in: Proceedings of the third ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/289423.289434

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (17)

Operational equivalence for interaction nets. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The graphical Krivine machine ⋮ Recursive Functions with Pattern Matching in Interaction Nets ⋮ Compilation of Interaction Nets ⋮ An Interaction Net Encoding of Gödel’s System  $$\mathcal {T}$$ ⋮ An Explicit Framework for Interaction Nets ⋮ An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine ⋮ Interaction Nets with McCarthy's amb ⋮ Interaction nets for linear logic ⋮ Encoding linear logic with interaction combinators ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus ⋮ Hard combinators ⋮ Interaction Nets With Nested Pattern Matching ⋮ Token-passing Nets for Functional Languages

This page was built for publication: YALE