A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage

Authors:
Shin-ya Katsumata
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 14
Cited 8

Linear logic

Theoretical Computer Science
Notions of computation and monads

Information and Computation
Domains and lambda-calculi

Domains and lambda-calculi
Operational reasoning for functions with local state

Higher order operational techniques in semantics
Representation independence and data abstraction

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Types, Abstractions, and Parametric Polymorphism, Part 2

Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
A New Characterization of Lambda Definability

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Notes on Sconing and Relators

CSL '92 Selected Papers from the Workshop on Computer Science Logic
Logical Relations for Monadic Types

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
⊤⊤-closed relations and admissibility

Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence

Mathematical Structures in Computer Science
Short cut fusion is correct

Journal of Functional Programming
Recursive Polymorphic Types and Parametricity in an Operational Framework

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Reducibility and ⊤⊤-lifting for computation types

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Relational Parametricity for Control Considered as a Computational Effect

Electronic Notes in Theoretical Computer Science (ENTCS)
A Characterisation of Lambda Definability with Sums Via T T-Closure Operators

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Algebras for parameterised monads

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Relating computational effects by ⊤⊤-lifting

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Relating computational effects by ττ-lifting

Information and Computation
Preorders on monads and coalgebraic simulations

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
On monadic parametricity of second-order functionals

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Parametric effect monads and semantics of effect systems

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

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.