171 search results - page 7 / 35 » Classical Logic, Continuation Semantics and Abstract Machine... |
TYPES
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
CADE
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
JAPLL
2007
14 years 9 months ago
2007
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...