{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:14Z","timestamp":1725456014641},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024189","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:49:34Z","timestamp":1132393774000},"page":"255-276","source":"Crossref","is-referenced-by-count":3,"title":["Efficient data representation in polymorphic languages"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Leroy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Luca Cardelli. The Functional Abstract Machine. Polymorphism, 1(1), 1983."},{"key":"18_CR2","unstructured":"Luca Cardelli. Typeful programming. Technical Report 45, DEC Systems Research Center, 1989."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Computing surveys, 17(4), 1985.","DOI":"10.1145\/6041.6042"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Luis Damas and Robin Milner. Principal type-schemas for functional programs. In Proc. Symp. Principles of Programming Languages, 1982.","DOI":"10.1145\/582153.582176"},{"key":"18_CR5","unstructured":"Jean-Yves Girard. Interpr\u00e9tation fonctionnelle et \u00e9limination des coupures de l'arithm\u00e9tique d'ordre sup\u00e9rieur. Th\u00e8se d'Etat, Universit\u00e9 Paris VII, 1972."},{"key":"18_CR6","unstructured":"Brian W. Kernighan and Dennis M. Ritchie. The C programming language. Addison-Wesley, second edition 1988."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"P. J. Landin. The mechanical evaluation of expressions. The Computer Journal, pages 308\u2013320, 1964.","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"18_CR8","unstructured":"David C. J. Matthews. Poly manual. Technical Report 63, Computer Laboratory, University of Cambridge, 1985."},{"key":"18_CR9","unstructured":"Robin Milner, Mads Tofte, and Robert Harper. The definition of Standard ML. The MIT Press, 1990."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"John Peterson. Untagged data in tagged environments: choosing optimal representations at compile-time. In Functional Programming Languages and Computer Architecture, 1989.","DOI":"10.1145\/99370.99377"},{"key":"18_CR11","unstructured":"Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Toward a theory of type structure. In Colloquium on Programming, volume 19 of Lecture Notes in Computer Science. Springer-Verlag, 1974.","DOI":"10.1007\/3-540-06859-7_148"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024189.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:52:16Z","timestamp":1607550736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0024189","relation":{},"subject":[]}}