Implementation of multiple specialization in logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Implementation of multiple specialization in logic programs

Full text

Pdf (1.23 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

La Jolla, California, United States

Pages: 77 - 87

Year of Publication: 1995

ISBN:0-89791-720-0

Authors

Germán Puebla	Computer Science Department, Technical University of Madrid (UPM)
Manuel Hermenegildo	Computer Science Department, Technical University of Madrid (UPM)

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 8, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/215465.215561 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
	2	Maurice Bruynooghe, A practical framework for the abstract interpretation of logic programs, Journal of Logic Programming, v.10 n.2, p.91-124, Feb. 1991 [doi>10.1016/0743-1066(91)80001-T]
	3	F. Bueno , M. García de la Banda , M. Hermenegildo, Effectiveness of global analysis in strict independence-based automatic parallelization, Proceedings of the 1994 International Symposium on Logic programming, p.320-336, November 1994, Symposia, Melbourne
	4	M.A. Bulyonkov. Polivariant Mixed Computation for Analyzer Programs. Acta Informatica, 21:473-484, 1984.
	5	Baudouin Le Charlier , Pascal Van Hentenryck, Experimental evaluation of a generic abstract interpretation algorithm for PROLOG, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.1, p.35-101, Jan. 1994 [doi>10.1145/174625.174627]
	6	Charles Consel , Olivier Danvy, Tutorial notes on partial evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.493-501, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158707]
	7	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	8	Patrick Cousot , Rahida Cousot, Abstract interpretation and application to logic programs, Journal of Logic Programming, v.13 n.2-3, p.103-179, July 1992 [doi>10.1016/0743-1066(92)90030-7]
	9	S. Debray, editor. Journal o} Logic Programming, Special Issue: Abstract Interpretation, volume 13(1-2). North-Holland, July 1992.
	10	Saumya K. Debray, Static inference of modes and data dependencies in logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.3, p.418-450, July 1989 [doi>10.1145/65979.65983]
	11	John Gallagher , Maurice Bruynooghe, The derivation of an algorithm for program specialisation, Logic programming, MIT Press, Cambridge, MA, 1990
	12	J. Gallagher , M. Codish , E. Shapiro, Specialisation of Prolog and FCP programs using abstract interpretation, New Generation Computing, v.6 n.2-3, p.159-186, March-April 1988 [doi>10.1007/BF03037136]
	13	F. Giannotti and M. Hermenegildo. A Technique for Recursive Invariance Detection and Selective Program Specialization. In Proc. 3rd. Int'l Symposium on Programming Language Implementation and Logic Programming, pages 323-335. Springer-Verlag, 1991.
	14	Robert Glück , Morten Heine Sørensen, Partial Deduction and Driving are Equivalent, Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming, p.165-181, September 14-16, 1994
	15	M. Hermenegildo and K. Greene. The &-prolog System: Exploiting Independent And-Parallelism. New Generation Computzng, 9(3,4):233-257, 1991.
	16	M. Hermenegildo, K. Marriott, G. Puebla, and P. Stuckey. Incremental Analysis of Logic Programs. In International Conference on Logic Programming. MIT Press, June 1995.
	17	M. Hermenegildo and F. Rossi. Strict and Non- Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 1995. To appear.
	18	M. V. Hermenegildo , R. Warren , S. K. Debray, Global flow analysis as a practical compilation tool, Journal of Logic Programming, v.13 n.4, p.349-366, Aug. 1992 [doi>10.1016/0743-1066(92)90053-6]
	19	Dean Jacobs , Anno Langen , Will Winsborough, Multiple specialization of logic programs with run-time tests, Logic programming, MIT Press, Cambridge, MA, 1990
	20	G. Janssens , M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Journal of Logic Programming, v.13 n.2-3, p.205-258, July 1992 [doi>10.1016/0743-1066(92)90032-X]
	21	Neil D. Jones , Alan Mycroft, Data flow analysis of applicative programs using minimal function graphs, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.296-306, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512672]
	22	Neil D. Jones , Carsten K. Gomard , Peter Sestoft, Partial evaluation and automatic program generation, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	23	Henryk Jan Komorowski, An Introduction to Partial Deduction, Proceedings of the 3rd International Workshop on Meta-Programming in Logic, p.49-69, June 10-12, 1992
	24	J. W. Lloyd , J. C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming, v.11 n.3-4, p.217-242, Oct./Nov. 1991 [doi>10.1016/0743-1066(91)90027-M]
	25	A. Marien, G. Janssens, A. Mulkers, and M. Bruynooghe. The Impact of Abstract Interpretation: an Experiment in Code Generation. In Sixth International Conference on Logic Programming, pages 33-47. MIT Press, June 1989.
	26	K. Marriott and H. Sondergaard. Abstract interpretation, 1989. 1989 SLP Tutorial Notes.
	27	Kim Marriott , Harald Søndergaard , Neil D. Jones, Denotational abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.607-648, May 1994 [doi>10.1145/177492.177650]
	28	Anne Mulkers , William Winsborough , Maurice Bruynooghe, Analysis of shared data structures for compile-time garbage collection in logic programs, Logic programming, MIT Press, Cambridge, MA, 1990
	29	K. Muthukumar and M. Hermenegildo. Deriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs. Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, April 1990.
	30	K. Muthukumar and M. Hermenegildo. Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In 1991 International Conference on Logic Programming, pages 49- 63. MIT Press, June 1991.
	31	K. Muthukumar , M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, Journal of Logic Programming, v.13 n.2-3, p.315-347, July 1992 [doi>10.1016/0743-1066(92)90035-2]
	32	Peter Van Roy , Alvin M. Despain, High-Performance Logic Programming with the Aquarius Prolog Compiler, Computer, v.25 n.1, p.54-68, January 1992 [doi>10.1109/2.108055]
	33	V. Santos-Costa, D.H.D. Warren, and R. Yang. The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model. In l ggl International Conference on Logic Programming~ pages 443-456. MIT Press~ June 1991.
	34	Will Winsborough, Multiple specialization using minimal-function graph semantics, Journal of Logic Programming, v.13 n.2-3, p.259-290, July 1992 [doi>10.1016/0743-1066(92)90033-Y]

CITED BY 5

	Andrew D. Kelly , Kim Marriott , Andrew MacDonald , Peter J. Stuckey , Roland Yap, Optimizing compilation of CLP( R ), ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.6, p.1223-1250, Nov. 1998
	Michael Leuschel , Bern Martens , Danny De Schreye, Controlling generalization and polyvariance in partial deduction of normal logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.208-258, Jan. 1998
	Manuel Hermenegildo , German Puebla , Kim Marriott , Peter J. Stuckey, Incremental analysis of constraint logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.2, p.187-223, March 2000
	Germán Puebla , Manuel Hermenegildo, Abstract specialization and its applications, ACM SIGPLAN Notices, v.38 n.10, p.29-43, October 2003
	Michael Leuschel, A framework for the integration of partial evaluation and abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.3, p.413-463, May 2004