{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:15Z","timestamp":1763467815175},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008866"},{"type":"electronic","value":"9783540365754"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36575-3_20","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T21:52:15Z","timestamp":1193521935000},"page":"284-301","source":"Crossref","is-referenced-by-count":27,"title":["Type Error Slicing in Implicitly Typed Higher-Order Languages"],"prefix":"10.1007","author":[{"given":"Christian","family":"Haack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. B.","family":"Wells","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"M. Beaven, R. Stansifer. Explaining type errors in polymorphic languages. ACM Letters on Programming Languages and Systems, 2, 1993.","DOI":"10.1145\/176454.176460"},{"key":"20_CR2","unstructured":"K. L. Bernstein, E. W. Stark. Debugging type errors (full version). Technical report, State University of New York, Stony Brook, 1995."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"O. Chitil. Compositional explanation of types and algorithmic debugging of type errors. In Proc. 6th Int\u2019l Conf. Functional Programming. ACM Press, 2001.","DOI":"10.1145\/507635.507659"},{"key":"20_CR4","unstructured":"V. Chopella. Unification source-tracking with application to diagnosis of type inference. PhD thesis, Indiana University, 2002."},{"key":"20_CR5","unstructured":"V. Chopella, C. T. Haynes. Diagnosis of ill-typed programs. Technical Report 426, Indiana University, 1995."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"L. Damas, R. Milner. Principal type schemes for functional programs. In Conf. Rec. 9th Ann. ACM Symp. Princ. of Prog. Langs., 1982.","DOI":"10.1145\/582153.582176"},{"key":"20_CR7","unstructured":"L. M. M. Damas. Type assignment in Programming Languages. PhD thesis, University of Edinburgh, Edinburgh, Scotland, 1985."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"T. B. Dinesh, F. Tip. A slicing-based approach for locating type errors. In Proceedings of the USENIX conference on Domain-Specific Languages, Santa Barbara, California, 1997.","DOI":"10.14236\/ewic\/AL1997.8"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"D. Duggan, F. Bent. Explaining type inference. Sci. Comput. Programming, 27, 1996.","DOI":"10.1016\/0167-6423(95)00007-0"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"C. Flanagan, M. Flatt, S. Krishnamurthi, S. Weirich, M. Felleisen. Catching bugs in the web of program invariants. In Proc. ACM SIGPLAN\u2019 96 Conf. Prog. Lang. Design & Impl., 1996.","DOI":"10.1145\/231379.231387"},{"key":"20_CR11","unstructured":"B. Heeren, J. Hage. Parametric type inferencing for helium. Technical Report UU-CS-2002-035, University Utrecht, 2002."},{"key":"20_CR12","unstructured":"B. Heeren, J. Hage, D. Swierstra. Generalizing Hindley-Milner type inference algorithms. Technical Report UU-CS-2002-031, University Utrecht, 2002."},{"key":"20_CR13","unstructured":"B. Heeren, J. Jeuring, D. Swierstra, P. A. Alcocer. Improving type-error messages in functional languages. Technical Report UU-CS-2002-009, University Utrecht, 2002."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"T. Jim. What are principal typings and what are they good for? In POPL\u2019 96 [22].","DOI":"10.1145\/237721.237728"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"G. F. Johnson, J. A. Walz. A maximum flow approach to anomaly isolation in unification-based incremental type inference. In POPL\u2019 96 [22].","DOI":"10.1145\/512644.512649"},{"key":"20_CR16","unstructured":"P. Kanellakis, H. Mairson, J. C. Mitchell. Unification and ML type reconstruction. In J.-L. Lassez, G. Plotkin, eds., Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury, J. Tiuryn, P. Urzyczyn. An analysis of ML typability. J. ACM, 41(2), 1994.","DOI":"10.1145\/174652.174659"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"O. Lee, K. Yi. Proofs about a folklore let-polymorphic type inference algorithm. ACM Trans. on Prog. Langs. & Systs., 20(4), 1998.","DOI":"10.1145\/291891.291892"},{"key":"20_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Implementation of Functional Languages (IFL\u201998)","author":"B. J. McAdam","year":"1998","unstructured":"B. J. McAdam. On the unification of substitutions in type inference. In K. Hammond, A. J. T. Davie, C. Clack, eds., Implementation of Functional Languages (IFL\u201998), vol. 1595 of LNCS, London, UK, 1998. Springer-Verlag."},{"key":"20_CR20","unstructured":"B. J. McAdam. Generalising techniques for type debugging. In Trinder et al. [25]."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"R. Milner, M. Tofte, R. Harper, D. B. MacQueen. The Denition of Standard ML (Revised). MIT Press, 1997.","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"20_CR22","unstructured":"G. S. Port. A simple approach to finding the cause of non-unifiability. In Proc. Fifth International Conference on Logic Programming. MIT Press, 1988."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Z. Shao, A. Appel. Smartest recompilation. In Conf. Rec. 20th Ann. ACM Symp. Princ. of Prog. Langs., 1993.","DOI":"10.1145\/158511.158702"},{"key":"20_CR24","unstructured":"P. Trinder, G. Michaelson, H.-W. Loidl, eds. Trends in Func. Programming. Intellect, 2000."},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"M. Wand. Finding the source of type errors. In Conf. Rec. 13th Ann. ACM Symp. Princ. of Prog. Langs., 1986.","DOI":"10.1145\/512644.512648"},{"key":"20_CR26","series-title":"Lect Notes Comput Sci","volume-title":"Intractable unifiability problems and backtracking","author":"D. A. Wolfram","year":"1986","unstructured":"D. A. Wolfram. Intractable unifiability problems and backtracking. In Proc. Third International Conference on Logic Programming, vol. 225 of LNCS, 1986."},{"key":"20_CR27","unstructured":"J. YANG. Explaining type errors by finding the source of a type conflict. In Trinder et al. [25]."},{"key":"20_CR28","unstructured":"J. YANG, G. Michaelson, P. Trinder. Explaining polymorphic types. Computer Journal, 200X. to appear."},{"key":"20_CR29","unstructured":"J. YANG, G. Michaelson, P. Trinder, J. B. Wells. Improved type error reporting. In [Draft] Proc. 12th Int\u2019l Workshop Implementation Functional Languages, Aachen, Germany, 2000."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36575-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T17:22:14Z","timestamp":1588008134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36575-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008866","9783540365754"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-36575-3_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}