Backward Type Inference Generalises Type Checking
关键词:
摘要: This paper presents a backward type analysis for logic programs. Given signatures collection of selected predicates such as builtin or library predicates, the infers other that execution any query satisfying inferred will not violate predicates. Thus, generalises checking in which programmer manually specifies all are checked consistency by checker.
springer.com
core.ac.uk
kent.ac.uk
oakland.edu 
sci-hub.st 参考文章(23)
Tadashi Kanamori, Kenji Horiuchi, Type inference in prolog and its application international joint conference on artificial intelligence. pp. 704- 707 ,(1985)
J. W. Lloyd, Foundations of logic programming; (2nd extended ed.) Springer-Verlag New York, Inc.. ,(1987)
Justin Zobel, Philip W. Dart, A Regular Type Language for Logic Programs. Types in Logic Programming. pp. 157- 187 ,(1992)
Prateek Mishra, Towards a Theory of Types in Prolog. SLP. pp. 289- 298 ,(1984)
Joxan Jaffar, Nevin Heintze, Semantic Types for Logic Programs. Types in Logic Programming. pp. 141- 155 ,(1992)
Michael Codish, Bart Demoen, Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop static analysis symposium. pp. 281- 296 ,(1994) , 10.1007/3-540-58485-4_47
D. A. de Waal, J. P. Gallagher, Fast and precise regular approximations of logic programs international conference on logic programming. pp. 599- 613 ,(1994)
John Wylie Lloyd, Foundations of logic programming ,(1984)
Kenji Horiuchi, Tadashi Kanamori, Polymorphic type inference in Prolog by abstract interpretation conference on logic programming. pp. 195- 214 ,(1988) , 10.1007/3-540-19426-6_13
Dino Pedreschi, Salvatore Ruggieri, Weakest preconditions for pure Prolog programs Information Processing Letters. ,vol. 67, pp. 145- 150 ,(1998) , 10.1016/S0020-0190(98)00098-2