A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage-Reference-Cited by-同舟云学术

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

Published:2005 Issue: Volume: Page:87-102
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Katsumata Shin-ya

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11538363_8.pdf

Reference24 articles.

1. Abadi, M.: TT-closed relations and admissibility. MSCS 10(3), 313–320 (2000)

2. Cambridge Tracts in Theoretical Computer Science;R. Amadio,1998

3. Lecture Notes in Computer Science;J. G.-Larrecq,2002

4. Girard, J.Y.: Linear logic. Theor. Comp. Sci. 50, 1–102 (1987)

5. Hasegawa, M.: Categorical glueing and logical predicates for models of linear logic. Technical Report RIMS-1223, Research Institute for Mathematical Sciences, Kyoto University (1999)

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Kantorovich Functors and Characteristic Logics for Behavioural Distances;Lecture Notes in Computer Science;2023

3. Weakest preconditions in fibrations;Mathematical Structures in Computer Science;2022-04

4. Fully abstract models for effectful λ-calculi via category-theoretic logical relations;Proceedings of the ACM on Programming Languages;2022-01-12

5. Fibrational bisimulations and quantitative reasoning: Extended version;Journal of Logic and Computation;2021-09