Sciweavers

20 search results - page 2 / 4
» rta 2005
Sort
View
RTA
2005
Springer
13 years 10 months ago
Universal Algebra for Termination of Higher-Order Rewriting
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Makoto Hamana
RTA
2005
Springer
13 years 10 months ago
Orderings for Innermost Termination
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
Mirtha-Lina Fernández, Guillem Godoy, Alber...
RTA
2005
Springer
13 years 10 months ago
Partial Inversion of Constructor Term Rewriting Systems
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
RTA
2005
Springer
13 years 10 months ago
Call-by-Value Is Dual to Call-by-Name - Reloaded
We consider the relation of the dual calculus of Wadler (2003) to the λµ-calculus of Parigot (1992). We give translations from the λµ-calculus into the dual calculus and back a...
Philip Wadler
RTA
2005
Springer
13 years 10 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot