Turner, D. N. and P. Wadler (1999, October). Operational interpretations of linear logic. Theoretical Computer Science 227(1--2), 231--248.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....#, y : #) e) bv # lv# pc # , e bv ##pc x lv y # Fig. 3. Expression Evaluation spected. Together, these restrictions rule out illegal information flows and impose enough structure on the language for us to prove a non interference property. As in other mixed linear non linear type systems [31], two separate type contexts are used. # is a finite partial map from non linear variables to security types, whereas K is an ordered list (with concatenation denoted by , mapping linear variables to their types. The order in which continuations appear in K defines the order in which they are ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 2000. To Appear.

....diverse concurrency constructs such as channels, ports, or semaphores. They can be implemented safely, so that well typed (fut) programs that use these constructs can never raise any handle errors. We prove this form of safety for several concurrency constructs on basis of a linear type system [20, 19, 9]. The calculus (fut) thus yields a solid basis for type safe concurrent programming languages with futures. A prototypical example for ML like programming languages of this class is Alice [1] Since various concurrency abstractions can be expressed and proved safe by the linear type system ....

D. N. Turner and P. Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227:231-248, 1999. Special issue on linear logic.

....ordering constraints on continuations and guarantees that security labels on values are respected. Together, these restrictions rule out illegal information ows and impose enough structure on the language for us to prove a noninterference property. As in other mixed linear nonlinear type systems [41], the type context is split into an ordinary, nonlinear section and a linear section. is a nite partial map from nonlinear variables to security types; it admits the usual weakening and exchange rules (which we omit) The linear part of the context consists of a single linear variable and its ....

Turner, D. N. and P. Wadler: 1999, `Operational Interpretations of Linear Logic'. Theoretical Computer Science 227(1-2), 231-248.

.... optimizations such as the destination passing style optimization [8] 7 Related work Ordered logic and ordered type theory have been explored extensively by Pfenning and Polakow [16, 15] There is a significant amount of previous work applying ordinary linear type theory to memory management [1, 22, 5, 7], but none of it addresses (nor is intended to address) the question of separating out allocation and initialization, and of giving a foundational account of data layout. The work that most closely addresses the issues that we discuss here is the alias type formalism of Smith, Walker, and ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1-- 2):231--248, 1999.

....of CPS terms [19] given in terms of a linear logical framework. However, to the best of our knowledge, no previous work has been done using ordered type theory for the purposes discussed here. There is a significant amount of previous work applying ordinary linear type theory to memory management [23, 6, 8]. Most of this work on linear logic and memory management focuses on allowing explicit de allocation and in place re use of memory, or making garbage collection more e#ective by propagating 22 information about how often values can be used. Chirimar, et al. use linear type theory to prove the ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1--2):231--248, 1999.

....of CPS terms [19] given in terms of a linear logical framework. However, to the best of our knowledge, no previous work has been done using ordered type theory for the purposes discussed here. There is a signi cant amount of previous work applying ordinary linear type theory to memory management [23, 6, 8]. Most of this work on linear logic and memory management focuses on allowing explicit de allocation and in place re use of memory, or making garbage collection more e ective by propagating information about how often values can be used. Chirimar, et al. use linear type theory to prove the ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1-2):231-248, 1999.

....Chirimar, Gunter and Riecke [8] gave a reference counting interpretation of linear logic, in which explicit copies and frees corresponded to reference counting operations. Maraist et al. 14] compared interpretations of call by name, need, and value calculi into linear logic, and Turner and Wadler[26] studied the memorymanagement properties of the call by value and call by need interpretations. Hofmann s LFPL [11] is a linear rst order functional language with list and tree data structures where space usage is tracked; LFPL programs can be compiled to C programs that do not allocate any new ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1-2):231-248, 1999.

.... such as the destination passing style optimization [10] 7 Related work Ordered logic and ordered type theory have been explored extensively by Pfenning and Polakow [18, 17, 16] There is a signi cant amount of previous work applying ordinary linear type theory to memory management [2, 1, 23, 6, 8], but none of it addresses (nor is intended to address) the question of separating out allocation and initialization, and of giving a foundational account of data layout. The work that most closely addresses the issues that we discuss here is the alias type formalism of Smith, Walker, and ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1-2):231-248, 1999.

....constraints on continuations and guarantees that security labels on values are respected. Together, these restrictions rule out illegal information flows and impose enough structure on the language for us to prove a noninterference property. As in other mixed linear nonlinear type systems [35], the type context is split into an ordinary, nonlinear section and a linear section. # is a finite partial map from nonlinear variables to security types; it admits the usual weakening and exchange rules (which we omit) The linear part of the context consists of a single linear variable and its ....

Turner, D. N. and P. Wadler: 1999, `Operational Interpretations of Linear Logic'. Theoretical Computer Science 227(1-2), 231--248.

....#) e) bv # lv# # # #M, pc # , e bv ##pc x lv y # Fig. 3. Expression Evaluation spected. Together, these restrictions rule out illegal information flows and impose enough structure on the language for us to prove a non interference property. As in other mixed linear non linear type systems [31], two separate type contexts are used. # is a finite partial map from non linear variables to security types, whereas K is an ordered list (with concatenation denoted by , mapping linear variables to their types. The order in which continuations appear in K defines the order in which they are ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 2000. To Appear.

....intuitionistic calculus, a single operator ( is used to make it possible to duplicate arguments to a function or components of a pair. Unfortunately, it appears that this type system cannot be given an operational semantics with satisfying memory management properties. Turner and Wadler [35] demonstrate that when working within this type system, one must make a choice: in order to do useful work on an intuitionistic object, one must either make a complete copy of the object in which case the language admits no e ective way to share objects, or, if one does not make copy of an ....

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227:231-248, 1999. Special issue on linear logic.

....about time consumption of recursive programs involving lists and trees. Their language is a standard one and no optimisation due to heap space reuse is taken into account. The relationship between linear types and garbage collection has been recognised as early as 87 by Lafont [15] see also [11, 1, 25, 17] and [4] for a similar approach not based on the syntax of linear logic. But again, due to the absence of # types, these systems do not provide in place update but merely deallocate a linear argument immediately after its use. This e#ect, however, is already achieved by traditional reference ....

D. Turner and P. Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1--2):231--248, 1999. 32

....Language for Strict and Lazy. From a programming language perspective Lily has the potential to be a common intermediate language for both strict and lazy functional programming. To realise that potential one would need to work at a more intensional level than we do in most of this paper (cf. [27]) However we do indicate how to replace the call by name semantics of terms involving exponential types in Lily (which subsumes xpoint recursion) with a call by need semantics without a ecting ground contextual equivalence (see Sect. 4) Details will appear elsewhere, along with an exploration ....

....for closed Lily terms, differing in their treatment of the application of a linear function to an argument. The strict (or call by value) relation s corresponds to the natural operational interpretation of intuitionistic linear logic advocated by Abramsky [2, p 16] and used by others (such as [27,4]) whereas the other relation, n , used for a linear lambda calculus by Crole in [5] gives all constructs a non strict (or call by name) semantics. The two relations give rise to two termination relations strict termination relation: M s , 9 V: M s V non strict termination relation: M n ....

D. N. Turner and P. Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227:231-248, 1999.

....counts. Such a count indicates the number of variable occurrences in the program for which the given expression will be substituted. In particular, they give examples that terms of linear type may have more than one pointer to them, i.e. a reference count of more than one. Turner and Wadler [14] describe an operational interpretation of linear logic based on DILL [1] a term calculus with a separation of intuitionistic and linear variables. For a restriction of DILL which corresponds to the callby value translation of the simply typed calculus into DILL they obtain only one pointer to ....

D.N. Turner and P. Wadler (1998). Operational Interpretations of Linear Logic. Theoretical Computer Science, to appear.

....about time consumption of recursive programs involving lists and trees. Their language is a standard one and no optimisation due to heap space reuse is taken into account. The relationship between linear types and garbage collection has been recognised as early as 87 by Lafont [14] see also [10, 1, 21, 16]. But again, due to the absence of # types, these systems do not provide in place update but merely deallocate a linear argument immediately after its use. This e#ect, however, is already achieved by traditional reference counting which may be the reason why linear functional programming hasn t ....

D. Turner and P. Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 1999. to appear.

.... (A) While this system allows one to estimate the required heap and stack size it does not perform in place update either (and cannot due to the absence of linear types) The relationship between linear types and garbage collection has been recognised as early as 87 by Lafont [13] see also [9, 1, 20, 15]. But again, due to the absence of 3 types, these systems do not provide in place update but merely deallocate a linear argument immediately after its use. This effect, however, is already achieved by traditional reference counting which may be the reason why linear functional programming hasn t ....

D. Turner and P. Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 1999. to appear.

....that terms of linear type may have more than one pointer to them. They show this by attaching reference counters to expressions, and observing that even expressions of linear type may have a reference counter which is greater than one, i.e. these expressions might be copied. Turner and Wadler [14] describe an operational interpretation of linear logic based on DILL [2] a term calculus with a separation of intuitionistic and linear variables. For a restriction of DILL which corresponds to the call by value translation of the simply typed calculus they obtain only one pointer to a value ....

D.N. Turner and P. Wadler (1998). Operational Interpretations of Linear Logic. Theoretical Computer Science, to appear.

No context found.

Turner, D. N. and P. Wadler (1999, October). Operational interpretations of linear logic. Theoretical Computer Science 227(1--2), 231--248.

No context found.

D. N. Turner, P. Wadler. Operational interpretations of linear logic. Theoret. Comput. Sci., 227(1--2), 1999.

No context found.

D. N. Turner, P. Wadler. Operational interpretations of linear logic. Theoret. Comput. Sci., 227(1--2), 1999.

No context found.

D. N. Turner, P. Wadler. Operational interpretations of linear logic. Theoret. Comput. Sci., 227(1--2), 1999.

No context found.

Turner, D. N. and P. Wadler, Operational interpretations of linear logic, Theoretical Computer Science 227 (1999), pp. 231--248.

No context found.

D. N. Turner, P. Wadler. Operational interpretations of linear logic. Theoret. Comput. Sci., 227(1--2), 1999.

No context found.

D. N. Turner, P. Wadler. Operational interpretations of linear logic. Theoret. Comput. Sci., 227(1--2), 1999.

No context found.

David N. Turner and Philip Wadler. Operational interpretations of linear logic. Theoretical Computer Science, 227(1-- 2):231--248, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC