Inferring precise polymorphic type dependencies in logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Inferring precise polymorphic type dependencies in logic programs

Full text

Pdf (294 KB)

Source

International Conference on Principles and Practice of Declarative Programming archive
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming table of contents

Valencia, Spain

SESSION: Language issues table of contents

Pages 143-151

Year of Publication: 2008

ISBN:978-1-60558-117-0

Author

Lunjin Lu

Oakland University

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references 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/1389449.1389467 What is a DOI?

ABSTRACT

We present a new analysis that infers polymorphic type dependencies in logic programs. The analysis infers more precise information than previous type dependency inference analyses. The improvement in precision is achieved by making use of set union as a type constructor and non-deterministic type definitions.

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	G. Amato and F. Scozzari. On the interaction between sharing and linearity. CoRR, abs/0710.0528, 2007.
	2	Roberto Barbuti , Roberto Giacobazzi, A bottom-up polymorphic type inference in logic programming, Science of Computer Programming, v.19 n.3, p.281-313, Dec. 1992 [doi>10.1016/0167-6423(92)90038-D]
	3	A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19/20:149--197, 1994.
	4	J. Boye and J. Maluszynski. Two aspects of directional types. In Proceedings of the Twelfth International Conference on Logic Programming, pages 747--761. The MIT Press, 1996.
	5	M. Bruynooghe, J. Gallagher, and W. Van Humbeeck. Inference of Well-Typings for Logic Programs with Application to Termination Analysis. In Proceedings of the Twelveth International Symposium on Static Analysis, volume 3672 of Lecture Notes in Computer Science, pages 35--51. Springer, 2005.
	6	M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop. In B. Le Charlier, editor, Proceedings of the First International Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science, pages 281--297. Springer, 1994.
	7	Michael Codish , Vitaly Lagoon, Type dependencies for logic programs using ACI-unification, Theoretical Computer Science, v.238 n.1-2, p.131-159, May 6, 2000 [doi>10.1016/S0304-3975(98)00122-4]
	8	H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 2007.
	9	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]
	10	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]
	11	P.W. Dart and J. Zobel. A regular type language for logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 157--189. The MIT Press, 1992.
	12	J. P. Gallagher , D. A. de Waal, Fast and precise regular approximations of logic programs, Proceedings of the eleventh international conference on Logic programming, p.599-613, August 1994
	13	Manuel V. Hermenegildo , Francisco Bueno , Germán Puebla , Pedro López, Program analysis, debugging, and optimization using the ciao system preprocessor, Proceedings of the 1999 international conference on Logic programming, p.52-66, November 1999, Las Cruces, New Mexico, United States
	14	P. M. Hill and F. Spoto. Generalising Def and Pos to Type Analysis. Journal of Logic and Computation, 12(3):497--542, 2002.
	15	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	16	L. Lu. A polymorphic type analysis in logic programs by abstract interpretation. Journal of Logic Programming, 36(1):1--54, 1998.
	17	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 [doi>10.1017/S1471068407003055]
	18	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]