Sciweavers

287 search results - page 35 / 58
» Automated abstraction of class diagrams
Sort
View
LPAR
1999
Springer
13 years 11 months ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
PLILP
1998
Springer
13 years 11 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
LICS
1997
IEEE
13 years 11 months ago
Towards a Mathematical Operational Semantics
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a cohe...
Daniele Turi, Gordon D. Plotkin
ICLP
1994
Springer
13 years 11 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
FLOPS
2004
Springer
13 years 11 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar