Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394575zbMATH OpenOpenAlexFDO

Authors Bruno Barras, Benjamin Grégoire

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Coq without type casts: a complete proof of Coq Modulo Theory
• Reduction and conversion strategies for the calculus of (co)inductive constructions. I
• scientific article; zbMATH DE number 2182487
• scientific article; zbMATH DE number 1301729
• Building Decision Procedures in the Calculus of Inductive Constructions

Cited in

(7)

• Attributive Types for Proof Erasure
• scientific article; zbMATH DE number 2061701 (Why is no real title available?)
• Coq without type casts: a complete proof of Coq Modulo Theory
• scientific article; zbMATH DE number 2182487 (Why is no real title available?)
• Extracting functional programs from Coq, in Coq
• Is sized typing for Coq practical?
• A shallow embedding of pure type systems into first-order logic

Describes a project that uses

Uses Software

• Automath
• OCaml
• Coq

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394575)