Idris, a general-purpose dependently typed programming language: Design and implementation

E Brady - Journal of functional programming, 2013 - cambridge.org
Many components of a dependently typed programming language are by now well
understood, for example, the underlying type theory, type checking, unification and …

I got plenty o'nuttin'

C McBride - A List of Successes That Can Change the World …, 2016 - Springer
Work to date on combining linear types and dependent types has deliberately and
successfully avoided doing so. Entirely fit for their own purposes, such systems wisely insist …

Complete and easy bidirectional typechecking for higher-rank polymorphism

J Dunfield, NR Krishnaswami - ACM SIGPLAN Notices, 2013 - dl.acm.org
Bidirectional typechecking, in which terms either synthesize a type or are checked against a
known type, has become popular for its scalability (unlike Damas-Milner type inference …

[PDF][PDF] Mathematical components

A Mahboubi, E Tassi - Online book, 2021 - join.inria.fr
Mathematical Components Page 1 Mathematical Components Assia Mahboubi INRIA
Microsoft Research Joint Centre INRIA Saclay – Île-de-France École Polytechnique, Palaiseau …

Transporting functions across ornaments

PÉ Dagand, C McBride - ACM SIGPLAN Notices, 2012 - dl.acm.org
Programming with dependent types is a blessing and a curse. It is a blessing to be able to
bake invariants into the definition of datatypes: we can finally write correct-by-construction …

Gradualizing the calculus of inductive constructions

M Lennon-Bertrand, K Maillard, N Tabareau… - ACM Transactions on …, 2022 - dl.acm.org
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 crucial …

Complete bidirectional typing for the calculus of inductive constructions

M Lennon-Bertrand - arXiv preprint arXiv:2102.06513, 2021 - arxiv.org
This article presents a bidirectional type system for the Calculus of Inductive Constructions
(CIC). It introduces a new judgement intermediate between the usual inference and …

Bidirectional Typing for the Calculus of Inductive Constructions

M Lennon-Bertrand - 2022 - theses.hal.science
Durant leurs plus de 50 ans d'existence, les assistants à la preuve se sont établis comme
des outils permettant un haut niveau de fiabilité dans de nombreuses applications …

[PDF][PDF] Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity

F Blanqui - 7th International Conference on Formal Structures for …, 2022 - drops.dagstuhl.de
The encoding of proof systems and type theories in logical frameworks is key to allow the
translation of proofs from one system to the other. The λΠ-calculus modulo rewriting is a …

A unification algorithm for Coq featuring universe polymorphism and overloading

B Ziliani, M Sozeau - Proceedings of the 20th ACM SIGPLAN …, 2015 - dl.acm.org
Unification is a core component of every proof assistant or programming language featuring
dependent types. In many cases, it must deal with higher-order problems up to conversion …