Alias Types for Recursive Data Structures Export

@article{citeulike:241454, 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...}, author = {Walker, David and Morrisett, Greg}, citeulike-article-id = {241454}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5638}, journal = {Lecture Notes in Computer Science}, keywords = {alias, theory, type}, pages = {177--??}, posted-at = {2005-07-01 19:41:32}, priority = {4}, title = {Alias Types for Recursive Data Structures}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5638}, volume = {2071}, year = {2001} }

TY - JOUR ID - citeulike:241454 L3 - citeulike-article-id:241454 N2 - 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... JF - Lecture Notes in Computer Science EP - ?? TI - Alias Types for Recursive Data Structures VL - 2071 SP - 177 KW - alias KW - theory KW - type AU - Walker, David AU - Morrisett, Greg PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5638 ER -