Semantics of value recursion for Monadic Input/Output

DOI10.1051/ita:2002008zbMath1011.68017OpenAlexW1980408208MaRDI QIDQ4787832

Levent Erkök, Andrew Moran, John Launchbury

Publication date: 22 January 2003

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

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

zbMATH Keywords

monadstransition semantics

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Related Items (4)

Shortcut fusion rules for the derivation of circular and higher-order programs ⋮ An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry ⋮ An abstract monadic semantics for value recursion ⋮ Traced Premonoidal Categories

Uses Software

• Haskell
• Lava

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• The revised report on the syntactic theories of sequential control and state
• Generalising monads to arrows
• Recursive monadic bindings
• Deriving a lazy abstract machine
• Premonoidal categories and notions of computation
• Traced Premonoidal Categories
• Parametric polymorphism and operational equivalence
• Traced monoidal categories
• Equivalence in functional languages with effects
• A new notation for arrows

This page was built for publication: Semantics of value recursion for Monadic Input/Output