Sciweavers

2864 search results - page 265 / 573
» Constraint Programming in OPL
Sort
View
JFP
2008
97views more  JFP 2008»
15 years 4 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
SPIN
2007
Springer
15 years 11 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
LPNMR
2005
Springer
15 years 11 months ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
POS
1998
Springer
15 years 9 months ago
Incremental Garbage Collection of a Persistent Object Store using PMOS
PMOS is an incremental garbage collector designed specifically to reclaim space in a persistent object store. It is complete in that it will, after a finite number of invocations,...
David S. Munro, Alfred L. Brown, Ronald Morrison, ...
OOPSLA
1995
Springer
15 years 9 months ago
Using a Prototype-based Language for User Interface: The Newton Project's Experience
Object-oriented user interface frameworks are usually implemented in a class-based language. We chose instead to develop a prototype-based language, NewtonScript, for this purpose...
Walter R. Smith