Semantics of value recursion for Monadic Input/Output
From MaRDI portal
Publication:4787832
DOI10.1051/ita:2002008zbMath1011.68017MaRDI QIDQ4787832
John Launchbury, Andrew Moran, Levent Erkök
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
68N18: Functional programming and lambda calculus
68Q55: Semantics in the theory of computing
18C15: Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads
Related Items
Traced Premonoidal Categories, An abstract monadic semantics for value recursion, An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
Uses Software
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