English
Related papers

Related papers: Logical relations for call-by-push-value models, v…

200 papers

We present an efficient and user-friendly method for constructing any cofibrantly generated model structure on the category of double categories whose trivial fibrations are the "canonical" ones: the double functors which are surjective on…

Algebraic Topology · Mathematics 2025-09-30 Lyne Moser , Maru Sarazola , Paula Verdugo

We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once. This calculus uses explicit…

Logic in Computer Science · Computer Science 2023-06-22 Thibaut Balabonski , Antoine Lanco , Guillaume Melquiond

Many examples of obstruction theory can be formulated as the study of when a lift exists in a commutative square. Typically, one of the maps is a cofibration of some sort and the opposite map is a fibration, and there is a functorial…

Algebraic Topology · Mathematics 2017-07-11 J. Daniel Christensen , William G. Dwyer , Daniel C. Isaksen

We consider the problem of constructing the free bifibration generated by a functor of categories $p : D \to C$. This problem was previously considered by Lamarche, and is closely related to the problem, considered by Dawson, Par\'e, and…

Category Theory · Mathematics 2026-01-16 Bryce Clarke , Gabriel Scherer , Noam Zeilberger

This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our results are semantic in nature and are inspired by Hermida and…

Programming Languages · Computer Science 2015-07-01 Neil Ghani , Patricia Johann , Clement Fumex

The Caus[-] construction takes a compact closed category of basic processes and yields a *-autonomous category of higher-order processes obeying certain signalling/causality constraints, as dictated by the type system in the resulting…

Logic in Computer Science · Computer Science 2022-05-24 Will Simmons , Aleks Kissinger

Everyone knows that if you have a bivariant homology theory satisfying a base change formula, you get an representation of a category of correspondences. For theories in which the covariant and contravariant transfer maps are in mutual…

Category Theory · Mathematics 2022-12-21 Andrew W. Macpherson

Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…

Logic · Mathematics 2022-06-10 Alec Rhea

We extend the CV conjecture to quantum states of two-mode Hermitian systems using the framework of information geometry. Specifically, we conjecture that the Krylov complexity of a quantum state equals the volume of the Fubini-Study metric.…

High Energy Physics - Theory · Physics 2026-05-22 Ke-Hong Zhai , Lei-Hua Liu , Hai-Qing Zhang

We characterize the category of Sambin's positive topologies as a fibration over the category of locales Loc. The fibration is obtained by applying the Grothendieck construction to a doctrine over Loc. We then construct an adjunction…

General Topology · Mathematics 2018-12-24 Francesco Ciraulo , Tatsuji Kawai , Samuele Maschio

We present a doctrinal approach to category theory, obtained by abstracting from the indexed inclusions (via discrete fibrations and opfibrations) of the left and of the right actions of X in Cat in categories over X. Namely, a "weak…

Category Theory · Mathematics 2010-03-30 Claudio Pisani

A new version of the Hadwiger theorem on convex functions is established and an explicit representation of functional intrinsic volumes is found using new functional Cauchy-Kubota formulas. In addition, connections between functional…

Functional Analysis · Mathematics 2025-07-28 Andrea Colesanti , Monika Ludwig , Fabian Mussnig

Existing Curry-Howard interpretations of call-by-value evaluation for the $\lambda$-calculus are either based on ad-hoc modifications of intuitionistic proof systems or involve additional logical concepts such as classical logic or linear…

Logic in Computer Science · Computer Science 2024-11-06 Beniamino Accattoli

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

Polarization of types in call-by-push-value naturally leads to the separation of inductively defined observable values (classified by positive types), and coinductively defined computations (classified by negative types), with adjoint…

Programming Languages · Computer Science 2022-01-27 Zeeshan Lakhani , Ankush Das , Henry DeYoung , Andreia Mordido , Frank Pfenning

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

Given a semistable fibration $f\colon X\to B$ we introduce a correspondence between foliations $\mathcal{F}$ on $X$ and local systems $\mathbb{L}$ on $B$. Building up on this correspondence we find conditions that give maximal rationally…

Algebraic Geometry · Mathematics 2022-05-31 Luca Rizzi , Francesco Zucconi

We derive exact and closed-form expressions for a large class of two-point and three-point inflation correlators with the tree-level exchange of a single massive particle. The intermediate massive particle is allowed to have arbitrary mass,…

High Energy Physics - Theory · Physics 2023-07-26 Zhehan Qin , Zhong-Zhi Xianyu

Compositional embedding models build a representation (or embedding) for a linguistic structure based on its component word embeddings. We propose a Feature-rich Compositional Embedding Model (FCM) for relation extraction that is…

Computation and Language · Computer Science 2015-09-16 Matthew R. Gormley , Mo Yu , Mark Dredze

We explain how to construct in two different ways a cartesian closed fibration of higher-order regular languages in the sense of Salvati. In the first construction, we use fibrational techniques to derive the cartesian closed fibration from…

Logic in Computer Science · Computer Science 2026-01-27 Paul-André Melliès , Vincent Moreau