A finite presentation theorem for approximating logic programs
暂无分享,去创建一个
[1] John C. Reynolds,et al. Automatic computation of data set definitions , 1968, IFIP Congress.
[2] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .
[3] Neil D. Jones,et al. Flow analysis and optimization of LISP-like structures , 1979, POPL.
[4] Neil D. Jones,et al. Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[5] Neil D. Jones,et al. Program Flow Analysis: Theory and Application , 1981 .
[6] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[7] Prateek Mishra,et al. Towards a Theory of Types in Prolog , 1984, SLP.
[8] Prateek Mishra,et al. Declaration-free type checking , 1985, POPL.
[9] Gerda Janssens,et al. An Instance of Abstract Interpretation Integrating Type and Mode Inferencing , 1988, ICLP/SLP.
[10] A Type Inference System for Prolog , 1988, ICLP/SLP.
[11] Ehud Shapiro,et al. A Type System for Logic Programs , 1988, J. Log. Program..
[12] Maurice Bruynooghe,et al. A Practical Framework for the Abstract Interpretation of Logic Programs , 1991, J. Log. Program..