34 search results - page 6 / 7 » The Rewriting Calculus as a Semantics of ELAN |
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...
LFP
1990
13 years 9 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
ENTCS
2006
13 years 7 months ago
2006
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...