Specification=program+types
作者： Lee Naish
关键词: Programming language 、 Logic program 、 Computer science 、 Type (model theory) 、 Type scheme 、 Logic programming
摘要: It has been claimed that logic programs are equivalent to or consequences of specifications. We argue this is generally not correct. Programs often make implicit assumptions about types, leading the possibility incorrect answers. If made explicit, so program specification, less efficient. define when with type declarations correct and show all well typed answers returned by such
springer.com
springerlink.com参考文章(16)
Taisuke Sato, Hisao Tamaki, Unfold/fold Transformation of Logic Programs international conference on lightning protection. pp. 127- 138 ,(1984)
Sharon Sickel, Keith L. Clark, Predicate Logic: A Calculus for the Formal Derivation of Programs. international joint conference on artificial intelligence. pp. 419- 420 ,(1977)
Justin Zobel, Derivation of Polymorphic Types for PROLOG Programs. international conference on lightning protection. pp. 817- 838 ,(1987)
Prateek Mishra, Towards a Theory of Types in Prolog. SLP. pp. 289- 298 ,(1984)
Michael J Maher, Equivalences of logic programs international conference on logic programming. pp. 410- 424 ,(1986) , 10.1007/3-540-16492-8_91
John Wylie Lloyd, Foundations of logic programming ,(1984)
Lee Naish, Negations and quantifiers in NU-Prolog international conference on logic programming. pp. 624- 634 ,(1986) , 10.1007/3-540-16492-8_111
J.W. Lloyd, R.W. Topor, Making prolog more expressive Journal of Logic Programming. ,vol. 1, pp. 225- 240 ,(1984) , 10.1016/0743-1066(84)90011-6
Luca Cardelli, Peter Wegner, On understanding types, data abstraction, and polymorphism ACM Computing Surveys. ,vol. 17, pp. 471- 523 ,(1985) , 10.1145/6041.6042
C. J. Hogger, Derivation of Logic Programs Journal of the ACM. ,vol. 28, pp. 372- 392 ,(1981) , 10.1145/322248.322258