145 search results - page 9 / 29 » K-Maude: A Rewriting Based Tool for Semantics of Programming... |
ENTCS
2007
13 years 7 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
JUCS
2006
13 years 7 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
SEMCO
2009
IEEE
14 years 2 months ago
2009
IEEE
—We present LAIR: A domain-specific language that enables users to specify actions to be taken upon meeting specific semantic frames in a text, in particular to rephrase and re...
APLAS
2000
ACM
13 years 12 months ago
2000
ACM
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...