A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage

* Final gross prices may vary according to local VAT.

Get Access


A semantic formulation of Lindley and Stark’s ⊤ ⊤-lifting is given. We first illustrate our semantic formulation of the ⊤ ⊤-lifting in Set with several examples, and apply it to the logical predicates for Moggi’s computational metalanguage. We then abstract the semantic ⊤ ⊤-lifting as the lifting of strong monads across bifibrations with lifted symmetric monoidal closed structures.