Logical relations for call-by-push-value models, via internal fibrations in a 2-category

We give a denotational account of logical relations for call-by-push-value (CBPV) in the fibrational style of Hermida, Jacobs, Katsumata and others. Fibrations—which axiomatise the usual notion of sets-with-relations—provide a clean framework for constructing new, logical relations-style, models. Such models can then be used to study properties such as effect simulation.Extending this picture to CBPV is challenging: the models incorporate both adjunctions and enrichment, making the appropriate notion of fibration unclear. We handle this using 2-category theory. We identify an appropriate 2-category, and define CBPV fibrations to be fibrations internal to this 2-category which strictly preserve the CBPV semantics.Next, we develop the theory so it parallels the classical setting. We give versions of the codomain and subobject fibrations, and show that new models can be constructed from old ones by pullback. The resulting framework enables the construction of new, logical relations-style, models for CBPV.Finally, we demonstrate the utility of our approach with particular examples. These include a generalisation of Katsumata’s ⊤⊤-lifting to CBPV models, an effect simulation result, and a relative full completeness result for CBPV without sum types.

Authors

Institutions

Publication Details

Published
2025-06-23
DOI
https://doi.org/10.1109/lics65433.2025.00061
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Logical relations for call-by-push-value models, via internal fibrations in a 2-category

Satoshi Kura, Pedro H. Azevedo de Amorim, Philip Saville
Constraint Satisfaction and Optimization
article

Logical relations for call-by-push-value models, via internal fibrations in a 2-category

Satoshi Kura, Pedro H. Azevedo de Amorim, Philip Saville
article en

Abstract

We give a denotational account of logical relations for call-by-push-value (CBPV) in the fibrational style of Hermida, Jacobs, Katsumata and others. Fibrations—which axiomatise the usual notion of sets-with-relations—provide a clean framework for constructing new, logical relations-style, models. Such models can then be used to study properties such as effect simulation.Extending this picture to CBPV is challenging: the models incorporate both adjunctions and enrichment, making the appropriate notion of fibration unclear. We handle this using 2-category theory. We identify an appropriate 2-category, and define CBPV fibrations to be fibrations internal to this 2-category which strictly preserve the CBPV semantics.Next, we develop the theory so it parallels the classical setting. We give versions of the codomain and subobject fibrations, and show that new models can be constructed from old ones by pullback. The resulting framework enables the construction of new, logical relations-style, models for CBPV.Finally, we demonstrate the utility of our approach with particular examples. These include a generalisation of Katsumata’s ⊤⊤-lifting to CBPV models, an effect simulation result, and a relative full completeness result for CBPV without sum types.

Waseda University (JP), University of Sussex (GB), University of Oxford (GB), Science Oxford (GB)
Openalex Percentile: Top 67%
Constraint Satisfaction and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.