David Walker, Greg Morrisett  Home/Search
Context Related
Links: ACM DBLP | cmu.edu/project/fo...astypes010221.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/project/fox...15819A3desc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Linear type systems permit programmers to deallocate or explicitly recycle memory, but are severely restricted by the fact that they admit no aliasing. This paper describes a pseudo-linear type system that allows a degree of aliasing and memory reuse as well as the ability to define complex recursive data structures. Our type system can encode conventional linear data structures such as linear lists and trees as well as more sophisticated data structures including cyclic and doubly-linked lists ... (Update)
Cited by: More
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (Correct)
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000) (Correct)
Permission-Based Ownership: Encapsulating State - In Higher-Order Typed (Correct)
Similar documents (at the sentence level):
51.5%: Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (Correct)
Active bibliography (related documents): More All
0.2: Type-Preserving Garbage Collectors - Wang, Appel (2001) (Correct)
0.2: Safe Programming at the C Level of Abstraction - Grossman (2003) (Correct)
0.2: A Functional Representation of Data Structures with a Hole - Yasuhiko Minamide Research (1998) (Correct)
Similar documents based on text: More All
0.7: Alias Types - Smith, Walker, Morrisett (Correct)
0.2: Typed Memory Management in a Calculus of Capabilities - Crary, Walker, Morrisett (1999) (Correct)
Related documents from co-citation: More All
38: Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
32: Enforcing high-level protocols in low-level software - ahndrich, DeLine - 2001
26: BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2000
BibTeX entry: (Update)
D. Walker and G. Morrissett. Alias types for recursive data structures. Manuscript, April 2000. 49 http://citeseer.ist.psu.edu/article/walker00alias.html More
@article{ walker01alias,
author = "David Walker and Greg Morrisett",
title = "Alias Types for Recursive Data Structures",
journal = "Lecture Notes in Computer Science",
volume = "2071",
pages = "177+",
year = "2001",
url = "citeseer.ist.psu.edu/article/walker00alias.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987 ACM
306 A syntactic approach to type soundness - Wright, Felleisen - 1994 ACM DBLP
233 Computational interpretations of linear logic - Abramsky - 1993 ACM DBLP
215 Theoretical Computer Science (context) - Lafont, abstract - 1988 ACM
207 Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981 ACM DBLP
201 to Typed Assembly Language (context) - Morrisett, Walker et al. - 1999
200 Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1998
197 Dependent Types in Practical Programming - Xi - 1999 ACM DBLP
197 Dependent types in practical programming - Xi, Pfenning ACM DBLP
184 Linear types can change the world - Wadler - 1990
150 Parametric shape analysis via 3-valued logic - Sagiv, Reps et al. - 1999
138 Typed closure conversion - Minamide, Morrisett et al. - 1996 ACM DBLP
137 The design and implementation of a certifying compiler - Necula, Lee - 1998
132 Syntactic control of interference (context) - Reynolds - 1978
117 Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999 ACM DBLP
110 BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2001 ACM DBLP
99 A shape analysis for heap-directed pointers in C (context) - Ghiya, Hendren et al. - 1996
97 Stack-based Typed Assembly Language - Morrisett, Crary et al. - 1998 ACM DBLP
88 Implementation of the typed call-by-value - calculus using .. (context) - Tofte, Talpin - 1994
88 Intuitionistic reasoning about shared mutable data structure - Reynolds - 2000
83 From region inference to von Neumann machines via region rep.. - Birkedal, Tofte et al. - 1996 ACM DBLP
81 Once upon a type - Turner, Wadler et al. - 1995
61 Conventional and uniqueness typing in graph rewrite systems - Barendsen, Smetsers - 1993 ACM DBLP
58 Better static memory management: Improving region-based anal.. - Aiken, ahndrich et al. - 1995 DBLP
53 Quasi-linear types - Kobayashi - 1999
52 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
51 and Greg Morrisett (context) - Smith, Walker - 2000
41 Some techniques for proving correctness of programs which al.. (context) - Burstall - 1972
40 A decidable logic for describing linked data structures - Benedikt, Reps et al. - 1999 ACM DBLP
36 Interprocedural may-alias analysis for pointers: Beyond k-li.. (context) - Deutsch - 1994
35 Reference counting as a computational interpretation of line.. - Chirimar, Gunter et al. - 1996
32 Single-threaded polymorphic lambda calculus (context) - Guzm, Paul - 1990
21 Listlessness is Better than Laziness (context) - Wadler - 1985
15 An assertion language for data structures (context) - Cook, Oppen - 1975 ACM DBLP
15 Restructuring Symbolic Programs for Concurrent Execution on .. (context) - Larus - 1989 ACM
14 A simpli ed account of polymorphic references (context) - Harper - 1994
14 Detecting con icts between structure accesses (context) - Larus, nger - 1988
9 Recycling continuations - Sobel, Friedman - 1998
8 An ecient machine-independent procedure for garbage collecti.. (context) - Schorr, Waite - 1967
7 A functional representation of data structures with a hole - Minamide - 1998 ACM DBLP
6 Destination-passing style and generational garbage collectio.. (context) - Cheng, Okasaki - 1996
6 Typed Memory Management (context) - Walker - 2001 ACM
4 Scalable certi cation for typed assembly language (context) - Grossman, Morrisett - 2000
3 Science of Computer Programming (context) - oller, algebra - 1993
http://www.cs.cornell.edu/talc
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/fox-19/member/jcr/www15819A3s2001/15819A3desc.html): More
BI as an Assertion Language for Mutable Data Structures - Ishtiaq, O'Hearn (2000) (Correct)
An example of local reasoning in BI pointer logic: the.. - Yang (2001) (Correct)
Intuitionistic Reasoning about Shared Mutable Data Structure - Reynolds (2000) (Correct)
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