暂无分享,去创建一个
[1] Zakaria Chihani,et al. Foundational Proof Certificates in First-Order Logic , 2013, CADE.
[2] Ronan Saillard,et al. Typechecking in the lambda-Pi-Calculus Modulo : Theory and Practice. (Vérification de typage pour le lambda-Pi-Calcul Modulo : théorie et pratique) , 2015 .
[3] Benjamin Werner,et al. Importing HOL Light into Coq , 2010, ITP.
[4] Joe Hurd,et al. The OpenTheory Standard Theory Library , 2011, NASA Formal Methods.
[5] Andrea Asperti,et al. The Matita Interactive Theorem Prover , 2011, CADE.
[6] Catherine Dubois,et al. FoCaLiZe and Dedukti to the Rescue for Proof Interoperability , 2017, ITP.
[7] Wai Wong,et al. Recording and Checking HOL Proofs , 1995, TPHOLs.
[8] Thierry Coquand,et al. An Analysis of Girard's Paradox , 1986, LICS.
[9] Peter B. Andrews. An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.
[10] Brigitte Pientka. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions , 2008, POPL '08.
[11] Frank Pfenning,et al. Higher-order abstract syntax , 1988, PLDI '88.
[12] Furio Honsell,et al. A framework for defining logics , 1993, JACM.
[13] Denis Cousineau,et al. Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo , 2007, TLCA.