论文信息 - CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo

CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo

We show how to translate the Calculus of Inductive Constructions (CIC) as implemented by Coq into the ??-calculus modulo, a proposed common backend proof format for heterogeneous proof assistants.

Guillaume Burel | Mathieu Boespflug

[1] Claude Kirchner,et al. HOL-λσ: an intentional first-order expression of higher-order logic , 2001, Mathematical Structures in Computer Science.

[2] Denis Cousineau,et al. Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo , 2007, TLCA.

[3] Gilles Dowek,et al. What Is a Theory? , 2002, STACS.

[4] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .

[5] Gilles Dowek,et al. Polarized Resolution Modulo , 2010, IFIP TCS.

[6] Olivier Hermant,et al. The λΠ-calculus Modulo as a Universal Proof Language , 2012, PxTP.

[7] Luís Pinto,et al. Type-based termination of recursive definitions , 2004, Mathematical Structures in Computer Science.

[8] Hugo Herbelin,et al. The Coq proof assistant : reference manual, version 6.1 , 1997 .

[9] Christine Paulin-Mohring,et al. The coq proof assistant reference manual , 2000 .