A New Elimination Rule for the Calculus of Inductive Constructions

DOI10.1007/978-3-642-02444-3_3zbMATH Open1246.68085OpenAlexW1571309311MaRDI QIDQ3638245FDOQ3638245

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

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• A coverage checking algorithm for LF
• Title not available (Why is that?)
• The view from the left
• Eliminating Dependent Pattern Matching
• Subset Coercions in Coq
• Advanced Functional Programming

Cited In (12)

• Eliminating dependent pattern matching without K
• Failure is not an option. An exceptional type theory
• 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
• Title not available (Why is that?)
• The view from the left
• The calculus of dependent lambda eliminations
• Eliminating Dependent Pattern Matching
• Pattern matching without K
• Title not available (Why is that?)
• Elaborating dependent (co)pattern matching: no pattern left behind

Uses Software

• Coq
• Epigram

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)