{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:49Z","timestamp":1725664189993},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:27:33Z","timestamp":1330255653000},"page":"281-296","source":"Crossref","is-referenced-by-count":28,"title":["Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and T. K. Lakshman. Directional type checking of logic programs. Technical report, University of Illinois, 1994. Anonymous ftp: a.cs.uiuc.edu:\/pub\/reddy\/tkl.","DOI":"10.1007\/3-540-58485-4_32"},{"volume-title":"Proc' of the Joint International Conference and Symposium on Logic Programming","year":"1992","key":"18_CR2","unstructured":"K. Apt, editor. Proc' of the Joint International Conference and Symposium on Logic Programming, Washington, USA, 1992. The MIT Press."},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6423(92)90038-D","volume":"19","author":"R. Barbuti","year":"1992","unstructured":"R. Barbuti, and R. Giacobazzi. A bottom-up polymorphic type inference in logic programming. Science of Computer Programming, 19(3):281\u2013313, 1992.","journal-title":"Science of Computer Programming"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/151646.151650","volume":"15","author":"R. Barbuti","year":"1993","unstructured":"R. Barbuti, R. Giacobazzi, and G. Levi. A general framework for semantics-based bottom-up abstract interpretation of logic programs. ACM TOPLAS, 15(1):133\u2013181, 1993.","journal-title":"ACM TOPLAS"},{"key":"18_CR5","first-page":"570","volume-title":"Contributions to the semantics of open logic programs","author":"A. Bossi","year":"1992","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. Meo. Contributions to the semantics of open logic programs. In Proc' of the Int' Conf. on Fifth Generation Computer Systems, pages 570\u2013580, ICOT, Japan, 1992. Association for Computing Machinery."},{"key":"18_CR6","first-page":"321","volume-title":"A framework of directionality for proving termination of logic programs","author":"F. Bronsard","year":"1992","unstructured":"F. Bronsard, T. K. Lakshman, and U. S. Reddy. A framework of directionality for proving termination of logic programs. In Apt [2], pages 321\u2013335."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(94)90055-8","volume":"124","author":"M. Codish","year":"1994","unstructured":"M. Codish, D. Dams, and E. Yardeni. Bottom-up abstract interpretation of logic programs. Journal of Theoretical Computer Science, 124:93\u2013125, 1994.","journal-title":"Journal of Theoretical Computer Science"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"M. Codish, S. K. Debray, and R. Giacobazzi. Compositional analysis of modular logic programs. In Proc' of POPL'93, pages 451\u2013464. ACM Press, 1993.","DOI":"10.1145\/158511.158703"},{"key":"18_CR9","unstructured":"M. Codish and B. Demoen. Analysing logic programs using \u201cProp\u201d-ositional logic programs and a magic wand. In Miller [22], pages 114\u2013129."},{"key":"18_CR10","unstructured":"M. Codish, M. Falaschi, and K. Marriott. Suspension analysis for concurrent logic programs. ACM TOPLAS. In Press."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"M. Codish and G. Mashevitzky. Proving implications by algebraic approximation. In Proc' 4th Intn' Conf' on Algebraic and Logic Programming, Sept. 1994.","DOI":"10.1007\/3-540-58431-5_4"},{"key":"18_CR12","volume-title":"Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains","author":"M. Corsini","year":"1993","unstructured":"M. Corsini, K. Musumbu, A. Rauzy, and B. Le Charlier. Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains. In Proc' of PLILP'93, LNCS, Talin, Aug. 1993. Springer Verlag."},{"key":"18_CR13","first-page":"322","volume-title":"Proc', Sixth Annual LICS","author":"A. Cortesi","year":"1991","unstructured":"A. Cortesi, G. Fil\u00e9, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proc', Sixth Annual LICS, pages 322\u2013327, Amsterdam, July 1991. IEEE Press."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc' of POPL'77, pages 238\u2013252, Jan. 1977.","DOI":"10.1145\/512950.512973"},{"key":"18_CR15","first-page":"263","volume-title":"Meta-programming in Logic Programming","author":"T. Fr\u00fchwirth","year":"1989","unstructured":"T. Fr\u00fchwirth. Type inference by program transformation and partial evaluation. In H. Abramson, and M. Rogers, editors, Meta-programming in Logic Programming, pages 263\u2013282. The MIT Press, Cambridge, Massachusetts, 1989."},{"key":"18_CR16","unstructured":"M. Gabbrielli, R. Giac'obazzi, and D. Montesi. Modular logic programs over finite domains. In D. Sacc\u00e0, editor, Proc. Eight Italian Conf on Logic Programming, 1993."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"M. V. Hermenegildo, R. Warren, and S. K. Debray. Global flow analysis as a practical compilation tool. The Journal of Logic Programming, 13(1, 2, 3 and 4):349\u2013366.","DOI":"10.1016\/0743-1066(92)90053-6"},{"key":"18_CR18","unstructured":"T. K. Lakshman, U. S. Reddy, and F. Bronsard. A directional type system for Prolog: Unifying notions of types and directionality. Technical report, University of Illinois, 1994. Anonymous ftp: a.cs.uiuc.edu:\/pub\/reddy\/tkl."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"B. Le Charlier and P. V. Hentenryck. Groundness analysis for Prolog: implementation and evaluation of the domain Prop. In Proc' PEPM'93, 1993.","DOI":"10.1145\/154630.154641"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"18_CR21","unstructured":"K. Marriott and H. S\u00f8ndergaard. Semantics-based dataflow analysis of logic programs. In G. Ritter, editor, Information Processing 89. North-Holland, 1989."},{"key":"18_CR22","unstructured":"D. Miller, editor. Logic Programming \u2014 Proc' of the 1993 Int' Symp', 1993. The MIT Press."},{"key":"18_CR23","unstructured":"F. Pfenning, editor. Types in Logic Programming. MIT, 1992."},{"key":"18_CR24","first-page":"85","volume-title":"Integrating modes and subtypes into a Prolog type-checker","author":"Y. Rouzaud","year":"1992","unstructured":"Y. Rouzaud, and L. Nguyen-Phuong. Integrating modes and subtypes into a Prolog type-checker. In Apt [2], pages 85\u201397."},{"key":"18_CR25","first-page":"604","volume-title":"A type inference system for Prolog","author":"J. Xu","year":"1988","unstructured":"J. Xu, and D. S. Warren. A type inference system for Prolog. In R. A. Kowalski, and K. A. Bowen, editors, Proc' of the Fifth International Conference and Symposium on Logic Programming, pages 604\u2013619, Seatle, 1988. The MIT Press."},{"key":"18_CR26","volume-title":"PhD thesis","author":"E. Yardeni","year":"1992","unstructured":"E. Yardeni. Type Systems for Logic Programs Based on Abstract Interpretation. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, 1992."},{"key":"18_CR27","first-page":"379","volume-title":"Polymorphically typed logic programs","author":"E. Yardeni","year":"1991","unstructured":"E. Yardeni, T. Fruehwirth, and E. Shapiro. Polymorphically typed logic programs. In K. Furukawa, editor, Proc' of the Eighth Int' Conf ' on Logic Programming, pages 379\u2013393, Paris, France, 1991. The MIT Press."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:22Z","timestamp":1605630142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}