A New Elimination Rule for the Calculus of Inductive Constructions

DOI10.1007/978-3-642-02444-3_3MaRDI QIDQ3638245zbMATH OpenOpenAlexFDO

Authors Bruno Barras, Pierre Corbineau, Benjamin Grégoire, Hugo Herbelin, Jorge Luis Sacchini

Publication date 2 July 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02444-3_3

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Eliminating dependent pattern matching without K
• Eliminating Dependent Pattern Matching
• Pattern matching without K
• The calculus of dependent lambda eliminations
• scientific article; zbMATH DE number 2061701

Cites work

• scientific article; zbMATH DE number 512790 (Why is no real title available?)
• A coverage checking algorithm for LF
• Advanced Functional Programming
• Eliminating Dependent Pattern Matching
• Subset Coercions in Coq
• The view from the left

Cited in

(12)

• Failure is not an option. An exceptional type theory
• Eliminating dependent pattern matching without K
• Reduction and conversion strategies for the calculus of (co)inductive constructions. I
• Equations: a dependent pattern-matching compiler
• Building Decision Procedures in the Calculus of Inductive Constructions
• scientific article; zbMATH DE number 2085175 (Why is no real title available?)
• The view from the left
• The calculus of dependent lambda eliminations
• Eliminating Dependent Pattern Matching
• Pattern matching without K
• scientific article; zbMATH DE number 3849225 (Why is no real title available?)
• Elaborating dependent (co)pattern matching: no pattern left behind

Describes a project that uses

Uses Software

• Epigram
• Coq

This page was built for publication: A New Elimination Rule for the Calculus of Inductive Constructions

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