Reciprocal Influences Between Proof Theory and Logic Programming
暂无分享,去创建一个
[1] Dale Miller. An Overview of Linear Logic Programming , 2003 .
[2] Dale Miller. Encryption as an abstract data-type: An extended abstract , 2003 .
[3] Alessio Guglielmi,et al. On Structuring Proof Search for First Order Linear Logic , 2003, LPAR.
[4] François Fages,et al. Concurrent Constraint Programming and Non-commutative Logic , 1997, CSL.
[5] Jean-Marc Andreoli,et al. Linear objects: Logical processes with built-in inheritance , 1990, New Generation Computing.
[6] Dale A. Miller. A compact representation of proofs , 1987, Stud Logica.
[7] Gopalan Nadathur,et al. System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog , 1999, CADE.
[8] Akinori Yonezawa,et al. Asynchronous communication model based on linear logic , 2005, Formal Aspects of Computing.
[9] JEAN-MARC ANDREOLI,et al. Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..
[10] Gordon D. Plotkin,et al. A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..
[11] Gopalan Nadathur,et al. An Overview of Lambda-PROLOG , 1988, ICLP/SLP.
[12] Max I. Kanovich,et al. Petri Nets, Horn Programs, Linear Logic and Vector Games , 1995, Ann. Pure Appl. Log..
[13] Chuck Liang,et al. Focusing and polarization in linear, intuitionistic, and classical logics , 2009, Theor. Comput. Sci..
[14] A. Tarski. MATHEMATICSContributions to the Theory of Models. I , 1954 .
[15] Dov M. Gabbay,et al. N-Prolog: An Extension of Prolog with Hypothetical Implications I , 1984, J. Log. Program..
[16] Philip Wadler,et al. Linear Types can Change the World! , 1990, Programming Concepts and Methods.
[17] Neil Immerman,et al. On the Unusual Effectiveness of Logic in Computer Science , 2001, Bulletin of Symbolic Logic.
[18] Kurt Gödel,et al. On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .
[19] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.
[20] C.-H. Luke Ong,et al. A Curry-Howard foundation for functional computation with control , 1997, POPL '97.
[21] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[22] M. Sørensen,et al. Lectures on the Curry-Howard Isomorphism , 2013 .
[23] Dale Miller. Encryption as an abstract data type , 2003, Electron. Notes Theor. Comput. Sci..
[24] Davide Sangiorgi,et al. Communicating and Mobile Systems: the π-calculus, , 2000 .
[25] D. Walker,et al. A Calculus of Mobile Processes, Part I , 1989 .
[26] Dale Miller,et al. Forum: A Multiple-Conclusion Specification Logic , 1996, Theor. Comput. Sci..
[27] de Ng Dick Bruijn,et al. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[28] Dale Miller,et al. Abstractions in Logic Programs , 1989 .
[29] Remo Pareschi,et al. Type-driven natural language analysis , 1988 .
[30] Claudio Sacerdoti Coen,et al. ELPI: Fast, Embeddable, λProlog Interpreter , 2015, LPAR.
[31] Dale Miller,et al. A Theory of Modules for Logic Programming , 1986, SLP.
[32] Dale Miller,et al. A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..
[33] Philippe Roussel,et al. The birth of Prolog , 1993, HOPL-II.
[34] Hendrik Pieter Barendregt,et al. The Impact of the Lambda Calculus in Logic and Computer Science , 1997, Bulletin of Symbolic Logic.
[35] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[36] A. Tarski. Contributions to the theory of models. III , 1954 .
[37] Per Martin-Löf,et al. Constructive mathematics and computer programming , 1984 .
[38] L. Thorne McCarty,et al. Clausal Intuitionistic Logic I - Fixed-Point Semantics , 1988, J. Log. Program..
[39] Michael Kifer,et al. HILOG: A Foundation for Higher-Order Logic Programming , 1993, J. Log. Program..
[40] Law Fw. FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .
[41] Gopalan Nadathur,et al. System description : Teyjus : A compiler and abstract machine based implementation of λprolog , 1999 .
[42] Gérard P. Huet,et al. A Mechanization of Type Theory , 1973, IJCAI.
[43] Cordell Green. Theorem-Proving by Resolution as a Basis for Question-Answering Systems , 2010 .
[44] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .
[45] D.M. Gabbay,et al. N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure , 1985, J. Log. Program..
[46] Peter B. Andrews. Resolution in type theory , 1971, Journal of Symbolic Logic.
[47] Dale Miller. Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract , 2004, CSL.
[48] G. Gentzen. New version of the consistency proof for elementary number theory , 1969 .
[49] Tanel Tammet,et al. A Resolution Theorem Prover for Intuitonistic Logic , 1996, CADE.
[50] Gerard P. Hubt. A mechanization of type theory , 1973, IJCAI 1973.
[51] G. Nadathur. A higher-order logic as the basis for logic programming , 1987 .
[52] Gopalan Nadathur,et al. Hereditary Harrop Formulas and Uniform Proof Systems , 1987, Logic in Computer Science.
[53] Gordon D. Plotkin,et al. The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..
[54] F. S.,et al. A Mathematician's Apology , 1941, Nature.
[55] A. Church. The calculi of lambda-conversion , 1941 .
[56] James Harland,et al. The Uniform Proof-Theoretic Foundation of Linear Logic Programming , 1991, ISLP.
[57] L. Thorne McCarty,et al. Clausal Intuitionistic Logic II - Tableau Proof Procedures , 1988, J. Log. Program..
[58] Lawrence C. Paulson,et al. The foundation of a generic theorem prover , 1989, Journal of Automated Reasoning.
[59] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[60] Dale Miller,et al. A multiple-conclusion meta-logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[61] Alonzo Church,et al. The Calculi of Lambda Conversion. (Am-6), Volume 6 , 1985 .
[62] Lars Hallnäs,et al. A Proof-Theoretic Approach to Logic Programming. II. Programs as Definitions , 1991, J. Log. Comput..
[63] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[64] Akinori Yonezawa,et al. ACL - A Concurrent Linear Logic Programming Paradigm , 1993, ILPS.
[65] Dale Miller,et al. Mechanized Metatheory Revisited , 2018, Journal of Automated Reasoning.
[66] Dale Miller,et al. A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..
[67] Jean-Marc Andreoli,et al. Communication as Fair Distribution of Knowledge , 1991, OOPSLA.
[68] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[69] Frank Pfenning,et al. A linear logical framework , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[70] J. S. Hodas. Logic programming in intuitionistic linear logic: theory, design, and implementation , 1995 .
[71] Alwen Tiu,et al. Programming in Higher-Order Logic , 2009 .
[72] Melvin Fitting,et al. Resolution for Intuitionistic Logic , 1987, ISMIS.
[73] Dale Miller. The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.
[74] Gerhard Gentzen,et al. Investigations into Logical Deduction , 1970 .
[75] F. W. Lawvere,et al. FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.
[76] Jack Minker,et al. Disjunctive Logic Programming: A Survey and Assessment , 2002, Computational Logic: Logic Programming and Beyond.
[77] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[78] Nicolas Beldiceanu,et al. Constraint Logic Programming , 1997 .
[79] Michael Goldsmith,et al. Programming in occam 2 , 1985, Prentice Hall international series in computer science.
[80] Dale Miller,et al. Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..
[81] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[82] G. Gentzen. Untersuchungen über das logische Schließen. I , 1935 .
[83] Hassan Aït-Kaci,et al. Warren's Abstract Machine: A Tutorial Reconstruction , 1991 .
[84] Ozan Kahramanogullari,et al. Nondeterminism and Language Design in Deep Inference: A Proof Theoretic Approach to Logic Programming , 2012 .
[85] S. Kleene. A Theory of Positive Integers in Formal Logic. Part II , 1935 .
[86] Jean-Yves Girard,et al. A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.
[87] Claudio Sacerdoti Coen,et al. ELPI: Fast, Embeddable, \lambda Prolog Interpreter , 2015, LPAR.
[88] ROBIN MILNER,et al. Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .
[89] Jorge Lobo,et al. Foundations of disjunctive logic programming , 1992, Logic Programming.
[90] Thierry Coquand,et al. The Calculus of Constructions , 1988, Inf. Comput..
[91] Vijay Saraswat Xerox. Higher-order , linear , concurrent constraint programming , 1992 .
[92] Max I. Kanovich,et al. The Complexity of Horn Fragments of Linear Logic , 1994, Ann. Pure Appl. Log..
[93] Dale A. Miller,et al. AN OVERVIEW OF PROLOG , 1988 .
[94] F. Fages,et al. Phase semantics and verification of concurrent constraint programs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[95] Robin Milner,et al. Definition of standard ML , 1990 .
[96] Dale Miller,et al. Representing Objects in a Logic Programming Langueage with Scoping Constructs , 1990, ICLP.
[97] E. Allen Emerson,et al. The Beginning of Model Checking: A Personal Perspective , 2008, 25 Years of Model Checking.
[98] Furio Honsell,et al. A framework for defining logics , 1993, JACM.
[99] Geoffrey K. Pullum,et al. Generalized Phrase Structure Grammar , 1985 .
[100] A. Church. The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies) , 1985 .
[101] W. V. Quine,et al. Natural deduction , 2021, An Introduction to Proof Theory.
[102] Raheel Ahmad,et al. The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..
[103] Dale Miller,et al. Extending Definite Clause Grammars with Scoping Constructs , 1990, ICLP.
[104] Glynn Winskel,et al. Petri Nets as Models of Linear Logic , 1990, CAAP.
[105] Michael Winikoff,et al. Programming in Lygon: An Overview , 1996, AMAST.
[106] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[107] Dale Miller,et al. Unification Under a Mixed Prefix , 1992, J. Symb. Comput..
[108] Robert A. Kowalski,et al. Linear Resolution with Selection Function , 1971, Artif. Intell..
[109] Davide Sangiorgi,et al. The Pi-Calculus - a theory of mobile processes , 2001 .
[110] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.
[111] Patrick Lincoln,et al. Linear logic , 1992, SIGA.
[112] M. E. Szabo,et al. The collected papers of Gerhard Gentzen , 1969 .
[113] Frank Pfenning,et al. System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.
[114] Gopalan Nadathur,et al. Scoping Constructs in Logic Programming: Implementation Problems and their Solutions , 1995, J. Log. Program..
[115] Gopalan Nadathur,et al. Higher-order Horn clauses , 1990, JACM.
[116] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .
[117] Evelina Lamma,et al. Modularity in Logic Programming , 1994, J. Log. Program..
[118] James Harland,et al. A Uniform Proof-Theoretic Investigation of Linear Logic Programming , 1994, J. Log. Comput..