Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
DOI: 10.1109/lics.1999.782596
|View full text |Cite
|
Sign up to set email alerts
|

Pattern matching as cut elimination

Abstract: We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the Curry-Howard Isomorphism, in the sense that types, both for patterns and terms, correspond to propositions, terms correspond to proofs, and term reduction corresponds to sequent proof normalization performed by cut elimination. The calculu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 25 publications
0
6
0
Order By: Relevance
“…Note that computations can use case splittings x[t | u] to choose between the subterms t or u depending on the contents of the data bound to x. The use of patterns rather than plain variables to annotate formulas in the context of typing judgement is taken from [8] and allows to express more directly the equational style found in Agda. For example, we could write:…”
Section: Focusing and Polarities In The Sequent Calculusmentioning
confidence: 99%
“…Note that computations can use case splittings x[t | u] to choose between the subterms t or u depending on the contents of the data bound to x. The use of patterns rather than plain variables to annotate formulas in the context of typing judgement is taken from [8] and allows to express more directly the equational style found in Agda. For example, we could write:…”
Section: Focusing and Polarities In The Sequent Calculusmentioning
confidence: 99%
“…Pattern matching has been central to their exploitation. Connections to logic were explored in [17,66]. For example, the pattern-matching calculus [65] characterises different approaches to match failure.…”
Section: Notesmentioning
confidence: 99%
“…We first learned to view pattern matching as arising from the invertible left rules of the sequent calculus due to the work of Kesner et al (1996), and Cerrito and Kesner (2004). We have extended their work by building on a focused sequent calculus.…”
Section: Related Workmentioning
confidence: 99%