Programming Symposium. Böhm, C.; Dezani-Ciancaglini, M.; and Ronchi Della Rocca, S. 19:266–279.
Paper doi abstract bibtex The type structure of programming languages has been the subject of an active development characterized by continued controversy over basic principles. In this paper, we formalize a view of these principles somewhat similar to that of J. H. Morris. We introduce an extension of the typed lambda calculus which permits user-defined types and polymorphic functions, and show that the semantics of this language satisfies a representation theorem which embodies our notion of a `correct' type structure.
@article{bohmProgrammingSymposium1974,
title = {Programming {{Symposium}}},
volume = {19},
issn = {1098-6596},
url = {http://www.springerlink.com/index/10.1007/3-540-06859-7},
doi = {10.1007/3-540-06859-7},
abstract = {The type structure of programming languages has been the subject of an active development characterized by continued controversy over basic principles. In this paper, we formalize a view of these principles somewhat similar to that of J. H. Morris. We introduce an extension of the typed lambda calculus which permits user-defined types and polymorphic functions, and show that the semantics of this language satisfies a representation theorem which embodies our notion of a `correct' type structure.},
journaltitle = {Programming Symposium, Proceedings Colloque sur la Programmation, Paris, France, April 9-11, 1974},
date = {1974},
pages = {266--279},
keywords = {types},
author = {Böhm, Corrado and Dezani-Ciancaglini, Mariangiola and Ronchi Della Rocca, Simona},
file = {/home/dimitri/Nextcloud/Zotero/storage/BUVHWJQU/Reynolds - 1974 - Towards a theory of type structure.pdf},
eprinttype = {pmid},
eprint = {25246403}
}