884 search results - page 82 / 177 » A Proof Theory for DL-Lite |
170
click to vote
JELIA
1990
Springer
15 years 10 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
278
click to vote
ICFP
2009
ACM
16 years 6 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
258
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
282
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
145
click to vote
COCO
2009
Springer
16 years 23 days ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...