J. Barbosa, M. Florido & V. Santos Costa (2017):
Closed Types for Logic Programming.
In: 25th Int. Workshop on Functional and Logic Programming (WFLP 2017).
Roberto Barbuti & Roberto Giacobazzi (1992):
A Bottom-Up Polymorphic Type Inference in Logic Programming.
Sci. Comput. Program. 19(3),
pp. 281–313,
doi:10.1016/0167-6423(92)90038-D.
Jc Beall (2016):
Off-Topic: A New Interpretation of Weak-Kleene Logic.
The Australasian Journal of Logic 13(6),
doi:10.26686/ajl.v13i6.3976.
D.A. Bochvar & Merrie Bergmann (1981):
On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus.
History and Philosophy of Logic 2(1-2),
pp. 87–112,
doi:10.1080/01445348108837023.
Maurice Bruynooghe & Gerda Janssens (1988):
An Instance of Abstract Interpretation Integrating Type and Mode Inferencing.
In: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes),
pp. 669–683.
Philip W. Dart & Justin Zobel (1992):
A Regular Type Language for Logic Programs.
In: Types in Logic Programming,
pp. 157–187.
Maarten H. van Emden & Robert A. Kowalski (1976):
The Semantics of Predicate Logic as a Programming Language.
J. ACM 23(4),
pp. 733–742,
doi:10.1145/321978.321991.
Mário Florido & Luís Damas (1992):
Types as Theories.
In: Proc. of post-conference workshop on Proofs and Types, Joint International Conference and Symposium on Logic Programming.
Thom W. Frühwirth, Ehud Shapiro, Moshe Y. Vardi & Eyal Yardeni (1991):
Logic Programs as Types for Logic Programs.
In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), Amsterdam, The Netherlands, July 15-18, 1991,
pp. 300–309,
doi:10.1109/LICS.1991.151654.
John P. Gallagher & D. Andre de Waal (1994):
Fast and Precise Regular Approximations of Logic Programs.
In: Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Marherita Ligure, Italy, June 13-18, 1994,
pp. 599–613.
Michael Hanus (2013):
Functional Logic Programming: From Theory to Curry.
In: Programming Logics - Essays in Memory of Harald Ganzinger,
pp. 123–168,
doi:10.1007/978-3-642-37651-1_6.
Fritz Henglein (1993):
Type Inference with Polymorphic Recursion.
ACM Trans. Program. Lang. Syst. 15(2),
pp. 253–289,
doi:10.1145/169701.169692.
Manuel V. Hermenegildo, Francisco Bueno, Manuel Carro, Pedro López-García, Edison Mera, José F. Morales & Germán Puebla (2012):
An overview of Ciao and its design philosophy.
TPLP 12(1-2),
pp. 219–252,
doi:10.1017/S1471068411000457.
Patricia M. Hill & John W. Lloyd (1994):
The Gödel programming language.
MIT Press.
A. J. Kfoury, Jerzy Tiuryn & Pawel Urzyczyn (1993):
Type Reconstruction in the Presence of Polymorphic Recursion.
ACM Trans. Program. Lang. Syst. 15(2),
pp. 290–311,
doi:10.1145/169701.169687.
S. C. Kleene (1952):
Introduction to Metamathematics.
Stephen Cole Kleene (1938):
On Notation for Ordinal Numbers.
J. Symb. Log. 3(4),
pp. 150–155,
doi:10.2307/2267778.
T. L. Lakshman & Uday S. Reddy (1991):
Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Keefe Type System.
In: Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28 - Nov 1, 1991,
pp. 202–217.
Robin Milner (1978):
A Theory of Type Polymorphism in Programming.
J. Comput. Syst. Sci. 17(3),
pp. 348–375,
doi:10.1016/0022-0000(78)90014-4.
Alan Mycroft & Richard A. O'Keefe (1984):
A Polymorphic Type System for Prolog.
Artif. Intell. 23(3),
pp. 295–307,
doi:10.1016/0004-3702(84)90017-1.
Lee Naish (1992):
Types and the Intended Meaning of Logic Programs.
In: Types in Logic Programming,
pp. 189–216.
Lee Naish (2006):
A three-valued semantics for logic programmers.
TPLP 6(5),
pp. 509–538,
doi:10.1017/S1471068406002742.
Luís Moniz Pereira (1986):
Rational Debugging in Logic Programming.
In: Proceedings of the Third International Conference on Logic Programming.
Springer-Verlag,
London, UK, UK,
pp. 203–210,
doi:10.1007/3-540-16492-8_76.
Changwoo Pyo & Uday S. Reddy (1989):
Inference of Polymorphic Types for Logic Programs.
In: Logic Programming, Proceedings of the North American Conference 1989, Cleveland, Ohio, USA, October 16-20, 1989. 2 Volumes,
pp. 1115–1132.
Peter Van Roy (1990):
Can Logic Programming Execute as Fast as Imperative Programming?.
University of California at Berkeley.
Hüseyin Saglam & John P. Gallagher (1995):
Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions.
In: Programming Languages: Implementations, Logics and Programs, 7th International Symposium, PLILP'95, Utrecht, The Netherlands, September 20-22, 1995, Proceedings,
pp. 461–462,
doi:10.1007/BFb0026840.
Tom Schrijvers, Vítor Santos Costa, Jan Wielemaker & Bart Demoen (2008):
Towards Typed Prolog.
In: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings,
pp. 693–697,
doi:10.1007/978-3-540-89982-2_59.
Zoltan Somogyi, Fergus Henderson & Thomas C. Conway (1996):
The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language.
J. Log. Program. 29(1-3),
pp. 17–64,
doi:10.1016/S0743-1066(96)00068-4.
Claudio Vaucheret & Francisco Bueno (2002):
More Precise Yet Efficient Type Inference for Logic Programs.
In: Proceedings of the 9th International Symposium on Static Analysis,
SAS '02.
Springer-Verlag,
Berlin, Heidelberg,
pp. 102–116.
Eyal Yardeni, Thom W. Frühwirth & Ehud Shapiro (1992):
Polymorphically Typed Logic Programs.
In: Types in Logic Programming,
pp. 63–90.
Justin Zobel (1987):
Derivation of Polymorphic Types for PROLOG Programs.
In: Logic Programming, Proceedings of the Fourth International Conference, Melbourne, Victoria, Australia, May 25-29, 1987 (2 Volumes),
pp. 817–838.
eptcs@eptcs.org