On the relations between monadic semantics

DOI10.1016/j.tcs.2006.12.027zbMath1111.68066OpenAlexW1994376732MaRDI QIDQ879354

Andrzej Filinski

Publication date: 11 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.027

zbMATH Keywords

monadslogical relationsrecursive typescontinuationscomputational metalanguage

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Weakest preconditions in fibrations ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Relating Computational Effects by ⊤ ⊤-Lifting ⋮ Codensity Lifting of Monads and its Dual ⋮ On the unity of duality ⋮ Weakest preconditions in fibrations ⋮ A Coinductive Calculus for Asynchronous Side-Effecting Processes ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types

Cites Work

• Notions of computation and monads
• Call-by-push-value: Decomposing call-by-value and call-by-name
• LCF considered as a programming language
• Retraction approach to CPS transform
• Definitional interpreters for higher-order programming languages
• Relational interpretations of recursive types in an operational setting.
• Modular structural operational semantics
• Relational properties of domains
• A judgmental reconstruction of modal logic
• Representing Control: a Study of the CPS Transformation
• Translating dependency into parametricity
• Computational adequacy via ‘mixed’ inductive definitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item