Type analysis of logic programs in the presence of type definitions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Type analysis of logic programs in the presence of type definitions

Full text

Pdf (1.08 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: 241 - 252

Year of Publication: 1995

ISBN:0-89791-720-0

Author

Lunjin Lu

School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, U.K.

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 5, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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.215597 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	H. Azzoune, Type Inference in Prolog, Proceedings of the 9th International Conference on Automated Deduction, p.258-277, May 23-26, 1988
	2	M. Bruynooghe. Adding redundancy to obtain more l eliable and more readable Prolog programs. In Proceed~ngs of the first Internatzonal Logzc Programming Conference, pages 129-133, Marseille, France, 1982.
	3	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]
	4	M. Bruynooghe, G. Janssens, A. Callebaut, alld }3. Dcmoen. Abstract interpretation: towaMs the glol)al oplimisation of Prolog programs. In Pro( ecd, tTgs of the l :)87 Symposium on Logic Programt,t~tg, pages 192-204. Tl,e IEEE Society Press, 1987.
	5	Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
	6	M. Codish, D. Dams, and Yardeni E. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis. In K. Furukawa, editor, Proceedings of the Eighth International Confere.nce on Logic Programming, pages 79-93, Paris, France, 1991. The MIT Press.
	7	Michael Codish , Dennis Dams , Gilberto Filé , Maurice Bruynooghe, Freeness analysis for logic programs—and correctness?, Proceedings of the tenth international conference on logic programming on Logic programming, p.116-131, August 1993, Budapest, Hungary
	8	M. Codish , A. Mulkers , M. Bruynooghe , M. García de la Banda , M. Hermenegildo, Improving abstract interpretations by combining domains, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.194-205, June 14-16, 1993, Copenhagen, Denmark [doi>10.1145/154630.154650]
	9	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]
	10	P.W. Dart and J. Zobel. A regular type language for logic programs. In Frank Pfel~ning, editor, Types in Log'~c Programming. MIT Press, Cambridge,Massachusetts, 1992. ISBN 0-262-16131-1.
	11	T.W. Friiehwirth. Using meta-interpreters for polymorphic type checking. In M. Bruynooghe, editor, Proceed- ,rigs of the Second Workshop on Meta-programmin9 ~n Logic, pages 339-351, Leaven, Belgium, April ,t-6 1990.
	12	Nevin Heintze , Joxan Jaffar, A finite presentation theorem for approximating logic programs, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.197-209, December 1989, San Francisco, California, United States [doi>10.1145/96709.96729]
	13	N. Heintze and J. Jaffar. Semantic t yl)es tot logic programs. In Frank Pfenning, editor, Types ,n Logic Programming. MIT Press, Cambridge,Massachusetts. 1992. ISBN 0-262-16131-1.
	14	K. Horiuchi , T. Kanamori, Polymorphic type inference in Prolog by abstract interpretation, Proceedings of the 6th Conference on Logic programming '87, p.195-214, July 1988, Tokyo, Japan
	15	Dean Jacobs , Anno Langen, Static analysis of logic programs for independent and parallelism, Journal of Logic Programming, v.13 n.2-3, p.291-314, July 1992 [doi>10.1016/0743-1066(92)90034-Z]
	16	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]
	17	N.D. Jones and tt. S0ndergarrd. A semantics-based fia~nework for abstract interpretation of Prolog. In S. Abramsky a~td C. tIankin, editors, Abstract interpretatzon of declarative languages, pages 123-142. Ellis Horwood Limited, 1987.
	18	Tadashi Kanamori, Abstract interpretation based on Alexander templates, Journal of Logic Programming, v.15 n.1-2, p.31-54, Jan. 1993 [doi>10.1016/0743-1066(93)90012-6]
	19	T. Kanamori aim K. Horiuchi. Type inference in Prolog and its application. In Proceedings of the ninth International Joint Conference on Artificial Intelligence, pages 70,1-707, 1985.
	20	Tadashi Kanamori , Tadashi Kawamura, Abstract interpretation based on OLDT resolution, Journal of Logic Programming, v.15 n.1-2, p.1-30, Jan. 1993 [doi>10.1016/0743-1066(93)90011-5]
	21	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	22	L. Lu. Abstract interpretation, bug detection and bug diagnosis in normal logic programs. PhD thesis, University of Birlningham, 1994.
	23	Kim Marriott , Harald Søndergaard, Bottom-up dataflow analysis of normal logic programs, Journal of Logic Programming, v.13 n.2-3, p.181-204, July 1992 [doi>10.1016/0743-1066(92)90031-W]
	24	C. ~Icllish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract interpretat~on of declarative languages, pages 181-198. Ellis Ilorwood Li~nited, 1987.
	25	P. Mish~a. Towards a theory of types in Prolog. In Proceedi~,gs of the IEEE international Symposium on Logtc Programming, pages 289-298. IEEE, 1984.
	26	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]
	27	Alan Mycroft , Richard A. O'Keefe, A polymorphic type system for PROLOG., Artificial Intelligence, v.23 n.3, p.295-307, August 1984 [doi>10.1016/0004-3702(84)90017-1]
	28	Ulf Nilsson, Towards a Framework for the Abstract Interpretation of Logic Programs, Proceedings of the 1st International Workshop on Programming Language Implementation and Logic Programming, p.68-82, May 16-18, 1988
	29	T. Sato and H. Tamaki. Enumeration of success patterns in logic programs. Theoretical Computer Science, 34(1)'227-240, 1984.
	30	Jerzy Tiuryn, Type inference problems: a survey, Proceedings on Mathematical foundations of computer science 1990, p.105-120, September 1990, Banska´ Bystrica, Czechoslovakia
	31	M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
	32	J. Xu and D.S. Warren. A type inferellce systcln foi Prolog. In R.A. Kowalski altd K.A. Bowea, editors, Proceedings of the fifth Inter~zat,ol~al Co,ference cttzd Symposium on Logic Programmzng, pages 604-619. Tile MIT Press, 1988.
	33	Eyal Yardeni , Ehud Shapiro, A type system for logic program, Journal of Logic Programming, v.10 n.2, p.125-153, Feb. 1991 [doi>10.1016/0743-1066(91)80002-U]
	34	J. Zobel. Derivation of polymorphic types for Prolog programs. In J.-L. Lassez, editor, Logic Programruing: Proceedings of the fourth inte.rnatzo~al conference, pages 817-838, Australia, 1987.

CITED BY 4

	Lunjin Lu, On Dart-Zobel Algorithm for testing regular type inclusion, ACM SIGPLAN Notices, v.36 n.9, September 2001
	Pawel S. Pietrzak , Jesús Correas Fernández , Germán Puebla , Manuel V. Hermenegildo, A practical type analysis for verification of modular prolog programs, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 07-08, 2008, San Francisco, California, USA
	Lunjin Lu, A precise type analysis of logic programs, Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.214-225, September 20-23, 2000, Montreal, Quebec, Canada
	Lunjin Lu, Improving precision of type analysis using non-discriminative union, Theory and Practice of Logic Programming, v.8 n.1, p.33-79, January 2008