On bunched polyrnorphism
Collinson, M., Pym, D. and Robinson, E., 2005. On bunched polyrnorphism. In: Computer Science Logic, Proceedings. Vol. 3634. , pp. 36-50. (Lecture Notes in Computer Science)
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
We describe a polymorphic extension of the substructural lambda calculus alpha lambda associated with the logic of bunched implications. This extension is particularly novel in that both variables and type variables are treated substructurally, being maintained through a system of zoned, bunched contexts. Polymorphic universal quantifiers are introduced in both additive and multiplicative forms, and then metatheoretic properties, including subject-reduction and normalization, are established. A sound interpretation in a class of indexed category models is defined and the construction of a generic model is outlined, yielding completeness. A concrete realization of the categorical models is given using pairs of partial equivalence relations on the natural numbers. Polymorphic existential quantifiers axe presented, together with some metatheory. Finally, potential applications to closures and memory-management are discussed.
|Item Type||Book Sections|
|Creators||Collinson, M., Pym, D. and Robinson, E.|
|Departments||Faculty of Science > Computer Science|
|Additional Information||ID number: ISI:000232244900005|
Actions (login required)