A mechanization of sorted higher-order logic based on the resolution principle
暂无分享,去创建一个
[1] Frank Pfenning,et al. Intersection Types for a Logical Framework , 1992 .
[2] Per Martin-Löf,et al. Intuitionistic type theory , 1984, Studies in proof theory.
[3] Hao Wang,et al. Logic of many-sorted theories , 1952, Journal of Symbolic Logic.
[4] Rance Cleaveland,et al. Implementing mathematics with the Nuprl proof development system , 1986 .
[5] Anthony G. Cohn,et al. An Abstract View of Sorted Unification , 1992, CADE.
[6] Deepak Kapur,et al. First-Order Theorem Proving Using Conditional Rewrite Rules , 1988, CADE.
[7] A. Schmidt. Die Zulässigkeit der Behandlung mehrsortiger Theorien mittels der üblichen einsortigen Prädikatenlogik , 1951 .
[8] K. Gödel. Die Vollständigkeit der Axiome des logischen Funktionenkalküls , 1930 .
[9] Michael Kohlhase,et al. Unification in Order-Sorted Type Theory , 1992, LPAR.
[10] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[11] Peter H. Schmitt,et al. An Order-Sorted Logic for Knowledge Representation Systems , 1992, Artif. Intell..
[12] Régis Curien. Second Order E-Matching as a Tool for Automated Theorem Proving , 1993, EPIA.
[13] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[14] Paul Bernays,et al. A System of Axiomatic Set Theory , 1976 .
[15] Christoph Walther,et al. Many-sorted unification , 1988, JACM.
[16] Zhenyu Qian,et al. Extensions of order-sorted algebraic specifications: parameterization, higher-order functions and polymorphism , 1991 .
[17] Gaisi Takeuti,et al. On a generalized logic calculus , 1953 .
[18] A. Fraenkel,et al. Zusatz zu vorstehendem Aufsatz Herrn v. Neumanns , 1928 .
[19] K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .
[20] B. Pierce. Programming with intersection types and bounded polymorphism , 1992 .
[21] A. Schmidt. Über deduktive Theorien mit mehreren Sorten von Grunddingen , 1938 .
[22] Kim B. Bruce,et al. A Modest Model of Records, Inheritance and Bounded Quantification , 1990, Inf. Comput..
[23] Christoph Walther,et al. Unification in Many-Sorted Theories , 1984, ECAI.
[24] M. Gordon. HOL : A machine oriented formulation of higher order logic , 1985 .
[25] Alan M. Frisch. The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning , 1991, Artif. Intell..
[26] Patricia Johann,et al. Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading , 1994, CADE.
[27] Jörg H. Siekmann,et al. The Markgraf Karl Refutation Procedure , 1980, IJCAI.
[28] David A. Wolfram,et al. The Clausal Theory of Types , 1993 .
[29] C.-J. Seger. On the Existence of Speed-Independent Circuits , 1991, Theor. Comput. Sci..
[30] Jacques Herbrand. Recherches sur la théorie de la démonstration , 1930 .
[31] Dale Miller,et al. A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..
[32] Gordon D. Plotkin,et al. Logical frameworks , 1991 .
[33] William M. Farmer,et al. Theory Interpretation in Simple Type Theory , 1993, HOA.
[34] Warren D. Goldfarb,et al. The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..
[35] William W. Tait,et al. Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.
[36] Arnold Oberschelp. Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .
[37] F. Dick. A survey of the project Automath , 1980 .
[38] B. Russell. Mathematical Logic as Based on the Theory of Types , 1908 .
[39] F. Pfenning. Logic programming in the LF logical framework , 1991 .
[40] J. Neumann,et al. Die Axiomatisierung der Mengenlehre , 1928 .
[41] William C. Frederick,et al. A Combinatory Logic , 1995 .
[42] Michael Kohlhase,et al. A Mechanization of Strong Kleene Logic for Partial Functions , 1994, CADE.
[43] William M. Farmer. Simple Second-order Languages for which Unification is Undecidable , 1991, Theor. Comput. Sci..
[44] J. R. Guard,et al. Semi-Automated Mathematics , 1969, JACM.
[45] Peter B. Andrews. An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.
[46] Christoph Weidenbach,et al. A Resolution Calculus with Dynamic Sort Structures and Partial Functions , 1990, ECAI.
[47] Natarajan Shankar,et al. PVS: A Prototype Verification System , 1992, CADE.
[48] Marek Zaionc,et al. Word Operation Definable in the Typed lambda-Calculus , 1987, Theor. Comput. Sci..
[49] Wayne Snyder. Higher Order E-Unification , 1990, CADE.
[50] Frank Pfenning,et al. The TPS Theorem Proving System , 1986, CADE.
[51] J. Goguen,et al. Order-Sorted Equational Computation , 1989 .
[52] Paul Bernays,et al. A system of axiomatic set theory—Part I , 1937, Journal of Symbolic Logic.
[53] Christoph Walther,et al. A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.
[54] Anthony G. Cohn,et al. A Many Sorted Logic with Possibly Empty Sorts , 1992, CADE.
[55] Tomás E. Uribe. Sorted Unification Using Set Constraints , 1992, CADE.
[56] Wolfgang Bibel,et al. Proceedings of the 5th Conference on Automated Deduction , 1980 .
[57] Zhenyu Qian,et al. Modular AC Unification of Higher-Order Patterns , 1994, CCL.
[58] Leon Henkin,et al. Completeness in the theory of types , 1950, Journal of Symbolic Logic.
[59] Richard Statman,et al. Logical Relations and the Typed lambda-Calculus , 1985, Inf. Control..
[60] Tobias Nipkow,et al. Isabelle tutorial and user’s manual , 1990 .
[61] Manfred Schmidt-Schauß,et al. Computational Aspects of an Order-Sorted Logic with Term Declarations , 1989, Lecture Notes in Computer Science.
[62] J. R. Guard. AUTOMATED LOGIC FOR SEMI-AUTOMATED MATHEMATICS , 1964 .
[63] Wayne Snyder,et al. Higher-Order Unification Revisited: Complete Sets of Transformations , 1989, J. Symb. Comput..
[64] Vincent J. Digrigoli. The efficacy of rue resolution experimental results and heuristic theory , 1981, IJCAI 1981.
[65] Peter Freeman. Automating software design , 1974, Computer.
[66] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.
[67] 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 .
[68] Manfred Schmidt-Schauß. Unification in Many-Sorted Eqational Theories , 1986, CADE.
[69] Tomasz Pietrzykowski. A Complete Mechanization of Second-Order Type Theory , 1973, JACM.
[70] James H. Bennett,et al. CRT-AIDED SEMI-AUTOMATED MATHEMATICS , 1967 .
[71] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .
[72] D. Barton,et al. Grundlagen der Analysis , 1934 .
[73] David Hilbert,et al. Über die Grundlagen der Logik und der Arithmetik , 1905 .
[74] Luca Cardelli,et al. A Semantics of Multiple Inheritance , 1984, Inf. Comput..
[75] Lewis D. Baxter. The Undecidability of the Third Order Dyadic Unification Problem , 1978, Inf. Control..
[76] Christoph Weidenbach,et al. A sorted logic using dynamic sorts , 1991 .
[77] William M. Farmer,et al. A Simple Type Theory with Partial Functions and Subtypes , 1993, Ann. Pure Appl. Log..
[78] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[79] Takahashi Moto-o. A sysytem of simple type theory of Gentzen style with inference on extensionality, and cut-elimination in it , 1970 .
[80] Harald Ganzinger,et al. On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.
[81] Thomas H. Mott,et al. SEMI-AUTOMATED MATHEMATICS: SAM IV. , 1964 .
[82] Gopalan Nadathur,et al. A Logic Programming Approach to Manipulating Formulas and Programs , 1987, SLP.
[83] Kim B. Bruce,et al. A modest model of records, inheritance and bounded quantification , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[84] Frank Pfenning,et al. Unification in a l-calculus with intersection types , 1993, ICLP 1993.
[85] Christoph Walther. A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution , 1984, AAAI.
[86] Vincent J. Digricoli. The Efficacy of RUE Resolution Experimental Results and Heuristic Theory , 1981, IJCAI.
[87] E. Zermelo. Untersuchungen über die Grundlagen der Mengenlehre. I , 1908 .
[88] Gordon Plotkin,et al. Semantics of Data Types , 1984, Lecture Notes in Computer Science.
[89] A. Fraenkel. Untersuchungen über die Grundlagen der Mengenlehre , 1925 .
[90] Gert Smolka. Logic Programming over Polymorphically Order-Sorted Types , 1989 .
[91] M. Schmidt-Schauβ. Computational Aspects of an Order-Sorted Logic with Term Declarations , 1989 .
[92] Hans Hahn,et al. Grundlagen der Analysis , 1911 .
[93] de Ng Dick Bruijn,et al. A survey of the project Automath , 1980 .
[94] Tobias Nipkow,et al. Modular Higher-Order E-Unification , 1991, RTA.
[95] Haskell B. Curry,et al. Combinatory Logic, Volume I , 1959 .
[96] Kurt Schutte. Syntactical and Semantical Properties of Simple Type Theory , 1960 .
[97] Harald Ganzinger,et al. Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria , 1992, LPAR.
[98] Simon Thompson,et al. Type theory and functional programming , 1991, International computer science series.
[99] R M Smullyan,et al. A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY. , 1963, Proceedings of the National Academy of Sciences of the United States of America.
[100] van Ls Bert Benthem Jutting,et al. Checking Landau's “Grundlagen” in the Automath System: Appendices 3 and 4 (The PN-lines; Excerpt for “Satz 27”) , 1994 .
[101] Daniel J. Dougherty,et al. A Combinatory Logic Approach to Higher-Order E-Unification , 1995, Theor. Comput. Sci..
[102] J. Roger Hindley,et al. Introduction to Combinators and Lambda-Calculus , 1986 .
[103] Raymond M. Smullyan,et al. A unifying principle for quantification theory , 1963 .
[104] Tobias Nipkow,et al. Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[105] Zhenyu Qian,et al. Reduction and Unification in Lambda Calculi with Subtypes , 1992, CADE.
[106] Maritta Heisel,et al. Tactical Theorem Proving in Program Verification , 1990, CADE.
[107] Jean-Pierre Bourguignon,et al. Mathematische Annalen , 1893 .
[108] Zhenyu Qian,et al. Linear Unification of Higher-Order Patterns , 1993, TAPSOFT.
[109] C. Torrance. Review: Kurt Gödel, The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory , 1941 .
[110] William M. Farmer,et al. A partial functions version of Church's simple theory of types , 1990, Journal of Symbolic Logic.
[111] M. Schönfinkel. Über die Bausteine der mathematischen Logik , 1924 .
[112] Rolf Socher-Ambrosius,et al. Unification in Order-Sorted Logic With Term Declarations , 1993, LPAR.
[113] Moto-O. Takahashi,et al. A proof of cut-elimination theorem in simple type-theory , 1967 .
[114] Wayne Snyder. Proof theory for general unification , 1993, Progress in computer science and applied logic.
[115] K. Schutte. Review: Dag Prawitz, Hauptsatz for Higher Order Logic; Dag Prawitz, Completeness and Hauptsatz for Second Order Logic; Moto-o Takahashi, A Proof of Cut-Elimination in Simple Type-Theory , 1974 .
[116] William H. Offenhauser,et al. Wild Boars as Hosts of Human-Pathogenic Anaplasma phagocytophilum Variants , 2012, Emerging infectious diseases.
[117] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .
[118] Franz Baader,et al. Unification theory , 1986, Decis. Support Syst..
[119] W. W. Bledsoe,et al. Set Variables , 1977, IJCAI.