Citations: Is there a use for linear logic

73 citations found. Retrieving documents...

Philip Wadler. Is there a use for linear logic? In Partial Evaluation and Semantics-Based Program Manipulation (PEPM).ACM Press, 1991.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents Next 50

Pipelining with Futures - Blelloch, Reid-Miller (1997) (Correct)

....there can only be exclusive read access to any value, even if it is not a future cell. Linear code has been studied extensively in the programming language community in the context of various memory optimizations, such as updating functional data in place or simplifying memory management [26] [31], 4] 1] 18] Linearizing code does not affect the performance of any of the algorithms we considered in this paper. For example, consider the body of the split code in Figure 3, lines 4 11. Figure 12 shows the linearized version of the same code. The only variables that are read more than ....

P. Wadler. Is there a use for linear logic? In Proceedings of the Symposium on Partial Evaluations and Semantics-Based Program Manipulation, pages 255--273, June

Type Reconstruction for Syntactic Control of Interference, Part 2 - Yang, Huang (Correct)

....Proofs are omitted from this paper due to space limitations. The full paper will be available as [23] 1. 1 Related Work Constraint based type inference systems have been designed for many languages, including ones that support subtyping [6, 11] objects [5] overloading [8, 22] and linear types [21]. The inference issues in [21] are especially close to ours, and we received considerable inspiration from this work. One novel aspect of our system which does not arise in these other works is the need to associate constraints with each free identifier of a term, instead of requiring just a ....

....due to space limitations. The full paper will be available as [23] 1. 1 Related Work Constraint based type inference systems have been designed for many languages, including ones that support subtyping [6, 11] objects [5] overloading [8, 22] and linear types [21] The inference issues in [21] are especially close to ours, and we received considerable inspiration from this work. One novel aspect of our system which does not arise in these other works is the need to associate constraints with each free identifier of a term, instead of requiring just a single constraint per typing ....

P. Wadler. Is there a use for linear logic? In Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation, pages 255--273. ACM,

Case for Support: Novel type systems for concurrent programming.. - Gay (Correct)

....be used to justify program optimisations (one of the motivations for the linear type system of Kobayashi et al. but does not need to be explicitly provided by the programmer. Other linear functional languages have also used type inference to avoid annotating the syntax with linearity information [21, 32]. In the context of session types, it may be that a suitable type inference algorithm could determine which channels correspond to sessions and which to one o communications. We are conscious of the need to produce a syntax which is as simple and exible as possible, in order that the extended ....

P. Wadler. Is there a use for linear logic. Technical report, University of Glasgow, 1990.

Type Theory and Projections for Static Analysis - Baker-Finch (1995) (Correct)

....heavily on optimisations made on the basis of compile time analysis of programs. The main approaches fall into three broad classes: those based on abstract interpretation (e.g. 21] 1] those based on projections (e.g. 24] 20] 9] 8] and those based on type systems (e.g. 19] 27] [23], 18] The interrelations of these methods has attracted some study, with Burn [7] comparing abstract interpretation with projection analysis, and Jensen [17] and Benton [5] investigating links between abstract interpretation and the typing approach of Kuo and Mishra. The main contribution of ....

P. Wadler. Is there a use for linear logic? In Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM). ACM/IFIP, 1991.

Inference Systems for Binding Time Analysis (Extended.. - Solberg, Nielson, Nielson (1992) (Correct)

....extra recursive calls have to be performed. The starting point for our work is the inference system for binding times of the simply typed calculus as specified in Nielson and Nielson (1992) However, we shall reformulate it in a style motivated by the inference system for linear types given in Wadler (1991) using the so called use types. In this extended abstract we only review the main points of our approach. 2 The inference system In a 2 level calculus the constructs will be marked explicitly with their binding times. For us a type U 2 T of the 2 level calculus is either a base type (denoted ....

.... rule [exchange] Further we shall assume that if x is not in the list from the recursive call, then U and b are fresh variables; this corresponds to the applications of rule [weakening] For the full details of unify see Solberg (1992) 5 Conclusion The work of this paper follows the approach of Wadler (1991) where an inference system for linear types using use types is presented. Then the rules [dereliction] and [promotion] are eliminated and an algorithm for finding constraints is constructed from the resulting system. One of the salient features of the algorithm presented here is the use of ....

Wadler. P. 1991. Is there a use for linear logic? . Proceedings from Partial Evaluation and Semantics-Based Program Manipulation 1991, pages 255 -- 273.

Backtrackable State with Linear Assumptions, Continuations and.. - Tarau, Dahl (Correct)

....the general case, expressing change contradicts some of the basic principles functional and logic languages are built on. 2.1 Re usability of single threaded data types Objects having a unique producer and a unique consumer are frequent in declarative programming languages. Work on linear types [Wad91], monads [Wad93] and linear language constructs [Bak92] in functional programming has shown that singlethreaded objects are subject to in place update within a reasonably clean semantic framework. In Prolog, the hidden arguments of DCG grammars correspond to a chain of variables, having exactly ....

P. Wadler. Is there a use for linear logic? ACM/IFIP PEPM Symposium, June 1991.

Elimination of Negation in a Logical Framework - Momigliano (2000) (3 citations) (Correct)

....these intensional information about functions (see [Jen91] for a comparison of these two techniques) However, earlier work as [TMM89] used non standard primitive type to distinguish strict or non strict terms, closed only under intuitionistic implication. Not forgetting Wadler s early paper [Wad90] on using linear logic for sharing analysis, Wright [Wri91, Wri92] seems the first one to have extended the Curry Howard isomorphism to (the implicational fragment of) relevance logic and explicitly connected the two areas, although both [Bel74] and [Hel77] had previously recognized the link ....

P. Wadler. Is there a use for linear logic. Technical report, University of Glasgow, 1990.

A Dialectica Model of State - Correa, Haeusler, de Paiva (1996) (1 citation) (Correct)

....da Prova, Modelos Categ oricos e Concorrencia. 1 Also: Dept. de An alise Univ. Federal Fluminense 1 Introduction The concept of state manipulation plays an important role in computation. There are many attempts to formalise this concept, especially in the framework of Girard s Linear Logic ([8, 10, 11, 15, 16, 13]) Some aspects of state manipulation, like sequencing and regenerative values, are captured in an interesting way by Reddy s work[13] Reddy presents an extended intuitionistic linear calculus for modelling state manipulation. His calculus LLMS (for Linear Logic Model of State) adds two extra ....

P. Wadler. Is there a use for linear logic? In Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation, ACM, pages 255--273, 1991. (SIGPLAN Notices, Sep. 1991). 29

Fully Persistent Arrays for Efficient Incremental Updates and.. - Chuang (Correct)

....are usually expressed in terms of type rules. Therefore, for well typed programs, no compile time analysis for detecting destructible updates is ever needed and all array updates can be done destructively and efficiently. This approach has been explored by Guzm an Hudak [14] and Wadler [25,26]. The remaining task is to check, at compile time, whether or not a program is well typed with respect to the single threading type scheme. The type checking algorithms are usually complicated. A common drawback of the compile time analysis approach and the language restriction approach is ....

Philip Wadler. Is there a use for linear logic? pages 255--273. In [5].

On Bunched Typing - O'Hearn (2000) (Correct)

....between linear and bunched typing, but we wonder whether it is possible to have the best of both. Ideally, we would like a way to combine linear and bunched typing in a way that simultaneously accounts for sharing and consumption. Examples of the consumptive aspect of linear typing include [22, 51, 30]. A hint of the way to proceed was given at the end of Section 6.4: we might start from a pair of categories, one to model and the other to model and . Then, we would expect to decompose into , but not into . By observing such a separation, it might be possible to develop a calculus that ....

P. Wadler. Is there a use for linear logic? In ACM/IFIP Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991. Proceedings of the 1991 Conference.

A Taste of Linear Logic - Wadler (1993) (36 citations) Self-citation (Wadler) (Correct)

No context found.

P. Wadler, Is there a use for linear logic? In Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), ACM Press, New Haven, Connecticut, June 1991.

Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995) (1 citation) Self-citation (Wadler) (Correct)

No context found.

P. Wadler, Is there a use for linear logic? In Partial Evaluation and SemanticsBased Program Manipulation (PEPM), New Haven, Connecticut, ACM Press, June 1991. 22 Maraist et. al.

Once Upon a Type - Turner, Wadler, Mossin (1997) (71 citations) Self-citation (Wadler) (Correct)

....condition on list types: The type [ is well formed only if Theta j j. In other words, if a list can be accessed many times, then its elements also might be accessed many times (through the list) A similar restriction appears in the type systems of Guzm an and Hudak [GH90] and Wadler [Wad90b, Wad91]. 8 3.3 Contexts A context associates a type with each variable that may appear in a term, and is represented by a list of entries of the form x : Contexts Gamma; Delta : x 1 : 1 ; x n : n Each variable in a context must be distinct. If x : is in Gamma, we say that x has ....

....why the authors of these systems were willing to settle for a call by name analysis. 8. 4 Data structure update A number of analyses for in place update of data structures have been proposed, including those by Schmidt [Sch85] Hudak [Hud86] Baker [Bak90] Guzm an and Hudak [GH90] 33 Wadler [Wad90b, Wad91], and Barendsen and Smetsers [BS93] In such analyses it is sufficient to check that there can be at most one live pointer to a data structure. For example, in the following expression the then and else clauses can only be executed after the predicate p(x) has evaluated to a boolean. But a ....

P. Wadler, Is there a use for linear logic? In Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), ACM Press, New Haven, Connecticut, June 1991. 37

Linear Logic and Noncommutativity in the Calculus of Structures - Stra�burger (2003) (Correct)

No context found.

Philip Wadler. Is there a use for linear logic? In Partial Evaluation and Semantics-Based Program Manipulation (PEPM).ACM Press, 1991.

Unknown - Expansion Variables For (Correct)