{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:03Z","timestamp":1725568143328},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_39","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T13:13:30Z","timestamp":1288098810000},"page":"458-472","source":"Crossref","is-referenced-by-count":4,"title":["Source-Tracking Unification"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Choppella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher T.","family":"Haynes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programmaning","author":"F. Baader","year":"1993","unstructured":"Baader, F., Siekmann, J.: Unification theory. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programmaning. Oxford University Press, Oxford (1993)"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"C. Barrett","year":"2000","unstructured":"Barrett, C., Jakob, R., Marathe, M.: Formal language constraint path problems. SIAM Journal of Computing\u00a030, 809\u2013837 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Beaven, M., Stansifer, R.: Explaining type errors in polymorphic languages. ACM Letters on Programming Languages (1994)","DOI":"10.1145\/176454.176460"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"CAAP \u201992","author":"Y. Bertot","year":"1992","unstructured":"Bertot, Y.: Origin Functions in \u03bb-calculus and Term Rewriting Systems. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol.\u00a0581. Springer, Heidelberg (1992)"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Chen, T.Y., Lassez, J.-L., Port, G.S.: Maximal unifiable subsets and minimal non-unifiable subsets. New Generation Computing, 133\u2013152 (1986)","DOI":"10.1007\/BF03037439"},{"key":"39_CR6","unstructured":"Choppella, V.: Implementation of unification source-tracking (July 2002), http:\/\/www.cs.indiana.edu\/hyplan\/chaynes\/unif.tar.gz"},{"key":"39_CR7","unstructured":"Choppella, V.: Unification Source-tracking with Application to Diagnosis of Type Inference. PhD thesis, Indiana University, IUCS Tech Report TR566 (August 2002)"},{"key":"39_CR8","first-page":"909","volume-title":"Information Processing","author":"J. Corbin","year":"1983","unstructured":"Corbin, J., Bidoit, M.: A rehabilitation of Robinson\u2019s unification algorithm. In: Mason, R.E.A. (ed.) Information Processing, pp. 909\u2013914. Elsevier Science Publishers (North Holland), Amsterdam (1983)"},{"key":"39_CR9","unstructured":"Cox, P.T.: Finding backtrack points for intelligent backtracking. In: Campbell, J. (ed.) Prolog Implementation, pp. 216\u2013233 (1984)"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Dinesh, T., Tip, F.: A case-study of slicing-based approach for locating type errors. In: Proc. 2nd International Conference on the Theory and Practice of Algebraic Specifications (ASF+SDF 1997) (September 1997)","DOI":"10.14236\/ewic\/AL1997.8"},{"issue":"1","key":"39_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0167-6423(95)00007-0","volume":"27","author":"D. Duggan","year":"1996","unstructured":"Duggan, D., Bent, F.: Explaining type inference. Science of Computer Programming\u00a027(1), 37\u201383 (1996)","journal-title":"Science of Computer Programming"},{"key":"39_CR12","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, G.F., Walz, J.A.: A maximum-flow approach to anomaly isolation in unification-based incremental type inference. In: Proceedings of the 13th ACM Symposium on Programming Languages, pp. 44\u201357 (1986)","DOI":"10.1145\/512644.512649"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Deductive Databases and Logic Programming","author":"J. Lassez","year":"1988","unstructured":"Lassez, J., Maher, M.J., Marriot, K.: Unification revisited. In: Minker, J. (ed.) Deductive Databases and Logic Programming, ch. 15, pp. 587\u2013625. Morgan Kaufmann, San Francisco (1988)"},{"issue":"1","key":"39_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0747-7171(89)80024-0","volume":"8","author":"P. Chenadec Le","year":"1989","unstructured":"Le Chenadec, P.: On the logic of unification. Journal of Symbolic computation\u00a08(1), 141\u2013199 (1989)","journal-title":"Journal of Symbolic computation"},{"issue":"4","key":"39_CR16","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1145\/291891.291892","volume":"20","author":"O. Lee","year":"1998","unstructured":"Lee, O., Yi, K.: Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages\u00a020(4), 707\u2013723 (1998)","journal-title":"ACM Transactions on Programming Languages"},{"key":"39_CR17","unstructured":"Marathe, M.: Personal communication (May 2002)"},{"issue":"2","key":"39_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Trans. Program. Lang. Syst.\u00a04(2), 258\u2013282 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1-2","key":"39_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(00)00049-9","volume":"248","author":"D. Melski","year":"2000","unstructured":"Melski, D., Reps, T.: Interconvertibility of a class of set constraints and context-free-language reachability. Theoretical Computer Science\u00a0248(1-2), 29\u201398 (2000)","journal-title":"Theoretical Computer Science"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. Journal of Computer and System Sciences\u00a017, 348\u2013375 (1978)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"39_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M. Paterson","year":"1978","unstructured":"Paterson, M., Wegman, M.: Linear unification. J. Comput. Syst. Sci.\u00a016(2), 158\u2013167 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"39_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G.E. Peterson","year":"1981","unstructured":"Peterson, G.E., Stickel, M.E.: Complete sets of reductions for some equational theories. Journal for the ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"Journal for the ACM"},{"key":"39_CR23","first-page":"651","volume-title":"Logic Programming: Proceedings of the Fifth International Conference and Symposium","author":"G.S. Port","year":"1988","unstructured":"Port, G.S.: A simple approach to finding the cause of non-unifiability. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming: Proceedings of the Fifth International Conference and Symposium, pp. 651\u2013665. MIT Press, Cambridge (1988)"},{"key":"39_CR24","first-page":"5","volume-title":"International Symposium on Logic Programming","author":"T. Reps","year":"1997","unstructured":"Reps, T.: Program analysis via graph reachability. In: Maluszynski, J. (ed.) International Symposium on Logic Programming, pp. 5\u201319. MIT Press, Cambridge (1997)"},{"key":"39_CR25","unstructured":"Tip, F.: Generation of Program Analysis Tools. PhD thesis, Institute for Logic, Language and Computation, CWI, Amsterdam (1995)"},{"key":"39_CR26","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S0747-7171(06)80004-0","volume":"15","author":"A. Deursen","year":"1993","unstructured":"van Deursen, A., Klint, P., Tip, F.: Origin Tracking. Journal of Symbolic Computation\u00a015, 523\u2013545 (1993); Special issue on automatic programming","journal-title":"Journal of Symbolic Computation"},{"key":"39_CR27","unstructured":"Walz, J.A.: Extending Attribute Grammars and Type Inference Algorithms. PhD thesis, Cornell University (February 1989), TR 89-968"},{"key":"39_CR28","doi-asserted-by":"crossref","unstructured":"Wand, M.: Finding the source of type errors. In: 13th Annual ACM Symp. on Principles of Prog. Languages, January 1986, pp. 38\u201343 (1986)","DOI":"10.1145\/512644.512648"},{"key":"39_CR29","unstructured":"Yang, J., Trinder, P., Michaelson, G., Wells, J.: Improved type error reporting. In: Proceeding of Implementation of Functional Languages, 12th International Workshop, September 2000, pp. 71\u201386 (2000)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T18:07:12Z","timestamp":1636740432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}