91 search results - page 14 / 19 » Reducts of Propositional Theories, Satisfiability Relations,... |
PPDP
2009
Springer
14 years 1 days ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
POPL
2006
ACM
14 years 7 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...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
HASKELL
2008
ACM
13 years 8 months ago
2008
ACM
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
PEPM
2009
ACM
14 years 4 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...