An abstract monadic semantics for value recursion

DOI10.1051/ita:2004018zbMath1089.68029OpenAlexW2150691311MaRDI QIDQ4659889

Eugenio Moggi, Amr Sabry

Publication date: 21 March 2005

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2004__38_4_375_0

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (4)

Compilation of extended recursion in call-by-value functional languages ⋮ Traced Premonoidal Categories ⋮ Structuring Operational Semantics: Simplification and Computation ⋮ Comonadic Notions of Computation

Uses Software

• Haskell
• GHC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• Compilation of extended recursion in call-by-value functional languages
• A syntactic approach to type soundness
• Generalising monads to arrows
• A type system for higher-order modules
• Recursive monadic bindings
• The call-by-need lambda calculus
• A calculus of module systems
• The call-by-need lambda calculus
• Premonoidal categories and notions of computation
• The recursive record semantics of objects revisited
• Semantics of value recursion for Monadic Input/Output
• A new notation for arrows
• Functional and Logic Programming
• The Mechanical Evaluation of Expressions

This page was built for publication: An abstract monadic semantics for value recursion