Pattern matching as cut elimination

Cerrito, Serenella; Kesner, Delia

doi:10.1016/j.tcs.2004.03.032

Cited by 15 publications

(12 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An explicit calculus is then fully detailed (Section 2.2) and some of its basic properties are proved (Section 2.3). Explicit formulations of simpler pattern calculi already appear in [CK04,For02,CFK04].…”

Section: Explicit Matchingmentioning

confidence: 99%

On the Implementation of Dynamic Patterns

Balabonski

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The evaluation mechanism of pattern matching with dynamic patterns is modelled in the Pure Pattern Calculus by one single meta-rule. This contribution presents a refinement which narrows the gap between the abstract calculus and its implementation. A calculus is designed to allow reasoning on matching algorithms. The new calculus is proved to be confluent, and to simulate the original Pure Pattern Calculus. A family of new, matching-driven, reduction strategies is proposed.

show abstract

Section: Explicit Matchingmentioning

confidence: 99%

On the Implementation of Dynamic Patterns

Balabonski

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…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%

Focusing on pattern matching

Krishnaswami

2009

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…The idea is to deal with complex patterns that can be seen either as the where let, pair, l, r, inl, and inr are function symbols. The interested reader is referred to [6] for further details.…”

Section: Map(μxf L) → a Nil Cons(f{x By H} Map(μxf T)) {A Nil mentioning

confidence: 99%

“…The first one consists in the definition of implementation languages given by "explicit" versions of this formalism, where the pattern-matching and the substitution operators are integrated to the syntax. This would result in generalizations of calculi defined in [6,8].…”

Section: Conclusion and Further Workmentioning

confidence: 99%

See 1 more Smart Citation

Expression Reduction Systems with Patterns

Forest

Kesner

2007

J Autom Reasoning

Self Cite

View full text Add to dashboard Cite

We introduce a new higher-order rewriting formalism, called expression reduction systems with patterns (ERSP), where abstraction is allowed not only on variables but also on nested patterns with metavariables. These patterns are built by combining standard algebraic patterns with choice constructors denoting cases. In other words, the nondeterministic choice between different rewrite rules that is inherent to classical rewriting formalisms can be lifted here to the level of patterns. We show that confluence holds for a reasonable class of systems and terms.

show abstract

Pattern matching as cut elimination

Cited by 15 publications

References 14 publications

On the Implementation of Dynamic Patterns

On the Implementation of Dynamic Patterns

Focusing on pattern matching

Expression Reduction Systems with Patterns

Contact Info

Product

Resources

About