Results 1  10
of
27
A syntax for linear logic
 Presented at Conference on Mathematical Foundations of Programming Language Semantics
, 1993
"... Abstract. This tutorial paper provides an introduction to intuitionistic logic and linear logic, and shows how they correspond to type systems for functional languages via the notion of ‘Propositions as Types’. The presentation of linear logic is simplified by basing it on the Logic of Unity. An app ..."
Abstract

Cited by 88 (7 self)
 Add to MetaCart
(Show Context)
Abstract. This tutorial paper provides an introduction to intuitionistic logic and linear logic, and shows how they correspond to type systems for functional languages via the notion of ‘Propositions as Types’. The presentation of linear logic is simplified by basing it on the Logic of Unity. An application to the array update problem is briefly discussed. 1
A Brief Guide to Linear Logic
, 1993
"... An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation. ..."
Abstract

Cited by 56 (10 self)
 Add to MetaCart
An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation.
Linear Logic and Noncommutativity in the Calculus of Structures
, 2003
"... macro \clap,whichisused on almost every page, came out of such a discussion. This thesis would not exist without the support of my wife Jana. During all the time she has been a continuous source of love and inspiration. This PhD thesis has been written with the financial support of the DFGGraduiert ..."
Abstract

Cited by 44 (13 self)
 Add to MetaCart
macro \clap,whichisused on almost every page, came out of such a discussion. This thesis would not exist without the support of my wife Jana. During all the time she has been a continuous source of love and inspiration. This PhD thesis has been written with the financial support of the DFGGraduiertenkolleg 334 "Spezifikation diskreter Prozesse und Prozesysteme durch operationelle Modelle und Logiken". iii iv Tab l e o f Contents Acknowledgements iii Tab l e of Contents v List of Figures vii 1Introduction 1 1.1Proof Theory andDeclarativeProgramming .................. 1 1.2LinearLogic .................................... 5 1.3Noncommutativity ................................ 8 1.4The Calculus of Structures . .......................... 9 1.5 Summary of Results............................... 12 1.6OverviewofContents.............................. 15 2LinearLogic and the Sequent Calculus 17 2.1Formulaeand Sequents . ............................. 17 2.2Rules andDerivations . .............
Reference Counting as a Computational Interpretation of Linear Logic
 Journal of Functional Programming
, 1996
"... We develop formal methods for reasoning about memory usage at a level of abstraction suitable for establishing or refuting claims about the potential applications of linear logic for static analysis. In particular, we demonstrate a precise relationship between type correctness for a language based o ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
(Show Context)
We develop formal methods for reasoning about memory usage at a level of abstraction suitable for establishing or refuting claims about the potential applications of linear logic for static analysis. In particular, we demonstrate a precise relationship between type correctness for a language based on linear logic and the correctness of a referencecounting interpretation of the primitives that the language draws from the rules for the `of course' operation. Our semantics is `lowlevel' enough to express sharing and copying while still being `highlevel ' enough to abstract away from details of memory layout. This enables the formulation and proof of a result describing the possible runtime reference counts of values of linear type. Contents 1 Introduction 1 2 Operational Semantics with Memory 4 3 A Programming Language Based on Linear Logic 9 4 Semantics 14 5 Properties of the Semantics 24 6 Linear Logic and Memory 27 7 Discussion 32 A Proofs of the Main Theorems 36 Acknowledgements...
Linear lambdaCalculus and Categorical Models Revisited
, 1992
"... this paper we shall consider multiplicative exponential linear logic (MELL), i.e. the fragment which has multiplicative conjunction or tensor,\Omega , linear implication, \Gammaffi, and the logical operator "exponential", !. We recall the rules for MELL in a sequent calculus system in Fig ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
this paper we shall consider multiplicative exponential linear logic (MELL), i.e. the fragment which has multiplicative conjunction or tensor,\Omega , linear implication, \Gammaffi, and the logical operator "exponential", !. We recall the rules for MELL in a sequent calculus system in Fig. 1. We use capital Greek letters \Gamma; \Delta for sequences of formulae and A; B for single formulae. The Exchange rule simply allows the permutation of assumptions. The `! rules' have been given names by other authors. ! L\Gamma1 is called Weakening , ! L\Gamma2 Contraction, ! L\Gamma3 Dereliction and (! R ) Promotion
An Axiomatic Approach to Adequacy
 University of Aarhus
, 1996
"... is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Dissertation Series. Copies may be obtained by contacting: BRICS ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Dissertation Series. Copies may be obtained by contacting: BRICS
Linear Logic
, 1992
"... this paper we will restrict attention to propositional linear logic. The sequent calculus notation, due to Gentzen [10], uses roman letters for propositions, and greek letters for sequences of formulas. A sequent is composed of two sequences of formulas separated by a `, or turnstile symbol. One may ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
(Show Context)
this paper we will restrict attention to propositional linear logic. The sequent calculus notation, due to Gentzen [10], uses roman letters for propositions, and greek letters for sequences of formulas. A sequent is composed of two sequences of formulas separated by a `, or turnstile symbol. One may read the sequent \Delta ` \Gamma as asserting that the multiplicative conjunction of the formulas in \Delta together imply the multiplicative disjunction of the formulas in \Gamma. A sequent calculus proof rule consists of a set of hypothesis sequents, displayed above a horizontal line, and a single conclusion sequent, displayed below the line, as below: Hypothesis1 Hypothesis2 Conclusion 4 Connections to Other Logics
The LambdaCalculus with Multiplicities
, 1993
"... We introduce a refinement of the λcalculus, where the argument of a function is a bag of resources, that is a multiset of terms, whose multiplicities indicate how many copies of them are available. We show that this "λcalculus with multiplicities" has a natural functionality theory, simi ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
We introduce a refinement of the λcalculus, where the argument of a function is a bag of resources, that is a multiset of terms, whose multiplicities indicate how many copies of them are available. We show that this "λcalculus with multiplicities" has a natural functionality theory, similar to Coppo and Dezani's intersection type discipline. In our functionality theory the conjunction is managed in a "multiplicative" manner, according to Girard's terminology. We show that this provides an adequate interpretation of the calculus, by establishing that a term is convergent if and only if it has a nontrivial functional character.
The Girard Translation Extended with Recursion
 In Proceedings of Computer Science Logic
, 1995
"... This paper extends CurryHoward interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the rec calculus and the linear rec calculus respectively, are given sound categorical interpretations. The embedding of ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This paper extends CurryHoward interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the rec calculus and the linear rec calculus respectively, are given sound categorical interpretations. The embedding of proofs of IL into proofs of ILL given by the Girard Translation is extended with the rules for recursion, such that an embedding of terms of the rec calculus into terms of the linear rec calculus is induced via the extended CurryHoward isomorphisms. This embedding is shown to be sound with respect to the categorical interpretations. Full version of paper to appear in Proceedings of CSL '94, LNCS 933, 1995. y Basic Research in Computer Science, Centre of the Danish National Research Foundation. Contents 1 Introduction 4 2 The Categorical Picture 6 2.1 Previous Work and Related Results : : : : : : : : : : : : : : : : : : : : : : 6 2.2 How to deal with parameters : : : : : : : ...
Lightweight linear types in system F o
 In TLDI
, 2010
"... We present System F ◦ , an extension of System F that uses kinds to distinguish between linear and unrestricted types, simplifying the use of linearity for generalpurpose programming. We demonstrate through examples how System F ◦ can elegantly express many useful protocols, and we prove that any p ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
We present System F ◦ , an extension of System F that uses kinds to distinguish between linear and unrestricted types, simplifying the use of linearity for generalpurpose programming. We demonstrate through examples how System F ◦ can elegantly express many useful protocols, and we prove that any protocol representable as a DFA can be encoded as an F ◦ type. We supply mechanized proofs of System F ◦ ’s soundness and parametricity properties, along with a nonstandard operational semantics that formalizes common intuitions about linearity and aids in reasoning about protocols. We compare System F ◦ to other linear systems, noting that the simplicity of our kindbased approach leads to a more explicit account of what linearity is meant to capture, allowing otherwiseconflicting interpretations of linearity (in particular, restrictions on aliasing versus restrictions on resource usage) to coexist peacefully. We also discuss extensions to System F ◦ aimed at making the core language more practical, including the additive fragment of linear logic, algebraic datatypes, and recursion.