Results 1  10
of
83
A Linear Logical Framework
, 1996
"... We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science  LICS'96 (E. Clarke editor), pp. 264275, New Brunswick, NJ, July 2730 1996. mal basis for a conservative extension of the LF logical framework. ..."
Abstract

Cited by 238 (49 self)
 Add to MetaCart
We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science  LICS'96 (E. Clarke editor), pp. 264275, New Brunswick, NJ, July 2730 1996. mal basis for a conservative extension of the LF logical framework. LLF combines the expressive power of dependent types with linear logic to permit the natural and concise representation of a whole new class of deductive systems, namely those dealing with state. As an example we encode a version of MiniML with references including its type system, its operational semantics, and a proof of type preservation. Another example is the encoding of a sequent calculus for classical linear logic and its cut elimination theorem. LLF can also be given an operational interpretation as a logic programming language under which the representations above can be used for type inference, evaluation and cutelimination. 1 Introduction A logical framework is a formal system desig...
Operational Modal Logic
, 1995
"... Answers to two old questions are given in this paper. 1. Modal logic S4, which was informally specified by Gödel in 1933 as a logic for provability, meets its exact provability interpretation. 2. BrouwerHeytingKolmogorov realizing operations (193132) for intuitionistic logic Int also get exact in ..."
Abstract

Cited by 79 (28 self)
 Add to MetaCart
(Show Context)
Answers to two old questions are given in this paper. 1. Modal logic S4, which was informally specified by Gödel in 1933 as a logic for provability, meets its exact provability interpretation. 2. BrouwerHeytingKolmogorov realizing operations (193132) for intuitionistic logic Int also get exact interpretation as corresponding propositional operations on proofs; both S4 and Int turn out to be complete with respect to this proof realization. These results are based on operational reading of S4, where a modality is split into three operations. The logic of proofs with these operations is shown to be arithmetically complete with respect to the intended provability semantics and sufficient to realize every operation on proofs admitting propositional specification in arithmetic.
Choice Functions and the Scopal Semantics of Indefinites
 Linguistics and Philosophy
, 1997
"... this paper I treat conditionals using material implication, ignoring the wellknown semantic/pragmatic problems concerning their correct interpretation. Of course, one may doubt whether (7a), which is verified by any situation in which there is one woman who did not come to the party, reflects corre ..."
Abstract

Cited by 79 (13 self)
 Add to MetaCart
this paper I treat conditionals using material implication, ignoring the wellknown semantic/pragmatic problems concerning their correct interpretation. Of course, one may doubt whether (7a), which is verified by any situation in which there is one woman who did not come to the party, reflects correctly the wide scope reading of the indefinite in (7). Obviously, this problem is independent of the scope problem of indefinites. For this reason and because antecedents of conditionals are one of the simplest and most striking cases of scope islands, I use such examples freely, counting on the reader to substitute her favorite theory of conditionals for material implication. This claim has been challenged in Farkas (1981), Rooth & Partee (1982:fn.6) and, more recently, in Ruys (1992) and Abusch (1994). These works all show cases where Fodor & Sag's claim is argued to be incorrect. The empirical debate will be reviewed later in this paper (subsection 3.4.2). Ruys and Abusch both conclude that Fodor & Sag's "referential" approach is inadequate. To handle the facts, Ruys proposes an indexing mechanism of indefinites within a DRTlike interpretation of LF. Abusch proposes to enrich DRT with a storage mechanism that changes the syntactic position of the N' predicate (= the restriction of the indefinite) at the representational level. Both Ruys and Abusch therefore accept the assumption of DRT about a distinct syntactic representational level for meaning. This level (sometimes called Logical Form') is additional to the syntactic level that undergoes semantic interpretation (GB's Logical Form, other theories' Surface Structure). Indefinites in Ruys and Abusch's treatments are not quantifiers. Instead, they involve the familiar treatment of DRT using free variables. I henceforth c...
Calculating Sized Types
 HigherOrder and Symbolic Computation
, 2001
"... Many program optimizations and analyses, such as arraybounds checking, termination analysis, etc, depend on knowing the size of a function's input and output. However, size information can be dicult to compute. Firstly, accurate size computation requires detecting a size relation between diffe ..."
Abstract

Cited by 72 (11 self)
 Add to MetaCart
(Show Context)
Many program optimizations and analyses, such as arraybounds checking, termination analysis, etc, depend on knowing the size of a function's input and output. However, size information can be dicult to compute. Firstly, accurate size computation requires detecting a size relation between different inputs of a function. Secondly, different optimizations and analyses may require slightly different size information, and thus slightly different computation. Literature in size computation has mainly concentrated on size checking, instead of size inference. In this paper, we provide a generic framework on which di erent size variants can be expressed and computed. We also describe an effective algorithm for inferring, instead of checking, size information. Size information are expressed in terms of Presburger formulae, and our algorithm utilizes the Omega Calculator to compute as exact a size information as possible, within the linear arithmetic capability.
Number theory and elementary arithmetic
 Philosophia Mathematica
, 2003
"... Elementary arithmetic (also known as “elementary function arithmetic”) is a fragment of firstorder arithmetic so weak that it cannot prove the totality of an iterated exponential function. Surprisingly, however, the theory turns out to be remarkably robust. I will discuss formal results that show t ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
(Show Context)
Elementary arithmetic (also known as “elementary function arithmetic”) is a fragment of firstorder arithmetic so weak that it cannot prove the totality of an iterated exponential function. Surprisingly, however, the theory turns out to be remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context. 1
Epsilon Substitution Method for Elementary Analysis
, 1993
"... We formulate epsilon substitution method for elementary analysis EA (second order arithmetic with comprehension for arithmetical formulas with predicate parameters). Two proofs of its termination are presented. One uses embedding into ramied system of level one and cutelimination for this system. Th ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
We formulate epsilon substitution method for elementary analysis EA (second order arithmetic with comprehension for arithmetical formulas with predicate parameters). Two proofs of its termination are presented. One uses embedding into ramied system of level one and cutelimination for this system. The second proof uses noneective continuity argument.