LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using t...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper presents an algorithm for a non-standard logicminimization problem that arises in £ -valued propositional logic. The problem is motivated by the potential for obtainin...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affi...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. ...