Alias types for recursive data structures

DOI10.1007/3-540-45332-6_7MaRDI QIDQ4532095zbMATH OpenFDO

Authors David Walker, Greg Morrisett

Publication date 28 May 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2071/20710177

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05)

Recommendations

• Alias types
• Nonuniform alias analysis of recursive data structures and arrays
• A type system for bounded space and functional in-place update
• Recursive subtyping revealed
• A type system for bounded space and functional in-place update. (Extended abstract)

Cited in

(9)

• Efficient pebbling for list traversal synopses with application to program rollback
• Alias types
• A type theory for memory allocation and data layout
• Alias types and effects for ``environments-aware computations
• Automated verification of shape, size and bag properties via user-defined predicates in separation logic
• Nonuniform alias analysis of recursive data structures and arrays
• Typing copyless message passing
• Resource sharing via capability-based multiparty session types
• Q\# as a quantum algorithmic language

This page was built for publication: Alias types for recursive data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532095)