Recursion equations as a programming language

DOI10.1007/978-3-319-30936-1_24MaRDI QIDQ3188300zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• Comprehending monads
• A methodology for synthesis of recursive functional programs
• Lazy List Comprehension in Logic Programming
• scientific article; zbMATH DE number 572175
• Laws of programming

Cites work

• scientific article; zbMATH DE number 3748392 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• A new method for determining linear precedence functions for precedence grammars
• Can programming be liberated from the von Neumann style?
• Recursion equations as a programming language

Cited in

(6)

• Applications of compactness in the Smyth powerdomain of streams
• Indexed types
• Efficient iterative programs with distributed data collections
• The semantics of lazy functional languages
• Recursion equation sets computing logic programs
• Recursion equations as a programming language

This page was built for publication: Recursion equations as a programming language

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