Sciweavers

34 search results - page 2 / 7
» The Rewriting Calculus as a Semantics of ELAN
Sort
View
FOSSACS
2007
Springer
13 years 11 months ago
The Rewriting Calculus as a Combinatory Reduction System
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...
Clara Bertolissi, Claude Kirchner
PADL
2001
Springer
13 years 9 months ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
ENTCS
2008
106views more  ENTCS 2008»
13 years 5 months ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
WRLA
2010
13 years 3 months ago
Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...
Fernando Rosa Velardo
TLCA
2005
Springer
13 years 11 months ago
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
Olivier Hermant