{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:29Z","timestamp":1725663389749},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190202"},{"type":"electronic","value":"9783540389200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19020-1_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:55:22Z","timestamp":1330181722000},"page":"455-473","source":"Crossref","is-referenced-by-count":0,"title":["The semantics of Miranda's algebraic types"],"prefix":"10.1007","author":[{"given":"Kim B.","family":"Bruce","sequence":"first","affiliation":[]},{"given":"Jon G.","family":"Riecke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"25_CR1","unstructured":"Roberto Amadio, Kim B. Bruce, and Giuseppe Longo. The finitary projection model for second order lambda calculus and solutions to higher order domain equations. In First Annual Symposium on Logic in Computer Science, Cambridge, MA, 1986."},{"key":"25_CR2","unstructured":"Kim B. Bruce, Albert R. Meyer, and John C. Mitchell. The semantics of second-order lambda calculus. 1985. To appear, Information and Computation."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"R. M. Burstall, D. B. MacQueen, and D. T. Sannella. Hope: an experimental applicative language. In Proceedings of the First International LISP Conference, Stanford, CA, 1980.","DOI":"10.1145\/800087.802799"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1145\/3916.3987","volume":"7","author":"A. Demers","year":"1985","unstructured":"Alan Demers and James Donahue. Data types are values. ACM Transactions on Programming Languages and Systems, 7:426\u2013445, July 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"25_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5016-6","volume-title":"Reference Manual for the Ada Programming Language","author":"U.S. Department of Defense","year":"1983","unstructured":"U.S. Department of Defense. Reference Manual for the Ada Programming Language, Springer-Verlag, New York, 1983."},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0049-237X(08)70843-7","volume-title":"Second Scandanavian Logic Symposium","author":"J.-Y. Girard","year":"1971","unstructured":"J.-Y. Girard. Une extension de l'interpretation de G\u00f6del \u00e0 l'analyse, et son application \u00e0 l'\u00e9limination des coupures dans l'analyse et al th\u00e9orie des types. In J.E. Fenstad, editor, Second Scandanavian Logic Symposium, pages 63\u201392, North Holland, Amsterdam, 1971."},{"key":"25_CR7","volume-title":"The Implementation of Functional Programming Languages","author":"Simon L. L. Peyton Jones","year":"1987","unstructured":"Simon L. Peyton Jones. The Implementation of Functional Programming Languages, Prentice-Hall, Englewood Cliffs, NJ, 1987."},{"key":"25_CR8","unstructured":"Matthew Kaufmann and Douglas Surber. Syntax, Semantics, and a Formal Logic for SASL. Technical Report ARC 85-03, Burroughs Austin Research Center, January 1985."},{"key":"25_CR9","unstructured":"Nancy McCracken. An Investigation of a Programming Language with a Polymorphic Type Structure. PhD thesis, Syracuse University, 1979."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"M. Robin","year":"1978","unstructured":"Robin Milner. A theory of type polymorphism. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"D. B. MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. In Proceedings of the Eleventh ACM Symposium on the Principles of Programming Languages, Salt Lake City, UT, pages 165\u2013174, 1984.","DOI":"10.1145\/800017.800528"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"D. B. MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Control, 71, 1986.","DOI":"10.1016\/S0019-9958(86)80019-5"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"D. B. MacQueen and Ravi Sethi. A semantic model of types for applicative languages. In 1982 ACM Symposium on Lisp and Functional Programming, Pittsburgh, PA, pages 243\u2013252, 1982.","DOI":"10.1145\/800068.802156"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Proceedings Colloque sur la Programmation","author":"John C. C. Reynolds","year":"1974","unstructured":"John C. Reynolds. Towards a theory of type structure. In Proceedings Colloque sur la Programmation, Lecture Notes in Computer Science 19, pages 408\u2013425, Springer-Verlag, New York, 1974."},{"key":"25_CR15","unstructured":"Jon G. Riecke. A denotational approach to the semantics of polymorphic languages. B.A. Honors Thesis, Department of Computer Science, Williams College. 1986."},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Languages, and Programming","author":"Dana S. S. Scott","year":"1982","unstructured":"Dana S. Scott. Domains for denotational semantics. In M. Nielsen and E. M. Schmidt, editors, Automata, Languages, and Programming, Lecture Notes in Computer Science 140, pages 577\u2013613, Springer-Verlag, New York, 1982."},{"key":"25_CR17","unstructured":"Christopher Strachey. Fundamental concepts in programming languages. Lecture notes for International Summer School in Computer Programming, Copenhagen. August 1967."},{"key":"25_CR18","unstructured":"Simon Thompson. Lawful types in Miranda. Unpublished manuscript. 1987."},{"key":"25_CR19","first-page":"29","volume-title":"Mathematical Logic and Programming Languages","author":"David A. A. Turner","year":"1985","unstructured":"David A. Turner. Functional programs as executable specifications. In Hoare and Shepherdson, editors, Mathematical Logic and Programming Languages, pages 29\u201354, Prentice-Hall, Englewood Cliffs, NJ, 1985."},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings IFIP International Conference on Functional Programming Languages and Computer Architecture, Nancy","author":"David A. A. Turner","year":"1985","unstructured":"David A. Turner. Miranda: a non-strict functional language with polymorhic types. In Proceedings IFIP International Conference on Functional Programming Languages and Computer Architecture, Nancy, Lecture Notes in Computer Science 201, Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Language Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19020-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:16:05Z","timestamp":1605626165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19020-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190202","9783540389200"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-19020-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}