{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:56Z","timestamp":1751983676357},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615804"},{"type":"electronic","value":"9783540705895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61580-6_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:01:12Z","timestamp":1330293672000},"page":"115-136","source":"Crossref","is-referenced-by-count":18,"title":["Regular approximation of computation paths in logic and functional languages"],"prefix":"10.1007","author":[{"given":"John","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Lafave","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"2","key":"7_CR1","first-page":"205","volume":"13","author":"M. Bruynooghe","year":"1992","unstructured":"M. Bruynooghe and G. Janssens. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2&3):205\u2013258, 1992.","journal-title":"Journal of Logic Programming"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"D.A. de Waal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), Nancy, 1994.","DOI":"10.1007\/3-540-58156-1_15"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M.Y. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Proceedings of the IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"7_CR4","unstructured":"J. Gallagher. Transforming logic programs by specialising interpreters. In Proceedings of the 7th European Conference on Artificial Intelligence (ECAI-86), Brighton, pages 109\u2013122, 1986."},{"issue":"1991","key":"7_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J. Gallagher","year":"1991","unstructured":"J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(1991):305\u2013333, 1991.","journal-title":"New Generation Computing"},{"key":"7_CR6","volume-title":"Fast and precise regular approximation of logic programs","author":"J. Gallagher","year":"1994","unstructured":"J. Gallagher and D.A. de Waal. Fast and precise regular approximation of logic programs. In P. Van Hentenryck, editor, Proceedings of the International Conference on Logic Programming (ICLP'94), Santa Margherita Ligure, Italy, MIT Press, 1994."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Robert Gl\u00fcck and Andrei V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In G. Fil\u00e8 P.Cousot, M.Falaschi and A. Rauzy, editors, Static Analysis. Proceedings, pages 112\u2013123, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57264-3_34"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Robert Gl\u00fcck and Morten Heine S\u00f8rensen. Partial deduction and driving are equivalent. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming, pages 165\u2013181, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58402-1"},{"key":"7_CR9","unstructured":"P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of prolog using type graphs. Journal of Logic Programming, (to appear)."},{"key":"7_CR10","unstructured":"N. Heintze. Practical aspects of set based analysis. In K. Apt, editor, Proceedings of the Joint International Symposium and Conference on Logic Programming, pages 765\u2013769, MIT Press, 1992."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"N. Jones and A. Mycroft. Dataflow analysis of applicative programs using minimal function graphs. In Proceedings of Principle of Programming Languages (POPL'86), ACM Press, 1986.","DOI":"10.1145\/512644.512672"},{"key":"7_CR12","unstructured":"N. Jones. Flow analysis of lazy higher order functional programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, Ellis-Horwood, 1987."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"M. Leuschel. Ecological partial deduction: preserving characteristic trees without constraints. In M. Proietti, editor, Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, Springer-Verlag (to appear), 1995.","DOI":"10.1007\/3-540-60939-3_1"},{"key":"7_CR14","unstructured":"J.W. Lloyd. The Programming Language Escher. Technical Report CSTR-95-013, Dept. of Computer Science, University of Bristol, 1995."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Proc. of the Dagstuhl Seminar on Partial Evaluation, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61580-6_13"},{"key":"7_CR16","volume-title":"Ensuring global termination of partial deduction while allowing flexible polyvariance","author":"B. Martens","year":"1995","unstructured":"B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proc. International Conference on Logic Progrmaming, (ICLP'95), Tokyo, MIT Press, 1995."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"H. Saglam and J. Gallagher. Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions. Technical Report CSTR-95-17, University of Bristol, Department of Computer Science, 1995.","DOI":"10.1007\/BFb0026840"},{"key":"7_CR18","unstructured":"Morten Heine S\u00f8rensen and Robert Gl\u00fcck. An algorithm of generalization in positive supercompilation. In J. W. Lloyd, editor, International Logic Programming Symposium, page to appear, MIT Press, 1995."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Morten Heine S\u00f8rensen, Robert Gl\u00fcck, and Neil D. Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In ESOP, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57880-3_32"},{"key":"7_CR20","unstructured":"E.Y. Shapiro. Or-parallel prolog in flat concurrent prolog. In E.Y. Shapiro, editor, Concurrent Prolog: Collected Papers (Volume 2), MIT Press, 1987."},{"key":"7_CR21","volume-title":"Proc. 3rd ICLP","author":"H. Tamaki","year":"1986","unstructured":"H. Tamaki and T. Sato. OLDT resolution with tabulation. In E.Y. Shapiro, editor, Proc. 3rd ICLP, London, Springer-Verlag, 1986."},{"key":"7_CR22","unstructured":"V. Turchin. The algorithm of generalization in the supercompiler. In D. Bj\u00f8rner, A.P. Ershov, and N.D. Jones, editors, Proc. of the IFIP TC2 Workshop, Partial Evaluation and Mixed Computation, pages 531\u2013549, North-Holland, 1988."},{"issue":"3","key":"7_CR23","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1017\/S0956796800000757","volume":"3","author":"V. Turchin","year":"1993","unstructured":"V. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3):283\u2013313, 1993.","journal-title":"Journal of Functional Programming"},{"key":"7_CR24","unstructured":"V. Turchin. Metacomputation: MST plus SCP. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Proc. of the Dagstuhl Seminar on Partial Evaluation, Springer-Verlag, 1996."},{"issue":"2","key":"7_CR25","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1990","unstructured":"E. Yardeni and E.Y. Shapiro. A type system for logic programs. Journal of Logic Programming, 10(2):125\u2013154, 1990.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Partial Evaluation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61580-6_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:17Z","timestamp":1605647297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61580-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615804","9783540705895"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-61580-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}