1000 search results - page 7 / 200 » Nominal rewriting systems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A partial monoid P is a set with a partial multiplication
TLCA
2005
Springer
14 years 29 days ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...