86 search results - page 14 / 18 » Classical BI: Its Semantics and Proof Theory |
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
MLCW
2005
Springer
14 years 1 months ago
2005
Springer
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
PLDI
2003
ACM
14 years 25 days ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...