15 search results - page 2 / 3 » Termination and Confluence of Higher-Order Rewrite Systems |
LICS
1991
IEEE
13 years 9 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
ENTCS
2008
13 years 5 months ago
2008
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
FSEN
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
IEICET
2007
13 years 5 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...