4767 search results - page 74 / 954 » Structures for Abstract Rewriting |
LPAR
2007
Springer
14 years 3 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
COLING
2008
13 years 10 months ago
2008
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...
BIRTHDAY
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...