output
20162020
most citedGradualizing the Calculus of Inductive Constructions

16 citations

5 papers

cs.PL2020★ 16 cited

Gradualizing the Calculus of Inductive Constructions

Meven Lennon-Bertrand, Kenji Maillard, Nicolas Tabareau +1

We investigate gradual variations on the Calculus of Inductive Construction (CIC) for swifter prototyping with imprecise types and terms. We observe, with a no-go theorem, a crucia…

cs.LO2019

Revisiting the duality of computation: an algebraic analysis of classical realizability models

Étienne Miquey

In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories.…

math.AT2019★ 1 cited

The folk model category structure on strict -categories is monoidal

Dimitri Ara, Maxime Lucas

We prove that the folk model category structure on the category of strict -categories, introduced by Lafont, Métayer and Worytkiewicz, is monoidal, first, for the Gray tensor pr…

cs.LO2018

Realizability Interpretation and Normalization of Typed Call-by-Need -calculus With Control

Étienne Miquey, Hugo Herbelin

We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$λ…

cs.AI2016★ 10 cited

Global Constraint Catalog, Volume II, Time-Series Constraints

Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence +5

First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition s…