2009
DOI: 10.1007/978-3-540-89185-7
|View full text |Cite
|
Sign up to set email alerts
|

Pattern Calculus

Abstract: The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: KünkelLopka, GmbH Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) To my parents VII VIII ForewordIntegrating the new technology in established settings in order to enhance their expres… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(16 citation statements)
references
References 39 publications
0
16
0
Order By: Relevance
“…Related works. The first presentation of the pattern calculus [13] comes with a ML-style type system. This type system is less expressive than ours and does not prevent match failure during reduction, but it is decidable.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Related works. The first presentation of the pattern calculus [13] comes with a ML-style type system. This type system is less expressive than ours and does not prevent match failure during reduction, but it is decidable.…”
Section: Resultsmentioning
confidence: 99%
“…In[19] the proof fails at Lemma 10. There is a counterexample to the converse of equivalence(13), surprisingly due to the notion of modified substitution used there.…”
mentioning
confidence: 99%
“…This style of pattern matching, also known as path polymorphism [16,18,19], cannot be expressed in pure λ-calculus or even in a combinator calculus with the operators Y , S, K, B. So, our calculus has the operator F and the novel operator E, and we make them play key roles when we de-sugar pattern matching.…”
Section: Extensionsmentioning
confidence: 99%
“…Berarducci and Bohm achieved this by considering how to solve equations inside lambda calculus but now there is a more direct and powerful method, in the pattern calculus of Jay and Kesner [16,18,19]. Although it may be possible to achieve our main goals in pure pattern calculus (or even static pattern calculus), this paper adopts a simpler and more direct approach.…”
Section: Introductionmentioning
confidence: 99%
“…This ensures the correctness of the compilation, but he does not consider the question of coverage checking. Jay (2004) has also introduced a pattern calculus. Roughly, he takes the view that datatypes are just subsets of the universe of program terms (like Prolog's Herbrand universe), and then allows defining programs to match on the underlying tree representations of arbitrary data.…”
Section: Related Workmentioning
confidence: 99%