Skip to search formSkip to main contentSkip to account menu

Pattern calculus

Pattern calculus bases all computation on pattern matching of a very general kind. Like lambda calculus, it supports auniform treatment of function… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
  • B. JayJose Vergara
  • 2013
  • Corpus ID: 6758690
Pattern calculus treats all computation as pattern matching, which is, in turn, central to the implementation of programming… 
2012
2012
We construct explicit formulae for the eigenvalues of certain invariants of the Lie superalgebra gl(m|n) using characteristic… 
2010
2010
In concurrent pattern calculus two processes interact through pattern unification. This atomic interaction supports input, output… 
2010
2010
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives… 
2009
2009
Change operators are the building blocks of ontology evolution. Different layers of change operators have been suggested. In this… 
2008
2008
. This paper provides a new, decidable definition of the higher-order recursive path ordering. Type comparisons are made only when… 
2004
2004
Patterns are concise, but rich in semantic, representation of data. The approaches proposed in the literature to cope with… 
1999
1999
We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and…