Collection analysis for Horn clause programs
暂无分享,去创建一个
[1] Olivier Ridoux,et al. Naïve Reverse Can be Linear , 1991, ICLP.
[2] Akinori Yonezawa,et al. Asynchronous communication model based on linear logic , 2005, Formal Aspects of Computing.
[3] JEAN-MARC ANDREOLI,et al. Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..
[4] Dale Miller,et al. Forum: A Multiple-Conclusion Specification Logic , 1996, Theor. Comput. Sci..
[5] Akinori Yonezawa,et al. Asynchronous Communication Model Based on Linear Logic , 1992, Parallel Symbolic Computing.
[6] Jean-Yves Girard,et al. Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.
[7] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[8] Dale Miller,et al. Higher-Order Quantification and Proof Search , 2002, AMAST.
[9] Dale Miller,et al. Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..
[10] John C. Mitchell,et al. A meta-notation for protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.
[11] Dale Miller. The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.
[12] Dale Miller. Encryption as an abstract data-type: An extended abstract , 2003 .
[13] Peter Schroeder-Heister,et al. Rules of definitional reflection , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[14] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[15] Dale A. Miller,et al. AN OVERVIEW OF PROLOG , 1988 .
[16] Dale Miller,et al. Cut-elimination for a logic with definitions and induction , 2000, Theor. Comput. Sci..
[17] Alexander Aiken,et al. Set Constraints: Results, Applications, and Future Directions , 1994, PPCP.
[18] Manuel V. Hermenegildo,et al. Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) , 2005, Sci. Comput. Program..
[19] Andreas Podelski,et al. Set Constraints: A Pearl in Research on Constraints , 1997, CP.
[20] Gopalan Nadathur,et al. The Type System of a Higher-Order Logic Programming Language , 1992, Types in Logic Programming.
[21] Dale Miller. Encryption as an abstract data type , 2003, Electron. Notes Theor. Comput. Sci..
[22] J. Girard,et al. Proofs and types , 1989 .
[23] Patrick Lincoln,et al. Linear logic , 1992, SIGA.
[24] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[25] Gert Smolka. Principles and Practice of Constraint Programming-CP97 , 1997, Lecture Notes in Computer Science.
[26] V HermenegildoManuel,et al. Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) , 2005 .
[27] Frank Pfenning,et al. A Linear Logical Framework , 2002, Inf. Comput..
[28] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.