A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage
- Cite this paper as:
- Katsumata S. (2005) A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage. In: Ong L. (eds) Computer Science Logic. CSL 2005. Lecture Notes in Computer Science, vol 3634. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.