4 citations · 7 across the 7 of their papers we have counts for
7 papers
Compositional pre-processing for automated reasoning in dependent type theory
Valentin Blot, Denis Cousineau, Enzo Crance +4
In the context of interactive theorem provers based on a dependent type theory, automation tactics (dedicated decision procedures, call of automated solvers, ...) are often limited…
General Automation in Coq through Modular Transformations
Valentin Blot, Louise Dubois de Prisque, Chantal Keller +1
Whereas proof assistants based on Higher-Order Logic benefit from external solvers' automation, those based on Type Theory resist automation and thus require more expertise. Indeed…
Sequence Types and Infinitary Semantics
Pierre Vial
We introduce a new representation of non-idempotent intersection types, using \textbf{sequences} (families indexed with natural numbers) instead of lists or multisets. This allows…
Non-idempotent types for classical calculi in natural deduction style
Delia Kesner, Pierre Vial
In the first part of this paper, we define two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types. The non-idempotent approach p…
All the λ-Terms are Meaningful for the Infinitary Relational Model
Pierre Vial
Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type Ω, the auto- autoapplication and they thus do not ensure any fo…
Infinitary Intersection Types as Sequences: a New Answer to Klop's Question
Pierre Vial
We provide a type-theoretical characterization of weakly-normalizing terms in an infinitary lambda-calculus. We adapt for this purpose the standard quantitative (with non-idempoten…
Representing permutations without permutations, or the expressive power of sequence types
Pierre Vial
Recent works by Asada, Ong and Tsukada have championed a rigid description of resources. Whereas in non-rigid paradigms (e.g., standard Taylor expansion or non-idempotent intersect…