Setoid type theory -a syntactic translation, MPC 2019 -13th International Conference on Mathematics of Program Construction, vol.11825, pp.155-196, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02281225
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions, vol.8, p.1, 2012. ,
A relationally parametric model of dependent type theory, The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.503-516, 2014. ,
A Presheaf Model of Parametric Type Theory, Electronic Notes in Theoretical Computer Science, vol.319, pp.67-82, 2015. ,
Proofs for free: Parametricity for dependent types, Journal of Functional Programming, vol.22, issue.2, pp.107-152, 2012. ,
, Proceedings of the 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016.
The next 700 syntactical models of type theory, Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, pp.182-194, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01445835
Gradual typing: a new perspective, vol.16, p.32, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02183382
, Parametric Cubical Type Theory, 2019.
Cubical Type Theory: a constructive interpretation of the univalence axiom, vol.262, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01378906
The Calculus of Constructions, Information and Computation, vol.76, issue.3, pp.95-120, 1988. ,
URL : https://hal.archives-ouvertes.fr/inria-00076024
Foundations of Dependent Interoperability, Journal of Functional Programming, vol.28, p.44, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01629909
Chapter 16 -Higher-Order Unification and Matching, Handbook of Automated Reasoning, 2001. ,
Induction-recursion and initial algebras, Ann. Pure Appl. Log, vol.124, pp.96-105, 2003. ,
A Categorical Semantics of Constructions, Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), pp.264-273, 1988. ,
, Dependent Types in Haskell: Theory and Practice, 2016.
Approximate Normalization for Gradual Dependent Types, vol.88, p.30, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02399594
Abstracting Gradual Typing, See [Bodík and Majumdar, pp.429-442, 2016. ,
Positive Inductive-Recursive Definitions, Log. Methods Comput. Sci, vol.11, p.1, 2015. ,
Structural Recursive Definitions in Type Theory, ICALP, pp.397-408, 1998. ,
Conservativity of Equality Reflection over Intensional Type Theory, Types for Proofs and Programs, International Workshop TYPES'95, vol.1158, pp.153-164, 1995. ,
Hybrid type checking, ACM Transactions on Programming Languages and Systems, vol.32, 2010. ,
Gradual Refinement Types, Proceedings of the 44th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.775-788, 2017. ,
2-Dimensional Directed Type Theory, Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, vol.276, pp.263-289, 2011. ,
On the Meanings of the Logical Constants and the Justifications of the Logical Laws, Nordic Journal of Philosophical Logic, vol.1, pp.11-60, 1996. ,
, Basics of Bidirectionalism, vol.1, p.27, 2018.
Check the Box!, 25th International Conference on Types for Proofs and Programs, 2019. ,
, Graduality from Embedding-Projection Pairs, vol.73, pp.1-73, 2018.
, Gradual Type Theory. See[POPL, vol.15, p.31, 2019.
Towards a Directed Homotopy Type Theory, Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, vol.347, pp.223-239, 2019. ,
Dependent Interoperability, Proceedings of the 6th workshop on Programming Languages Meets Program Verification, pp.3-14, 2012. ,
Dynamic Typing with Dependent Types, Proceedings of the IFIP International Conference on Theoretical Computer Science, pp.437-450, 2004. ,
On universes in type theory, Twenty Five Years of Constructive Type Theory, pp.191-204, 1998. ,
Domain Interpretations of Martin-Löf's Partial Type Theory, Ann. Pure Appl. Log, vol.48, pp.135-196, 1990. ,
Introduction to the Calculus of Inductive Constructions, All About Proofs, Proofs for All, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01094195
Failure is Not an Option -An Exceptional Type Theory, Proceedings of the 27th European Symposium on Programming Languages and Systems, vol.10801, pp.245-271, 2018. ,
The fire triangle: how to mix substitution, dependent elimination, and effects, Proceedings of the ACM on Programming Languages, vol.4, p.28, 2020. ,
A Reasonably Exceptional Type Theory, vol.108, pp.1-108, 2019. ,
Gradual Typing for Functional Languages, Proceedings of the Scheme and Functional Programming Workshop, pp.81-92, 2006. ,
Gradual Typing for Objects, Proceedings of the 21st European Conference on Objectoriented Programming, vol.4609, pp.2-27, 2007. ,
Refined Criteria for Gradual Typing, Leibniz International Proceedings in Informatics (LIPIcs), vol.32, pp.274-293, 2015. ,
Coq Coq correct! verification of type checking and erasure for Coq, Coq. Proc. ACM Program. Lang. 4, POPL (2020), vol.8, pp.1-8, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02380196
Universe Polymorphism in Coq, pp.499-514, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00974721
Dependent types and multi-effects in F ? , See, pp.256-270, 2016. ,
Gradual Certified Programming in Coq, Proceedings of the 11th ACM Dynamic Languages Symposium, pp.26-40, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01238774
Eliminating reflection from type theory, Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp.91-103, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01849166
Eliminating array bound checking through dependent types, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '98), pp.249-257, 1998. ,
A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading, p.27, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01671925
, Nicolas Tabareau, and Éric Tanter 1669