Add to ORKGWe present an axiomatization of term rewriting systems in Forum, a presentation of linear logic in terms of uniform proofs, which allows us to relate provability and derivability in a natural way. The resulting theory can be used to prove properties of the original system. Vice versa the structure of the formulas used in the encoding suggests us a possible operational interpretation of Forum. The considered fragment turns out to be an extension of previously proposed multi-conclusion logics
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting sy...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
We present an axiomatization of term rewriting systems in Forum, a presentation of linear logic in t...
AbstractRewriting logic [40] is proposed as a logical framework in which other logics can be represe...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
We introduce an abstract general notion of system of equations and rewrites between terms, called Te...
AbstractThe Rewriting Calculus has been proposed as a language for defining term rewriting strategie...
AbstractI formally define a logic of special relations with the purpose of capturing those logics th...
AbstractSince rewriting logic has been introduced, it has shown its adequateness both as a semantic ...
International audienceSince rewriting logic has been introduced, it has shown its adequateness both ...
AbstractThe theory of cut-free sequent proofs has been used to motivate and justify the design of a ...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Term rewriting systems are important for computability theory of abstract data types, for automatic ...
Rewriting logic [Mes92] is a logic of action, whose models are concurrent systems and whose deductio...
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting sy...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
We present an axiomatization of term rewriting systems in Forum, a presentation of linear logic in t...
AbstractRewriting logic [40] is proposed as a logical framework in which other logics can be represe...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
We introduce an abstract general notion of system of equations and rewrites between terms, called Te...
AbstractThe Rewriting Calculus has been proposed as a language for defining term rewriting strategie...
AbstractI formally define a logic of special relations with the purpose of capturing those logics th...
AbstractSince rewriting logic has been introduced, it has shown its adequateness both as a semantic ...
International audienceSince rewriting logic has been introduced, it has shown its adequateness both ...
AbstractThe theory of cut-free sequent proofs has been used to motivate and justify the design of a ...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Term rewriting systems are important for computability theory of abstract data types, for automatic ...
Rewriting logic [Mes92] is a logic of action, whose models are concurrent systems and whose deductio...
Since its introduction, more than one decade ago, rewriting logic has attracted the interest of both...
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting sy...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...