2272 search results - page 257 / 455 » A Calculus for |
130
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
115
Voted
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
113
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Dπ is a simple distributed extension of the π-calculus in which agents are explicitly located, and may use an explicit migration construct to move between locations. In this pap...
129
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms...
140
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...