Sciweavers

3 search results - page 1 / 1
» Universal Algebra for Termination of Higher-Order Rewriting
Sort
View
63
Voted
RTA
2005
Springer
15 years 2 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
CADE
2002
Springer
15 years 9 months ago
Basic Syntactic Mutation
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
Christopher Lynch, Barbara Morawska
PPDP
2007
Springer
15 years 3 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana