Sciweavers

RTA
2007
Springer
15 years 6 months ago
Delayed Substitutions
Abstract. This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. ...
José Espírito Santo
RTA
2007
Springer
15 years 6 months ago
Adjunction for Garbage Collection with Application to Graph Rewriting
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
Dominique Duval, Rachid Echahed, Fréd&eacut...
RTA
2007
Springer
15 years 6 months ago
The Termination Competition
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
Claude Marché, Hans Zantema
68
Voted
RTA
2007
Springer
15 years 6 months ago
Bottom-Up Rewriting Is Inverse Recognizability Preserving
Irène Durand, Géraud Sénizerg...
RTA
2007
Springer
15 years 6 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant
Theoretical Computer Science
Top of PageReset Settings