Computer Science Logic

DOI10.1007/11538363zbMATH Open1136.03307OpenAlexW2479351976MaRDI QIDQ5394571FDOQ5394571

Authors: Shin-ya Katsumata 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363

Recommendations

• Typed Lambda Calculi and Applications
• Relating computational effects by \(\top \top \)-lifting
• Relating Computational Effects by ⊤ ⊤-Lifting
• Lifting theorems for Kleisli categories
• An equational notion of lifting monad

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Cited In (14)

• A fibrational tale of operational logical relations: pure, effectful and differential
• MetaSoft primer. Towards a metalanguage for applied denotational semantics
• Kantorovich functors and characteristic logics for behavioural distances
• Algebras for parameterised monads
• Weakest preconditions in fibrations
• Codensity lifting of monads and its dual
• Deriving logical relations from interpretations of predicate logic
• Weakest preconditions in fibrations
• Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
• Relational parametricity for control considered as a computational effect
• Relating Computational Effects by ⊤ ⊤-Lifting
• Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
• Relating computational effects by \(\top \top \)-lifting

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394571)