{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:04:46Z","timestamp":1726412686389},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022505","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"194-204","source":"Crossref","is-referenced-by-count":14,"title":["An extended polymorphic type system for applicative languages"],"prefix":"10.1007","author":[{"given":"Mario","family":"Coppo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"C. Ben-Yelles \u201cType assignment in the lambda-calculus: Syntax and Semantics\u201d, P.h.D. thesis, University of Wales (1979)"},{"key":"14_CR2","unstructured":"M. Coppo, M. Dezani-Ciancaglini. \u201cAn extension of Basic Functionality theory for \u03bb-calculus\u201d, Internal report, University of Turin. To appear in \u201cNotre Dame Journal of Formal Logic\u201d"},{"key":"14_CR3","unstructured":"M. Coppo, M. Dezani-Ciancaglini, B. Venneri. \u201cPrincipal Type Schemes and calculus Semantics\u201d Internal report, University of Turin. To appear in: To H.B. Curry, Essays on Combinatory Logic, Lambda-calculus and Formalism, eds. R. Hindley and J.P. Seldin, Academic Press (1980)."},{"key":"14_CR4","unstructured":"H.B. Curry,R.Feys \u201cCombinatory Logic I\u201d, North-Holland (1958)"},{"key":"14_CR5","unstructured":"A. Demers, J. Donahue \u201cReport on the Programming Language Russel\u201d, TR79-371, Computer Science Department, Cornell University (1979)"},{"key":"14_CR6","unstructured":"J. Donahue \u201cOn the Semantics of data types\u201d, TR77-311, Computer Science Department, Cornell University (1977)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"J.D. Gammon \u201cAn Experimental Evaluation of Data Type Conventions\u201d, Comm. ACM 20,8 (1977) 584\u2013595","DOI":"10.1145\/359763.359800"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"D. Gries and N. Gehani \u201cSome ideas on data types in high-level languages\u201d, Camm. ACM. 20,6 (1977).","DOI":"10.1145\/359605.359624"},{"key":"14_CR9","unstructured":"M.J. Gordon, A.J. Milner, C.P. Wadsworth \u201cEdimburgh LCF\u201d, Lecture notes in Computer Science, n. 78."},{"issue":"1","key":"14_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2272337","volume":"39","author":"R. Hindley","year":"1974","unstructured":"R. Hindley \u201cAn abstract Church-Rosser Theorem II: applications\u201d, Journal of Symbolic Logic, 39, 1 (1974), 1\u201321.","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"B. Liskov, A. Snyder \u201cAbstraction Mechanisms in CLU\u201d, Camm. ACM. 20,3 (1977), 564\u2013583","DOI":"10.1145\/359763.359789"},{"issue":"3","key":"14_CR12","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner \u201cA theory of type polymorphism in programming\u201d, Journ. Comp. and Syst. Science 17,3 (1978), 348\u2013375.","journal-title":"Journ. Comp. and Syst. Science"},{"key":"14_CR13","unstructured":"J. H. Morris \u201cLambda-calculus models of programming languages\u201d, Ph.D.Thesis, MAC-TR-57, MIT (1968)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"G. Plotkin, \u201cLCF considered as a programming language\u201d, J. Theoret. Comput. Sci. 5,3 (1977) 522\u2013537","journal-title":"J. Theoret. Comput. Sci."},{"issue":"2","key":"14_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","volume":"17","author":"G. Plotkin","year":"1978","unstructured":"G. Plotkin \u201cT \u03c9 as a Universal Domain\u201d, J. Comput. System Sci. 17,2 (1978), 209\u2013236.","journal-title":"J. Comput. System Sci."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"J.C. Reynolds \u201cTowards a theory of type structure\u201d, Lecture Notes in Computer Science n. 12, 408\u2013425","DOI":"10.1007\/3-540-06859-7_148"},{"key":"14_CR17","unstructured":"J. Stoy \u201cDenotational Semantics\u201d, MIT Press (1977)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022505.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:45Z","timestamp":1607550525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0022505","relation":{},"subject":[]}}