1020 search results - page 164 / 204 » Tight Semantics for Logic Programs |
ICFP
2007
ACM
14 years 10 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
ICFP
2006
ACM
14 years 10 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
AMAI
2004
Springer
14 years 3 months ago
2004
Springer
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...
ICFP
2008
ACM
14 years 10 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
POPL
2010
ACM
14 years 7 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...