99 search results - page 6 / 20 » Automated termination proofs for haskell by term rewriting |
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
WFLP
2009
Springer
14 years 2 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
PLILP
1998
Springer
13 years 11 months ago
1998
Springer
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...