{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T21:23:10Z","timestamp":1750454590145},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_74","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:20:41Z","timestamp":1330276841000},"page":"17-31","source":"Crossref","is-referenced-by-count":6,"title":["Limits of ML-definability"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kahrs","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"2_CR1","unstructured":"F. Cardone and M. Coppo. Two extensions of Curry's type inference system. In P. Odifreddi, editor, Logic and Computer Science, pages 19\u201376. Academic Press, 1990."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. G. Bruijn de","year":"1972","unstructured":"N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34:381\u2013392, 1972.","journal-title":"Indagationes Mathematicae"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 244\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"2","key":"2_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F. Henglein","year":"1993","unstructured":"Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253\u2013289, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR5","unstructured":"Stefan Kahrs. About the completeness of type systems. In Proceedings ESSLLI Workshop on Observational Equivalence and Logical Equivalence, 1996. (to appear)."},{"key":"2_CR6","unstructured":"Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990."},{"key":"2_CR7","unstructured":"Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1988. CST-52-88."}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:21Z","timestamp":1619559381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}