A polymorphic type system for PROLOG.
作者： Alan Mycroft , Richard A. O'Keefe
DOI: 10.1016/0004-3702(84)90017-1
关键词:
摘要: Abstract We describe a polymorphic type scheme for Prolog which makes static checking possible. Polymorphism gives good degree of flexibility to the system, and it intrude very little on user's programming style. The only additions language are declarations, an interpreter can ignore if so desires, with guarantee that well-typed program will behave identically or without checking. Our implementation is discussed we observe resolution problem another (meta)program.
acm.org
elsevier.com
sci-hub.se 参考文章(5)
Prateek Mishra, Towards a Theory of Types in Prolog. SLP. pp. 289- 298 ,(1984)
M. Gordon, R. Milner, L. Morris, M. Newey, C. Wadsworth, A Metalanguage for interactive proof in LCF Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78. pp. 119- 130 ,(1978) , 10.1145/512760.512773
Krzysztof R. Apt, M. H. van Emden, Contributions to the Theory of Logic Programming Journal of the ACM. ,vol. 29, pp. 841- 862 ,(1982) , 10.1145/322326.322339
Robin Milner, A theory of type polymorphism in programming Journal of Computer and System Sciences. ,vol. 17, pp. 348- 375 ,(1978) , 10.1016/0022-0000(78)90014-4
Alan Mycroft, Richard A. O'Keefe, A Polymorphic Type System for Prolog. Logic Programming Workshop. pp. 107- 122 ,(1983)