Eliminating Dependent Pattern Matching

Healfdene Goguen, Conor McBride, James McKinna

Research output: Chapter in Book/Report/Conference proceedingChapter

30 Citations (Scopus)


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
Number of pages20
ISBN (Electronic)9783540354642
ISBN (Print)9783540354628
Publication statusPublished - 2006

Publication series

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


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

Cite this