20 citations · 79 across the 14 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.LO2011★ 17 cited
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories
Pierre Clairambault, Peter Dybjer
Seely's paper "Locally cartesian closed categories and type theory" contains a well-known result in categorical type theory: that the category of locally cartesian closed categorie…
cs.LO2011★ 4 cited
Isomorphisms of types in the presence of higher-order references
Pierre Clairambault
We investigate the problem of type isomorphisms in a programming language with higher-order references. We first recall the game-theoretic model of higher-order references by Abram…
cs.LO2011★ 6 cited
Estimation of the length of interactions in arena game semantics
Pierre Clairambault
We estimate the maximal length of interactions between strategies in HO/N game semantics, in the spirit of the work by Schwichtenberg and Beckmann for the length of reduction in si…