764 search results - page 110 / 153 » On the Expressibility of Stable Logic Programming |
164
click to vote
POPL
1993
ACM
15 years 8 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
153
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
132
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
142
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
139
click to vote
ICSE
2011
IEEE-ACM
14 years 7 months ago
2011
IEEE-ACM
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...