2006 | OriginalPaper | Buchkapitel
Eliminating Dependent Pattern Matching
verfasst von : Healfdene Goguen, Conor McBride, James McKinna
Erschienen in: Algebra, Meaning, and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.