Advertisement
Published in:
2006 | OriginalPaper | Chapter
Eliminating Dependent Pattern Matching
Authors : Healfdene Goguen, Conor McBride, James McKinna
Published in: Algebra, Meaning, and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper gives a reduction-preserving translation from Coquand’s
dependent pattern matching
[4] into a traditional type theory [11] with universes, inductive types and relations and the axiom
K
[22]. This translation serves as a proof of termination for structurally recursive pattern matching programs, provides an implementable compilation technique in the style of functional programming languages, and demonstrates the equivalence with a more easily understood type theory.