David Walker, Greg Morrisett  Home/Search
Context Related
| cornell.edu/talc/p...liasrecursion.pdf From: cornell.edu/talc/papers (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 they are severly 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... (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):
57.2%: Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (Correct)
Active bibliography (related documents): More All
0.4: Type-Preserving Garbage Collectors - Wang, Appel (2001) (Correct)
0.2: Adaptive Functional Programming - Acar, Blelloch, Harper (2001) (Correct)
0.2: Automated Provers doing (Higher-Order) Proof search: A Case.. - Mehta, Ranise (2004) (Correct)
Similar documents based on text: More All
0.3: 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/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/walker00alias.html" }
Citations (may not include all citations):306 A syntactic approach to type soundness - Wright, Felleisen - 1994
207 Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
201 to Typed Assembly Language (context) - Morrisett, Walker et al. - 1998
200 Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1998
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
137 The design and implementation of a certifying compiler - Necula, Lee - 1998
132 Syntactic control of interference (context) - Reynolds - 1978
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
117 Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
101 Simple type-theoretic foundations for object-oriented progra.. - Pierce, Turner - 1994
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
88 Implementation of the typed call-by-value #-calculus using a.. (context) - Tofte, Talpin - 1994
83 From region inference to von Neumann machines via region rep.. - Birkedal, Tofte et al. - 1996
82 Alias types for recursive data structures - Walker, Morrisett - 2000
81 Once upon a type - Turner, Wadler et al. - 1995
61 Conventional and uniqueness typing in graph rewrite systems - Barendsen, Smetsers - 1993
58 Better static memory management: Improving region-based anal.. - Aiken, Fahndrich et al. - 1995
53 Quasi-linear types - Kobayashi - 1999
52 A simplified account of polymorphic references - Harper - 1994
52 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
51 and Greg Morrisett (context) - Smith, Walker - 2000
46 Graph types - Klarlund, Schwartzbach - 1993
40 A decidable logic for describing linked data structures - Benedikt, Reps et al. - 1999
36 Interprocedural may-alias analysis for pointers: Beyond k-li.. (context) - Deutsch - 1994
31 Strongly typed flow-directed representation transformations - Dimock, Muller et al. - 1997
21 Listlessness is Better than Laziness (context) - Wadler - 1985
15 Restructuring Symbolic Programs for Concurrent Execution on .. (context) - Larus - 1989
9 Recycling continuations - Sobel, Friedman - 1998
7 A functional representation of data structures with a hole - Minamide - 1998
6 Destination-passing style and generational garbage collectio.. (context) - Cheng, Okasaki - 1996
4 cient machineindependent procedure for garbage collection in.. (context) - Schorr, Waite - 1967
3 Science of Computer Programming (context) - Moller, algebra - 1993
3 Scalable certification of native code: Experience from compi.. - Grossman, Morrisett - 2000
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.cs.cornell.edu/talc/papers.html): More
Alias Types for Recursive Data Structures - Extended Version David (Correct)
Compiling for Runtime Code Generation - Smith, Grossman, Morrisett.. (2000) (Correct)
A Type System for Expressive Security Policies - Walker (1999) (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