Relating Computational Effects by ⊤ ⊤-Lifting

DOI10.1007/978-3-642-22012-8_13zbMath1334.68043OpenAlexW2104602076MaRDI QIDQ3012918

Shin-ya Katsumata

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_13

Mathematics Subject Classification ID

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

Related Items (1)

Logical Relations and Nondeterminism

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• On the relations between monadic semantics
• Categorical logic and type theory
• Axioms for recursion in call-by-value
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
• Logical relations for monadic types
• Handlers of Algebraic Effects
• Proofs of strong normalisation for second order classical natural deduction
• Parametric polymorphism and operational equivalence
• Semantics for Algebraic Operations
• Inductive reasoning about effectful data types
• Computer Science Logic
• Typed Lambda Calculi and Applications

This page was built for publication: Relating Computational Effects by ⊤ ⊤-Lifting