1055 search results - page 148 / 211 » On the Semantics of Logic Programs with Preferences |
POPL
1998
ACM
14 years 1 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
ICFP
2012
ACM
11 years 11 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
ESOP
2012
Springer
12 years 4 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
VL
1997
IEEE
14 years 1 months ago
1997
IEEE
The large number of programming languages in the world is a consequence of the broad spectrum of human preferences for different notational styles and semantic models, which depen...