Eliminating Dependent Pattern Matching

Healfdene Goguen, Conor McBride, James McKinna

Research output: Chapter in Book/Report/Conference proceedingChapter

20 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationAlgebra, Meaning, and Computation
PublisherSpringer
Pages521-540
Number of pages20
ISBN (Electronic)9783540354642
ISBN (Print)9783540354628
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
Volume4060
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint Dive into the research topics of 'Eliminating Dependent Pattern Matching'. Together they form a unique fingerprint.

  • Cite this

    Goguen, H., McBride, C., & McKinna, J. (2006). Eliminating Dependent Pattern Matching. In Algebra, Meaning, and Computation (pp. 521-540). (Lecture Notes in Computer Science; Vol. 4060). Springer. https://doi.org/10.1007/11780274_27