Recursion Equations as a Programming Language

DOI10.1007/978-3-319-30936-1_24zbMath1343.68002OpenAlexW1582257052MaRDI QIDQ3188300

No author found.

Publication date: 17 August 2016

Published in: A List of Successes That Can Change the World (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30936-1_24

zbMATH Keywords

lazy evaluationKent Recursive Calculatorlist comprehensionslist of successes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Collected or selected works; reprintings or translations of classics (01A75) History of computer science (68-03)

Related Items (4)

Recursion Equations as a Programming Language ⋮ Applications of compactness in the Smyth powerdomain of streams ⋮ The semantics of lazy functional languages ⋮ Indexed types

Cites Work

• Recursion Equations as a Programming Language
• Can programming be liberated from the von Neumann style?
• A new method for determining linear precedence functions for precedence grammars
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursion Equations as a Programming Language