Semantic Types for Logic Programs

Interpretation: Towards the Global Optimisation of PROLOG Programs", Proceedings 4 th IEEE Symposium on Logic Programming, pp 192 - 204, September 1987. [2] F. G`ecseg and M. Steinby, "Tree Automata", Akad`emiai Kiad`o, Budapest, 1984. [3] "Elementary Logic Programming Types", draft manuscript, July 1987. [4] N. Heintze and J. Jaffar, "A Finite Presentation Theorem for Approximating Logic Programs", IBM Research Report RC 16089 (#71415), 6 Sept. 90. (An extended abstract appears in Proc. ACM-POPL-90.) [5] N. Heintze and J. Jaffar, "A Decision Procedure for a Class of Set Constraints", forthcoming CMU techical report, February 1991. (An extended abstract appears in Proc. IEEE LICS-90.) [6] T. Kanamori and K. Horiuchi, "Type Inference in PROLOG and its Applications", Proc. 9 th Intl. Joint Conf. on Artificial Intelligence, Vol. 2, pp 704 - 707, 1985. [7] F. Kluzniak, "Type Synthesis for Ground PROLOG", Proceedings 4 th Intl. Conf. on Logic Programming, MIT Press, pp 788 - 816, J..