54 search results - page 6 / 11 » Proving operational termination of membership equational pro... |
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
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...
CSFW
1997
IEEE
13 years 11 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
LISP
2007
13 years 7 months ago
2007
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callby-value CPS translation, Danvy a...