Relating Computational Effects by ⊤ ⊤-Lifting
From MaRDI portal
Publication:3012918
DOI10.1007/978-3-642-22012-8_13zbMath1334.68043MaRDI QIDQ3012918
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
68N18: Functional programming and lambda calculus
68Q55: Semantics in the theory of computing
03B40: Combinatory logic and lambda calculus
Related Items
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