Computer Science Logic
From MaRDI portal
Publication:5394571
DOI10.1007/11538363zbMath1136.03307OpenAlexW2479351976MaRDI QIDQ5394571
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
Related Items
Algebras for Parameterised Monads, 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, Kantorovich functors and characteristic logics for behavioural distances, A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators, Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases, Relating Computational Effects by ⊤ ⊤-Lifting, Codensity Lifting of Monads and its Dual, Weakest preconditions in fibrations, Relational Parametricity for Control Considered as a Computational Effect
