{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:43Z","timestamp":1725551623968},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_9","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T09:44:25Z","timestamp":1132652665000},"page":"110-124","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages"],"prefix":"10.1007","author":[{"given":"Gopalan","family":"Nadathur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochu","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-50940-2_38","volume-title":"TAPSOFT \u201989. Proceedings of the International Joint Conference on Theory and Practice of Software Development Barcelona, Spain, March 13-17, 1989","author":"M. Hanus","year":"1989","unstructured":"Hanus, M.: Horn clause programs with polymorphic types: Semantics and resolution. In: D\u00edaz, J., Orejas, F. (eds.) TAPSOFT 1989 and CCIPL 1989. LNCS, vol.\u00a0352, pp. 225\u2013240. Springer, Heidelberg (1989)"},{"key":"9_CR2","first-page":"382","volume-title":"Proceedings of the Sixth International Logic Programming Conference","author":"M. Hanus","year":"1989","unstructured":"Hanus, M.: Polymorphic higher-order programming in Prolog. In: Levi, G., Martelli, M. (eds.) Proceedings of the Sixth International Logic Programming Conference, pp. 382\u2013398. MIT Press, Cambridge (1989)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"Huet, G.: A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science\u00a01, 27\u201357 (1975)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0096-0551(94)90012-4","volume":"20","author":"K. Kwon","year":"1994","unstructured":"Kwon, K., Nadathur, G., Wilson, D.S.: Implementing polymorphic typing in a logic programming language. Computer Languages\u00a020(1), 25\u201342 (1994)","journal-title":"Computer Languages"},{"key":"9_CR5","first-page":"202","volume-title":"Proceedings of the International Logic Programming Symposium","author":"T.K. Lakshman","year":"1991","unstructured":"Lakshman, T.K., Reddy, U.S.: Typed Prolog: A semantic reconstruction of the Mycroft-O\u2019Keefe type system. In: Saraswat, V., Ueda, K. (eds.) Proceedings of the International Logic Programming Symposium, pp. 202\u2013217. MIT Press, Cambridge (1991)"},{"key":"9_CR6","unstructured":"Michaylov, S., Pfenning, F.: An empirical study of the runtime behavior of higher-order logic programs. In: Conference Record of the Workshop on the \u03bbProlog Programming Language, Philadelphia (July-August 1992)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation\u00a01(4), 497\u2013536 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"Mycroft, A., O\u2019Keefe, R.A.: A polymorphic type system for Prolog. Artificial Intelligence\u00a023, 295\u2013307 (1984)","journal-title":"Artificial Intelligence"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Nadathur, G., Linnell, N.: Practical higher-order pattern unification with on-the-fly raising. Technical Report 2005\/2, Digital Technology Center (April 2005); to appear in the Proceedings of ICLP 2005","DOI":"10.1007\/11562931_28"},{"key":"9_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-48660-7_25","volume-title":"Automated Deduction - CADE-16","author":"G. Nadathur","year":"1999","unstructured":"Nadathur, G., Mitchell, D.J.: System description: Teyjus\u2014a compiler and abstract machine based implementation of \u03bbProlog. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 287\u2013291. Springer, Heidelberg (1999)"},{"key":"9_CR12","first-page":"245","volume-title":"Types in Logic Programming","author":"G. Nadathur","year":"1992","unstructured":"Nadathur, G., Pfenning, F.: The type system of a higher-order logic programming language. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 245\u2013283. MIT Press, Cambridge (1992)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/LICS.1993.287599","volume-title":"Eighth Annual IEEE Symposium on Logic in Computer Science","author":"T. Nipkow","year":"1993","unstructured":"Nipkow, T.: Functional unification of higher-order patterns. In: Eighth Annual IEEE Symposium on Logic in Computer Science, June 1993, pp. 64\u201374. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/LICS.1989.39186","volume-title":"Fourth Annual Symposium on Logic in Computer Science","author":"F. Pfenning","year":"1989","unstructured":"Pfenning, F.: Elf: A language for logic definition and verified metaprogramming. In: Fourth Annual Symposium on Logic in Computer Science, pp. 313\u2013322. IEEE Computer Society Press, Los Alamitos (June 1989)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., Lee, P.: TIL: A type-directed optimizing compiler for ML. In: Proc. ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation, pp. 181\u2013192 (1996)","DOI":"10.1145\/231379.231414"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:33Z","timestamp":1605643353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11591191_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}