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

  • Shin-ya Katsumata
Conference paper

DOI: 10.1007/11538363_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3634)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Shin-ya Katsumata
    • 1
  1. 1.Research Institute for Mathematical SciencesKyoto University 

Personalised recommendations