158
click to vote
RTA
15 years 10 months ago
2007 Springer 
Abstract. This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. ...
107
click to vote
RTA
15 years 10 months ago
2007 Springer 
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. ...
126
click to vote
RTA
15 years 10 months ago
2007 Springer 
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...
120
click to vote
RTA
15 years 10 months ago
2007 Springer 
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-...
|
Theoretical Computer Science