On Dart-Zobel algorithm for testing regular type inclusion

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 9, 2001, Pages 81-85

  Lu, Lunjin ^a  

^a OAKLAND UNIVERSITY   (United States)

Author keywords

Algorithm; Regular types; Type inclusion

Indexed keywords

EID: 17244374284     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/609769.609782     Document Type: Article

References (20)

1. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. ACM computing surveys, 17(4):471-522, 1985.
2. M. Codish and V. Lagoon. Type dependencies for logic programs using ACI-unification. In Proceedings of the 1996 Israeli Symposium on Theory of Computing and Systems, pages 136-145. IEEE Press, June 1996.
3. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Draft, 1998.
4. P.W. Dart and J. Zobel. Efficient run-time type checking of typed logic programs. Journal of Logic Programming, 14(1-2):31-69, 1992.
5. 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.
6. S. K. Debray, P. López-Garcia, and M. Hermenegildo. Non-failure analysis for logic programs. In Lee Naish, editor, Logic programming: Proceedings of the fourteenth International Conference on Logic Programming, pages 48-62. The MIT Press, July 1997.
7. T. Fruhwirth, E. Shapiro, M.Y. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, pages 300-309. The IEEE Computer Society Press, 1991.
8. J.P. Gallagher and D.A. de Waal. Fast and precise regular approximations of logic programs. In M. Bruynooghe, editor, Proceedings of the Eleventh International Conference on Logic Programming, pages 599-613. The MIT Press, 1994.
9. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, 1984.
10. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Proceedings of the seventh Annual ACM Symposium on Principles of Programming Languages, pages 197-209. The ACM Press, 1990.
11. N. Heintze and J. Jaffar. Semantic types for logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 141-155. The MIT Press, 1992.
12. D. Jacobs. Type declarations as subtype constraints in logic programming. SIGPLAN Notices, 25(6):165-73, 1990.
13. L. Lu. Type analysis of logic programs in the presence of type definitions. In Proceedings of the 1995 AGM SIGPLAN Symposium on Partial Evaluation and Semantics-Based program manipulation, pages 241-252. The ACM Press, 1995.
14. L. Lu. A polymorphic type analysis in logic programs by abstract interpretation. Journal of Logic Programming, 36(1):1-54, 1998.
15. P. Mishra. Towards a theory of types in Prolog. In Proceedings of the IEEE international Symposium on Logic Programming, pages 289-298. The IEEE Computer Society Press, 1984.
16. U.S. Reddy. Types for logic programs. In Proceedings of the 1990 North American Conference on Logic Programming, pages 836-40. The MIT Press, 1990.
17. M. Soloman. Type definitions with parameters. In Conference Record of the Fifth ACM Symposium on Principles of Programming Languages, pages 31-38, 1978.
18. E. Yardeni, T. Fruehwirth, and E. Shapiro. Polymorphically typed logic programs. In K. Furukawa, editor, Logic Programming. Proceedings of the Eighth International Conference, pages 379-93. The MIT Press, 1991.
19. E. Yardeni and E. Shapiro. A type system for logic programs. Journal of Logic Programming, 10(2):125-153, 1991.
20. J. Zobel. Derivation of polymorphic types for Prolog programs. In J.-L. Lassez, editor, Logic Programming: Proceedings of the fourth international conference, pages 817-838. The MIT Press, 1987.