Results 1 
8 of
8
A typed foundation for directional logic programming
 In Proc. Workshop on Extensions to Logic Programming
, 1992
"... Abstract. A long standing problem in logic programming is how to impose directionality on programs in a safe fashion. The benefits of directionality include freedom from explicit sequential control, the ability to reason about algorithmic properties of programs (such as termination, complexity and d ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. A long standing problem in logic programming is how to impose directionality on programs in a safe fashion. The benefits of directionality include freedom from explicit sequential control, the ability to reason about algorithmic properties of programs (such as termination, complexity and deadlockfreedom) and controlling concurrency. By using Girard’s linear logic, we are able to devise a type system that combines types and modes into a unified framework, and enables one to express directionality declaratively. The rich power of the type system allows outputs to be embedded in inputs and vice versa. Type checking guarantees that values have unique producers, but multiple consumers are still possible. From a theoretical point of view, this work provides a “logic programming interpretation ” of (the proofs of) linear logic, adding to the concurrency and functional programming interpretations that are already known. It also brings logic programming into the broader world of typed languages and typesaspropositions paradigm, enriching it with static scoping and higherorder features.
Turning Cycles into Spirals
, 1999
"... Introduction The structure of LK proofs presents intriguing combinatorial aspects which turn out to be very difficult to study [6,8]. It is wellknown that as soon as one wants to intervene over the structure of a proof to simplify it, the complexity of the proof might increase enormously [16,12,14 ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Introduction The structure of LK proofs presents intriguing combinatorial aspects which turn out to be very difficult to study [6,8]. It is wellknown that as soon as one wants to intervene over the structure of a proof to simplify it, the complexity of the proof might increase enormously [16,12,14]. There is a link between the presence of cut formulas with nested quantifiers and the nonelementary expansion needed to prove a theorem without the help of such formulas. If one considers the graph defined by tracing the flow of occurrences of formulas (in the sense of [2]) for proofs allowing a nonelementary compression, one Preprint submitted to Elsevier Preprint 7 November 1997 finds that such graphs contain cycles [5] or almost cyclic structures[6]. These cycles codify in a small space (i.e. a proof with a small number of lines) all the information which is present in the proof once cuts on formulas wit
Adding Modalities to MTL and its Extensions
"... Abstract. Monoidal tnorm logic MTL and related fuzzy logics are extended with various modalities distinguished by the axiom �(A ∨ B) → (�A ∨ �B). Such modalities include Linear logiclike exponentials, the globalization (or Delta) operator, and truth stressers like “very true”. Extensions of MTL w ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Monoidal tnorm logic MTL and related fuzzy logics are extended with various modalities distinguished by the axiom �(A ∨ B) → (�A ∨ �B). Such modalities include Linear logiclike exponentials, the globalization (or Delta) operator, and truth stressers like “very true”. Extensions of MTL with modalities are presented here via axiomatizations, hypersequent calculi, and algebraic semantics, and related to standard algebras based on tnorms. Embeddings of logics, decidability, and the finite embedding property are also investigated. 1
Some Pitfalls of LKtoLJ Translations and How to Avoid Them
 Proc CADE14, LNCS 1249
, 1997
"... . In this paper, we investigate translations from a classical cutfree sequent calculus LK into an intuitionistic cutfree sequent calculus LJ. Translations known from the literature rest on permutations of inferences in classical proofs. We show that, for some classes of firstorder formulae, all m ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. In this paper, we investigate translations from a classical cutfree sequent calculus LK into an intuitionistic cutfree sequent calculus LJ. Translations known from the literature rest on permutations of inferences in classical proofs. We show that, for some classes of firstorder formulae, all minimal LJproofs are nonelementary but there exist short LKproofs of the same formula. Similar results are obtained even if some fragments of intuitionistic firstorder logic are considered. The size of the corresponding minimal search spaces for LK and LJ are also nonelementarily related. We show that we can overcome these difficulties by extending LJ with an analytic cut rule. 1 Introduction Characterizing classes of formulae for which classical derivability implies intuitionistic derivability was one topic in the Leningrad group around Maslov in the sixties. Such classes are called (complete) Glivenko classes which were extensively characterized by Orevkov [7]. More recently, people ar...
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic
 Journal of Logic, Language and Information
, 1999
"... . A minimal theorem in a logic L is an Ltheorem which is not a nontrivial substitution instance of another Ltheorem. Komori (1987) raised the question whether every minimal implicational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has be ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. A minimal theorem in a logic L is an Ltheorem which is not a nontrivial substitution instance of another Ltheorem. Komori (1987) raised the question whether every minimal implicational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicational theorem A in intuitionistic logic has a unique finormal proof in NJ whenever A is provable without nonprime contraction. The nonprime contraction rule in NJ is the implication introduction rule whose cancelled assumption differs from a propositional variable and appears more than once in the proof. Our result improves the known partial positive solutions to Komori's problem. Also, we present another simple example of a minimal implicational theorem in intuitionistic logic which does not have a unique fijnormal proof in NJ. Key words: natural deduction, uniqueness of normal proofs, coh...
Defunctionalizing Focusing Proofs (Or, How Twelf Learned To Stop Worrying And Love The Ωrule)
"... Abstract. In previous work, the author gave a higherorder analysis of focusing proofs (in the sense of Andreoli’s search strategy), with a role for infinitary rules very similar in structure to Buchholz’s Ωrule. Among other benefits, this “patternbased ” description of focusing simplifies the cut ..."
Abstract
 Add to MetaCart
Abstract. In previous work, the author gave a higherorder analysis of focusing proofs (in the sense of Andreoli’s search strategy), with a role for infinitary rules very similar in structure to Buchholz’s Ωrule. Among other benefits, this “patternbased ” description of focusing simplifies the cutelimination procedure, allowing cuts to be eliminated in a connectivegeneric way. However, interpreted literally, it is problematic as a representation technique for proofs, because of the difficulty of inspecting and/or exhaustively searching over these infinite objects. In the spirit of infinitary proof theory, this paper explores a view of patternbased focusing proofs as façons de parler, describing how to compile them down to firstorder derivations through defunctionalization, Reynolds ’ program transformation. Our main result is a representation of patternbased focusing in the Twelf logical framework, whose core type theory is too weak to directly encode infinitary rules—although this weakness directly enables socalled “higherorder abstract syntax ” encodings. By applying the systematic defunctionalization transform, not only do we retain the benefits of the higherorder focusing analysis, but we can also take advantage of HOAS within Twelf, ultimately arriving at a proof representation with surprisingly little bureaucracy. 1
Discrete Mathematics Some Notes
"... Abstract: These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system “a la Prawitz”. The rest of the ma ..."
Abstract
 Add to MetaCart
Abstract: These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system “a la Prawitz”. The rest of the material is more or less traditional but I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the basic concepts of graph theory. 4Preface The curriculum of most undergraduate programs in computer science includes a course titled Discrete Mathematics. These days, given that many students who graduate with a degree in computer science end up with jobs where mathematical skills seem basically of no use, 1 one may ask why these students should take such a course. And if they do, what are the most basic notions that they should learn? As to the first question, I strongly believe that all computer science students should take such a course and I will try justifying this assertion below. The main reason is that, based on my experience of more than twenty five years of teaching, I have found that the majority of the students find it very difficult to present an