111 search results - page 21 / 23 » A Proof of Strong Normalisation using Domain Theory |
MLQ
2007
13 years 7 months ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
JELIA
2010
Springer
13 years 5 months ago
2010
Springer
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
PATAT
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...