Binding-Time analysis by constraint solving a modular and Higher-Order approach for mercury

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

Volumn 1955, Issue , 2000, Pages 399-416

  Vanhoof, Wim ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; LOGIC PROGRAMMING; MERCURY (METAL); RECONFIGURABLE HARDWARE;

BINDING TIME ANALYSIS; CONSTRAINT SOLVING; HIGHER-ORDER; NORMALISATION; OFF LINE PROGRAM; SPECIALISATION;

COMPUTER CIRCUITS;

EID: 84956868218     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Bondorf and J. Jørgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315–346, July 93.
2. 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
3. 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 Preproceedings of LOPSTR 2000, 2000.
4. Tyson Dowd, Zoltan Somogyi, Fergus Henderson, Thomas Conway, and David Jeffery. Run time type information in Mercury. In Proceedings of the International Conference on the Principles and Practice of Declarative Programming, volume 1702 of Lecture Notes in Computer Science, pages 224–243. Springer-Verlag, 1999.
5. D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In A.Mycroft, editor, International Static Analysis Symposium, Glasgow, Scotland, September 1995, (Lecture Notes in Computer Science, vol. 983), pages 118–136. Berlin: Springer-Verlag, 1995.
6. J. Gallagher. Specialisation of logic programs: A tutorial. In Proceedings PEPM’93, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88–98, Copenhagen, June 1993. ACM Press
7. F. Henglein and C. Mossin. Polymorphic binding-time analysis. Lecture Notes in Computer Science, 788, 1994.
8. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
9. 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.
10. J. Launchbury. Dependent sums express separation of binding times. In K. Davis and J. Hughes, editors, Functional Programming, pages 238–253. Springer-Verlag, 1989.
11. M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems, 20(1), 1998.
12. 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.
13. Jens Palsberg. Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems, 17(1):47–62, January 1995.
14. G. Puebla and M. Hermenegildo. Some issues in analysis and specialization of modular Ciao-Prolog programs. Las Cruces, 1999. Proceedings of the Workshop on Optimization and Implementation of Declarative Languages. In Electronic Notes in Theoretical Computer Science, Volume 30 Issue No.2, Elsevier Science.
15. 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, October–November 1996.
16. 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.
17. W. Vanhoof and M. Bruynooghe. Towards modular binding-time analysis for firstorder Mercury. Las Cruces, 1999. Proceedings of the Workshop on Optimization and Implementation of Declarative Languages. In Electronic Notes in Theoretical Computer Science, Volume 30 Issue No.2, Elsevier Science.