@inproceedings{lampson1977storage,
author = {Lampson, Butler},
title = {Storage allocation in typed languages},
booktitle = {Proc. 5th Ann. III Conf: Implementation and Design of Algorithmic Languages},
year = {1977},
month = {January},
abstract = {Several interfaces between a strongly typed language and a storage allocator or deallocator are defined. Using these interfaces, it is possible to program a wide variety of allocation and automatic deallocation strategies: boundary tag allocator, buddy system, reference counting, trace-and-mark garbage collection and many others. Provided the allocator and deallocator have certain well-defined properties, the type-safeness of the language can be guaranteed.},
url = {http://approjects.co.za/?big=en-us/research/publication/storage-allocation-typed-languages/},
pages = {315-322},
edition = {Proc. 5th Ann. III Conf: Implementation and Design of Algorithmic Languages},
}