Binding-time analysis for mercury

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3049, Issue , 2004, Pages 189-232

  Vanhoof, Wim ^a   Bruynooghe, Maurice ^b   Leuschel, Michael ^c  

^a UNIVERSITY OF NAMUR   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

BINDING TIME ANALYSIS; HIGHER-ORDER; MERCURY PROGRAMS; MODULE STRUCTURE; TYPE INFORMATION;

MERCURY (METAL);

EID: 34547147427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25951-0_7     Document Type: Article

References (51)

1. L.O. Andersen. Binding-time analysis and the taming of C pointers. In PEPM93, pages 47-58. ACM, 1993.
2. K. Asai. Binding-time analysis for both static and dynamic expressions. New Generation Computing, 20(1):27-52, 2001.
3. Kenichi Asai. Binding-time analysis for both static and dynamic expressions. In Static Analysis Symposium, pages 117-133, 1999.
4. A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17:3-34, 1991.
5. A. Bondorf and J. Jørgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315-346, 1993.
6. Maurice Bruynooghe, Michael Leuschel, and Kostis Sagonas. A polyvariant binding-time analysis for off-line partial deduction. In C. Hankin, editor, Programming Languages and Systems, Proc. of ESOP'98, part of ETAPS'98, pages 27-41, Lisbon, Portugal, 1998. Springer-Verlag. LNCS 1381.
7. Maurice Bruynooghe, Wim Vanhoof, and Michael Codish. Pos(T) : Analyzing dependencies in typed logic programs. In Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Revised Papers, volume 2244 of LNCS, pages 406-420. Springer-Verlag, 2001.
8. F. Bueno, M. de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. Stuckey. A model for inter-module analysis and optimizing compilation. In K.K. Lau, editor, Preproceedings of LOPSTR 2000, pages 64-71, 2000.
9. C. Consel. Binding time analysis for higher order untyped functional languages. In 1990 ACM Conference on Lisp and Functional Programming, Nice, France, pages 264-272. ACM, 1990.
10. C. Consel et al. A uniform approach for compile-time and run-time specialization. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, pages 54-72. Springer-Verlag, 1996.
11. Thomas Conway, Fergus Henderson, and Zoltan Somogyi. Code generation for Mercury. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 242-256, Cambridge, 1995. MIT Press.
12. D. Dussart, R. Heldal, and J. Hughes. Module-sensitive program specialisation. In SIGPLAN '97 Conference on Programming Language Design and Implementation, June 1997, Las Vegas, pages 206-214. ACM, 1997.
13. Y. Futamura. Partial evaluation of a computation process -an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45-50, 1971.
14. R. Glück and J. Jørgensen. An automatic program generator for multi-level specialization. Lisp and Symbolic Computation, 10:113-158, 1997.
15. C.K. Gomard and N.D. Jones. A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming, l(l):21-69, 1991.
16. N. Heintze. Set-based analysis of ML programs. In ACM Conference on Lisp and Functional Programming, pages 306-317, 1994.
17. F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, Cambridge, Massachusetts, August 1991 (Lecture Notes in Computer Science, vol. 523), pages 448-472. ACM, Springer-Verlag, 1991.
18. F Henglein. Simple closure analysis. Technical Report D-193, DIKU Semantics Report, 1992.
19. F. Henglein and C. Mossin. Polymorphic binding-time analysis. In D. Sannella, editor, Programming Languages and Systems - ESOP'94- 5th European Symposium on Programming, Edinburgh, U.K., April 1994 (Lecture Notes in Computer Science, vol. 788), pages 287-301. Springer-Verlag, 1994.
20. L. Hornof and J. Noyé. Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity. In PEPM97, pages 63-73. ACM, 1997.
21. Dean Jacobs and Anno Langen. Static analysis of logic programs for independent AND-parallelism. Journal of Logic Programming, 13(2 &3):291-314, May/July 1992.
22. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2&3):205-258, 1992.
23. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
24. N.D. Jones, P. Sestoft, and H. Søndergaard. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, Dijon, France. (Lecture Notes in Computer Science, vol. 202), pages 124-140. Springer-Verlag, 1985.
25. J. Jørgensen and M. Leuschel. Efficiently generating efficient generating extensions in Prolog. In O. Danvy, R. Glück, and P. Thiemann, editors, Proceedings Dagstuhl Seminar on Partial Evaluation, pages 238-262, Schloss Dagstuhl, Germany, 1996. Springer-Verlag, LNCS 1110.
26. Vitaly Lagoon, Fred Mesnard, and Peter Stuckey. Termination analysis with types is more accurate. In Logic Programming, 19th International Conference, ICLP 2003, volume 2916 of LNCS, pages 254-268. Springer-Verlag, 2003.
27. T. K. Lakshman and Uday S. Reddy. Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system. In Kazunori Saraswat, Vijay; Ueda, editor, Proceedings of the 1991 International Symposium on Logic Programming (ISLP'91), pages 202-220, San Diego, CA, 1991. MIT Press.
28. J. Launchbury. Dependent sums express separation of binding times. In K. Davis and J. Hughes, editors, Functional Programming, Glasgow, Scotland, 1989, pages 238-253. Springer-Verlag, 1990.
29. Michael Leuschel, Stephen J. Craig, Maurice Bruynooghe, and Wim Vanhoof. Specializing interpreters using offline partial deduction. In K.K. Lau and M. Bruynooghe, editors, Program Development in Computational Logic. SpringerVerlag, 2004.
30. Michael Leuschel, J. Jørgensen, Wim Vanhoof, and Maurice Bruynooghe. Offline specialisation in Prolog using a hand-written compiler generator. Theory and Practice of Logic Programming, 4(1):139-191, 2002.
31. J. W. Lloyd. Declarative error diagnosis. New Generation Computing, 5:133-154, 1987.
32. T Mogensen. Binding Time Analysis for Polymorphically Typed Higher Order Languages. In J. Diaz and F. Orejas, editors, TAPSOFT'89, Barcelona, Spain, volume 352 of LNCS, pages 298-312. Springer-Verlag, 1989.
33. T. Mogensen and A. Bondorf. Logimix: A self-applicable partial evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Proceedings LOPSTR'92, pages 214-227. Springer-Verlag, Workshops in Computing Series, 1993.
34. A. Mycroft and R. A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23(3):295-307, 1984.
35. Jens Palsberg. Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems, 17(l):47-62, 1995.
36. G. Puebla and M. Hermenegildo. Some issues in analysis and specialization of modular Ciao-Prolog programs. In M. Leuschel, editor, Proceedings of the Workshop on Optimization and Implementation of Declarative Languages, Las Cruces, 1999. In Electronic Notes in Theoretical Computer Science, Volume 30 Issue No.2, Elsevier Science.
37. Jan-Georg Smaus. Analysis of polymorphically typed logic programs using ACIunification. In Robert Nieuwenhuis and Andrei Voronkov, editors, 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2250 of Lecture Notes in Artificial Intelligence, pages 280-295. SpringerVerlag, 2001.
38. Jan-Georg Smaus, Patricia M. Hill, and Andy King. Mode Analysis Domains for Typed Logic Programs. In Logic Program Synthesis and Transformation, pages 82-101, 1999.
39. Z. Somogyi. A system of precise modes for logic programs. In International Conference on Logic Programming, pages 769-787, 1987.
40. Zoltan Somogyi et al. The Melbourne Mercury compiler, release 0.9.
41. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. The implementation of Mercury, an efficient purely declarative logic programming language. In Proceedings of the ILPS'94 Postconference Workshop on Implementation Techniques for Logic Programming Languages, 1994.
42. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. Logic programming for the real world. In Proceedings of the ILPS'95 Postconference Workshop on Visions for the Future of Logic Programming, 1995.
43. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29 (1-3): 17-64, 1996.
44. Zoltan Somogyi, Fergus Henderson, Thomas Conway, Andres Bromage, Tyson Dowd, David Jeffery, Peter Ross, Peter Schachte, and Simon Taylor. Status of the Mercury system. In Proceedings of the JICSLP'96 Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, 1996.
45. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of Prolog using type graphs. Journal of Logic Programming, 22(3):179-209, 1995.
46. W. Vanhoof. Binding-time analysis by constraint solving: a modular and higherorder approach for Mercury. In M. Parigot and A. Voronkov, editors, Logic for Programming and Automated Reasoning, 7th Intl. Conference, LPAR2000, volume 1955 of Lecture Notes in Artificial Intelligence, pages 399 - 416, Reunion Island, France, 2000.
47. W. Vanhoof and M. Bruynooghe. Binding-time analysis for Mercury. In D. De Schreye, editor, 16th International Conference on Logic Programming, pages 500 - 514. MIT Press, 1999.
48. W. Vanhoof and M. Bruynooghe. Binding-time analysis for Mercury. In Preproceedings of LOPSTR'99, Venice, Italy, 1999. Technical Report, University of Venice.
49. Wim Vanhoof. Techniques for on- and off-line specialisation of logic programs. Phd, Department of Computer Science, K.U.Leuven, Leuven, Belgium, jun 2001. Pages: xiv+323+xxxiii.
50. Wim Vanhoof and Maurice Bruynooghe. Binding-time annotations without binding-time analysis. In Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, Proceedings, volume 2250 of Lecture Notes in Artificial Intelligence, pages 707-722. Springer-Verlag, 2001.
51. Wim Vanhoof and Maurice Bruynooghe. When size does matter - Termination analysis for typed logic programs. In Logic-based Program Synthesis and Transformation, llth International Workshop, LOPSTR 2001, Selected Papers, volume 2372 of Lecture Notes in Computer Science, pages 129-147. Springer-Verlag, 2002.