3513 search results - page 450 / 703 » Super Logic Programs |
128
Voted
ICFP
2008
ACM
16 years 3 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...
125
Voted
POPL
2010
ACM
16 years 19 days 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...
177
Voted
FROCOS
2009
Springer
15 years 9 months ago
2009
Springer
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
132
click to vote
ICSE
1997
IEEE-ACM
15 years 7 months ago
1997
IEEE-ACM
—Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, ...
142
click to vote
LPNMR
1993
Springer
15 years 7 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...