{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:45Z","timestamp":1725663765975},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552536"},{"type":"electronic","value":"9783540468035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:56:30Z","timestamp":1330232190000},"page":"233-253","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic typing"],"prefix":"10.1007","author":[{"given":"Fritz","family":"Henglein","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically-typed language. In Proc. 16th Annual ACM Symp. on Principles of Programming Languages, pages 213\u2013227, ACM, Jan. 1989.","DOI":"10.1145\/75277.75296"},{"issue":"2","key":"14_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/103135.103138","volume":"13","author":"M. Abadi","year":"1991","unstructured":"M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(2):237\u2013268, April 1991. Presented at POPL '89.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance and explicit coercion. In Proc. Logic in Computer Science (LICS), pages 112\u2013129, 1989.","DOI":"10.1109\/LICS.1989.39166"},{"issue":"1","key":"14_CR4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0890-5401(91)90055-7","volume":"93","author":"V. Breazu-Tannen","year":"1991","unstructured":"V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172\u2013221, July 1991. Presented at LICS '89.","journal-title":"Information and Computation"},{"key":"14_CR5","first-page":"278","volume-title":"Proc. ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation","author":"R. Cartwright","year":"1991","unstructured":"R. Cartwright and M. Fagan. Soft typing. In Proc. ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation, Toronto, Ontario, pages 278\u2013292, ACM, ACM Press, June 1991."},{"key":"14_CR6","first-page":"132","volume-title":"Proc. 15th Coll. on Trees in Algebra and Programming","author":"P. Curien","year":"1990","unstructured":"P. Curien and G. Ghelli. Coherence of subsumption. In A. Arnold, editor, Proc. 15th Coll. on Trees in Algebra and Programming, Copenhagen, Denmark, pages 132\u2013146, Springer, May 1990."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Y. Fuh and P. Mishra. Type inference with subtypes. In Proc. 2nd European Symp. on Programming, pages 94\u2013114, Springer-Verlag, 1988. Lecture Notes in Computer Science 300.","DOI":"10.1007\/3-540-19027-9_7"},{"issue":"3","key":"14_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/116873.116878","volume":"23","author":"Z. Galil","year":"1991","unstructured":"Z. Galil and G. Italiano. Data structures and algorithms for disjoint set union problems. ACM Computing Surveys, 23(3):319\u2013344, Sept. 1991.","journal-title":"ACM Computing Surveys"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"C. Gomard. Partial type inference for untyped functional programs (extended abstract). In Proc. LISP and Functional Programming (LFP), Nice, France, July 1990.","DOI":"10.1145\/91556.91672"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"F. Henglein. Fast left-linear semi-unification. In Proc. Int'l. Conf. on Computing and Information, Springer, May 1990. Lecture Notes of Computer Science, Vol. 468.","DOI":"10.1007\/3-540-53504-7_64"},{"key":"14_CR11","first-page":"448","volume-title":"Lecture Notes in Computer Science, Vol. 523","author":"F. Henglein","year":"1991","unstructured":"F. Henglein. Efficient type inference for higher-order binding-time analysis. In Proc. Conf. on Functional Programming Languages and Computer Architecture (FPCA), Cambridge, Massachusetts, pages 448\u2013472, Springer, Aug. 1991. Lecture Notes in Computer Science, Vol. 523."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"P. Kanellakis and P. Revesz. On the Relationship of Congruence Closure and Unification, chapter 2, pages 23\u201341. Frontier Series, Addison-Wesley, ACM Press, 1990.","DOI":"10.1145\/101620.101622"},{"key":"14_CR13","first-page":"406","volume-title":"Lecture Notes in Computer Science, Vol. 523","author":"X. Leroy","year":"1991","unstructured":"X. Leroy and M. Mauny. Dynamics in ML. In Proc. Conf. on Functional Programming Languages and Computer Architecture (FPCA), Cambridge, Massachusetts, pages 406\u2013426, Springer, Aug. 1991. Lecture Notes in Computer Science, Vol. 523."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"J. La Poutr\u00e9 and J. van Leeuwen. Maintenance of transitive closures and transitive reductions of graphs. In Proc. Int'l Workshop on Graph-Theoretic Concepts in Computer Science, pages 106\u2013120, Springer-Verlag, June 1987. Lecture Notes in Computer Science, Vol. 314.","DOI":"10.1007\/3-540-19422-3_9"},{"key":"14_CR15","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. A theory of type polymorphism in programming. J. Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"J. Computer and System Sciences"},{"key":"14_CR16","unstructured":"A. Mycroft. Dynamic types in statically typed languages. Aug. 1984. Unpublished manuscript, 2nd draft version."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"P. O'Keefe and M. Wand. Type inference for partial types is decidable. Sept. 1991. Submitted to ESOP '92.","DOI":"10.1007\/3-540-55253-7_24"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"B. Pierce. Bounded Quantification is Undecidable. Technical Report CMU-CS-91-161, Carnegie Mellon University, July 1991. To be presented at POPL '92.","DOI":"10.1145\/143165.143228"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"D. Remy. Typechecking records and variants in a natural extension of ML. In Proc. 16th Annual ACM Symp. on Principles of Programming Languages, pages 77\u201388, ACM, Jan. 1989.","DOI":"10.1145\/75277.75284"},{"key":"14_CR20","first-page":"39","volume-title":"Proc. Functional Programming Languages and Computer Architecture (FPCA)","author":"P. Sestoft","year":"1989","unstructured":"P. Sestoft. Replacing function parameters by global variables. In Proc. Functional Programming Languages and Computer Architecture (FPCA), London, England, pages 39\u201353, ACM Press, Sept. 1989."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"R. Tarjan. Data Structures and Network Flow Algorithms. Volume CMBS 44 of Regional Conference Series in Applied Mathematics, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"S. Thatte. Type inference with partial types. In Proc. Int'l Coll. on Automata, Languages and Programming (ICALP), pages 615\u2013629, 1988.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"S. Thatte. Quasi-static typing. In Proc. ACM Symp. on Principles of Programming Languages, pages 367\u2013381, ACM, Jan. 1990.","DOI":"10.1145\/96709.96747"},{"key":"14_CR24","unstructured":"D. Yellin. A Dynamic Transitive Closure Algorithm. Technical Report RC 13535, IBM T.J. Watson Research Ctr., June 1988."}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:29:18Z","timestamp":1619558958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}