chapter

Logical frameworks

Author:

Frank PfenningAuthors Info & Claims

Handbook of automated reasoning

January 2001

Pages 1063 - 1147

Published: 01 January 2001 Publication History

Abstract

No abstract available.

References

[1]

ABEL A. {1999}, A semantic analysis of structural recursion, Master's thesis, Ludwig-Maximilians-Universität München.]]

Google Scholar

[2]

ALLEN S. F., CONSTABLE R. L., HOWE D. J. AND AITKEN W. E. {1990}, The semantics of reflected proof, in 'Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS'90)', IEEE Computer Society Press, pp. 95-105.]]

Google Scholar

[3]

ALTENKIRCH T., GASPES V., NORDSTRÖM B. AND VON SYDOW B. {1994}, A User's Guide to ALF, Chalmers University of Technology, Sweden.]]

Google Scholar

[4]

ANDREOLI J.-M. {1992}, 'Logic programming with focusing proofs in linear logic', Journal of Logic and Computation2(3), 297-347.]]

Crossref

Google Scholar

[5]

ANDREWS P. {2001}, Classical type theory, in A. Robinson and A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. II, Elsevier Science, chapter 15, pp. 965-1007.]]

Digital Library

Google Scholar

[6]

ASPINALL D. AND COMPAGNONI A. {1996}, Subtyping dependent types, in E. Clarke, ed., 'Proceedings of the 11th Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, New Brunswick, New Jersey, pp. 86-97.]]

Digital Library

Google Scholar

[7]

BARENDREGT H. AND GEUVERS H. {2001}, Proof-assistants using dependent type systems, in A. Robinson and A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. II, Elsevier Science, chapter 18, pp. 1149-1238.]]

Digital Library

Google Scholar

[8]

BARENDREGT H. P. {1980}, The Lambda-Calculus: Its Syntax and Semantics, North-Holland.]]

Google Scholar

[9]

BARENDREGT H. P. {1992}, Lambda calculi with types, in S. Abramsky, D. Gabbay and T. Maibaum, eds, 'Handbook of Logic in Computer Science', Vol. 2, Oxford University Press, chapter 2, pp. 117-309.]]

Digital Library

Google Scholar

[10]

BASIN D. A. AND CONSTABLE R. L. {1993}, Metalogical frameworks, in G. Huet and G. Plotkin, eds, 'Logical Environments', Cambridge University Press, pp. 1-29.]]

Digital Library

Google Scholar

[11]

BASIN D. AND MATTHEWS S. {1996}, Structuring metatheory on inductive definitions, in M. McRobbie and J. Slaney, eds, 'Proceedings of the 13th International Conference on Automated Deduction (CADE-13)', Springer-Verlag LNAI 1104, New Brunswick, New Jersey, pp. 171-185.]]

Digital Library

Google Scholar

[12]

BASIN D. AND MATTHEWS S. {2000}, Logical frameworks, in D. Gabbay and F. Guenthner, eds, 'Handbook of Philosophical Logic', 2nd edn, Kluwer Academic Publishers. In preparation.]]

Google Scholar

[13]

BASIN D., MATTHEWS S. AND VIGANÒ L. {1998}, A modular presentation of modal logics in a logical framework, in 'The Tbilisi Symposium on Language, Logic and Computation: Selected Papers', CSLI Publications.]]

Google Scholar

[14]

BOROVANSKÝ P., KIRCHNER C., KIRCHNER H., MOREAU P.-E. AND RINGEISSEN C. {1998}, An overview of ELAN, in C. Kirchner and H. Kirchner, eds, 'Proceedings of the International Workshop on Rewriting Logic and its Applications', Vol. 15 of Electronic Notes in Theoretical Computer Science, Elsevier Science, Pont-à-Mousson, France. URL: http://www.elsevier.com/locate/entcs/volume15.html]]

Google Scholar

[15]

CERVESATO I. {1996}, A Linear Logical Framework, PhD thesis, Dipartimento di Informatica, Università di Torino.]]

Google Scholar

[16]

CERVESATO I. AND PFENNING F. {1996}, A linear logical framework, in E. Clarke, ed., 'Proceedings of the Eleventh Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, New Brunswick, New Jersey, pp. 264-275.]]

Digital Library

Google Scholar

[17]

CERVESATO I. AND PFENNING F. {1997}, Linear higher-order pre-unification, in G. Winskel, ed., 'Proceedings of the Twelfth Annual Sumposium on Logic in Computer Science (LICS'97)', IEEE Computer Society Press, Warsaw, Poland, pp. 422-433.]]

Digital Library

Google Scholar

[18]

CHIRIMAR J. L. {1995}, Proof Theoretic Approach to Specification Languages, PhD thesis, University of Pennsylvania.]]

Digital Library

Google Scholar

[19]

CHURCH A. AND ROSSER J. {1936}, 'Some properties of conversion', Transactions of the American Mathematical Society39(3), 472-482.]]

Crossref

Google Scholar

[20]

CONSTABLE R. L. ET AL. {1986}, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, New Jersey.]]

Digital Library

Google Scholar

[21]

Coq {1999}, Project home page. Version 6.2.3. URL: http://pauillac.inria.fr/coq/]]

Google Scholar

[22]

COQUAND C. {1992}, A proof of normalization for simply typed lambda calculus written in ALF, in 'Proceedings of the Workshop on Types for Proofs and Programs', Båstad, Sweden, pp. 85-92.]]

Google Scholar

[23]

COQUAND T. {1991}, An algorithm for testing conversion in type theory, in G. Huet and G. Plotkin, eds, 'Logical Frameworks', Cambridge University Press, pp. 255-279.]]

Digital Library

Google Scholar

[24]

COQUAND T., NORDSTRÖM B., SMITH J. M. AND VON SYDOW B. {1994}, 'Type theory and programming', Bulletin of the European Association for Theoretical Computer Science52, 203-228.]]

Google Scholar

[25]

COQUAND T. AND SMITH J. M. {1993}, What is the status of pattern matching in type theory?, in 'Proceedings of the Workshop on Types for Proofs and Programs', Nijmegen, The Netherlands, pp. 91-94.]]

Google Scholar

[26]

COURANT J. {1997}, A module calculus for pure type systems, in P. de Groote and R. Hindley, eds, 'Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97)', Springer-Verlag LNCS, Nancy, France, pp. 112-128.]]

Digital Library

Google Scholar

[27]

COURANT J. {1999}, MC: a modular calculus for Pure Type Systems, Rapport de Recherche 1217, CNRS Université Paris Sud.]]

Google Scholar

[28]

CURRY H. B. AND FEYS R. {1958}, Combinatory Logic, North-Holland, Amsterdam.]]

Google Scholar

[29]

DE BRUIJN N. {1968}, The mathematical language AUTOMATH, its usage, and some of its extensions, in M. Laudet, ed., 'Proceedings of the Symposium on Automatic Demonstration', Springer-Verlag LNM 125, Versailles, France, pp. 29-61.]]

Google Scholar

[30]

DE BRUIJN N. {1972}, 'Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem', Indag. Math.34(5), 381-392.]]

Crossref

Google Scholar

[31]

DE BRUIJN N. {1980}, A survey of the project AUTOMATH, in J. Seldin and J. Hindley, eds, 'To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism', Academic Press, pp. 579-606.]]

Google Scholar

[32]

DE BRUIJN N. {1991a}, A plea for weaker frameworks, in G. Huet and G. Plotkin, eds, 'Logical Frameworks', Cambridge University Press, pp. 40-67.]]

Digital Library

Google Scholar

[33]

DE BRUIJN N. {1991b}, 'Telescopic mappings in typed lambda calculus', Information and Computation 91(2), 189-204.]]

Digital Library

Google Scholar

[34]

DE BRUIJN N. {1993}, Algorithmic definition of lambda-typed lambda calculus, in G. Huet and G. Plotkin, eds, 'Logical Environment', Cambridge University Press, pp. 131-145.]]

Digital Library

Google Scholar

[35]

DEGTYAREV A. AND VORONKOV A. {2001}, The inverse method, in A. Robinson and A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. I, Elsevier Science, chapter 4, pp. 179-272.]]

Google Scholar

[36]

DESPEYROUX J., FELTY A. AND HIRSCHOWITZ A. {1995}, Higher-order abstract syntax in Coq, in M. Dezani-Ciancaglini and G. Plotkin, eds, 'Proceedings of the International Conference on Typed Lambda Calculi and Applications', Springer-Verlag LNCS 902, Edinburgh, Scotland, pp. 124-138.]]

Digital Library

Google Scholar

[37]

DESPEYROUX J. AND HIRSCHOWITZ A. {1994}, Higher-order abstract syntax with induction in Coq, in F. Pfenning, ed., 'Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning', Springer-Verlag LNAI 822, Kiev, Ukraine, pp. 159-173.]]

Digital Library

Google Scholar

[38]

DESPEYROUX J., PFENNING F. AND SCHÜRMANN C. {1997}, Primitive recursion for higher-order abstract syntax, in R. Hindley, ed., 'Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97)', Springer-Verlag LNCS 1210, Nancy, France, pp. 147-163. An extended version is available as Technical Report CMU-CS-96-172, Carnegie Mellon University.]]

Digital Library

Google Scholar

[39]

DOWEK G. {1993}, The undecidability of typability in the lambda-pi-calculus, in M. Bezem and J. Groote, eds, 'Proceedings of the International Conference on Typed Lambda Calculi and Applications', Springer-Verlag LNCS 664, Utrecht, The Netherlands, pp. 139-145.]]

Digital Library

Google Scholar

[40]

DOWEK G. {2001}, Higher-order unification and matching, in A. Robinson and A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. II, Elsevier Science, chapter 16, pp. 1009-1062.]]

Digital Library

Google Scholar

[41]

DOWEK G., FELTY A., HERBELIN H., HUET G., MURTHY C., PARENT C., PAULIN-MOHRING C. AND WERNER B. {1993}, The Coq proof assistant user's guide, Rapport Techniques 154, INRIA, Rocquencourt, France. Version 5.8.]]

Google Scholar

[42]

DOWEK G., HARDIN T., KIRCHNER C. AND PFENNING F. {1996}, Unification via explicit substitutions: The case of higher-order patterns, in M. Maher, ed., 'Proceedings of the Joint International Conference and Symposium on Logic Programming', MIT Press, Bonn, Germany, pp. 259-273.]]

Google Scholar

[43]

DOWEK G., HUET G. AND WERNER B. {1993}, On the definition of the eta-long normal form in type systems of the cube, in H. Geuvers, ed., 'Informal Proceedings of the Workshop on Types for Proofs and programs', Nijmegen, The Netherlands.]]

Google Scholar

[44]

DYCKHOFF R. AND PINTO L. {1994}, Uniform proofs and natural deduction, in D. Galmiche and L. Wallen, eds, 'Proceedings of the Workshop on Proof Search in Type-Theoretic Languages', Nancy, France, pp. 17-23.]]

Google Scholar

[45]

ELAN {1998}, System home page. Version 3.3. URL: http://www.loria.fr/ELAN]]

Google Scholar

[46]

ELLIOTT C. {1989}, Higher-order unification with dependent types, in N. Dershowitz, ed., 'Rewriting Techniques and Applications', Springer-Verlag LNCS 355, Chapel Hill, North Carolina, pp. 121-136.]]

Digital Library

Google Scholar

[47]

ELLIOTT C. M. {1990}, Extensions and Applications of Higher-Order Unification, PhD thesis, School of Computer Science, Carnegie Mellon University. Available as Technical Report CMU-CS-90-134.]]

Digital Library

Google Scholar

[48]

ERIKSSON L.-H. {1992}, A finitary version of the calculus of partial inductive definitions, in L.-H. Eriksson, L. Hallnäs and P. Schroeder-Heister, eds, 'Proceedings of the Second International Workshop on Extensions of Logic Programming', Springer-Verlag LNAI 596, Stockholm, Sweden, pp. 89-134.]]

Digital Library

Google Scholar

[49]

ERIKSSON L.-H. {1993a}, Finitary Partial Inductive Definitions and General Logic, PhD thesis, Department of Computer and System Sciences, Royal Institute of Technology, Stockholm.]]

Google Scholar

[50]

ERIKSSON L.-H. {1993b}, Finitary partial inductive definitions as a general logic, in R. Dyckhoff, ed., 'Proceedings of the 4th International Workshop on Extensions of Logic Programming', Springer-Verlag LNAI 798.]]

Digital Library

Google Scholar

[51]

ERIKSSON L.-H. {1994}, Pi: An interactive derivation editor for the calculus of partial inductive definitions, in A. Bundy, ed., 'Proceedings of the 12th International Conference on Automated Deduction', Springer Verlag LNAI 814, Nancy, France, pp. 821-825.]]

Digital Library

Google Scholar

[52]

FEFERMAN S. {1988}, Finitary inductive systems, in R. Ferro, ed., 'Proceedings of Logic Colloquium '88', North-Holland, Padova, Italy, pp. 191-220.]]

Google Scholar

[53]

FELTY A. {1989}, Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language, PhD thesis, University of Pennsylvania. Available as Technical Report MS-CIS-89-53.]]

Digital Library

Google Scholar

[54]

FELTY A. {1993}, 'Implementing tactics and tacticals in a higher-order logic programming language', Journal of Automated Reasoning11(1), 43-81.]]

Crossref

Google Scholar

[55]

FELTY A. AND MILLER D. {1988}, Specifying theorem provers in a higher-order logic programming language, in E. Lusk and R. Overbeek, eds, 'Proceedings of the Ninth International Conference on Automated Deduction', Springer-Verlag LNCS 310, Argonne, Illinois, pp. 61-80.]]

Digital Library

Google Scholar

[56]

FELTY A. AND MILLER D. {1990}, Encoding a dependent-type λ-calculus in a logic programming language, in M. Stickel, ed., '10th International Conference on Automated Deduction', Springer-Verlag LNCS 449, Kaiserslautern, Germany, pp. 221-235.]]

Digital Library

Google Scholar

[57]

FREGE G. {1879}, Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens, Verlag yon Louis Nebert. English translation Begriffsschrift, a formula language, modeled upon that of arithmatic, for pure thought in J. van Heijenoort, editor, From Frege to Gödel; A Source Book in Mathematical Logic, 1879-1931, pp. 1-82, Harvard University Press, 1967.]]

Google Scholar

[58]

GABBAY D. M. {1994}, Classical vs non-classical logic, in D. Gabbay, C. Hogger and J. Robinson, eds, 'Handbook of Logic in Artificial Intelligence and Logic Programming', Vol. 2, Oxford University Press, chapter 2.6.]]

Digital Library

Google Scholar

[59]

GABBAY D. M. {1996}, Labelled Deductive Systems, Vol. 1, Oxford University Press.]]

Google Scholar

[60]

GARDNER P. {1992}, Representing Logics in Type Theory, PhD thesis, University of Edinburgh. Available as Technical Report CST-93-92.]]

Google Scholar

[61]

GASPES V. AND SMITH J. M. {1992}, Machine checked normalization proofs for typed combinator calculi, in 'Proceedings of the Workshop on Types for Proofs and Programs', Båstad, Sweden, pp. 177-192.]]

Google Scholar

[62]

GENTZEN G. {1935}, 'Untersuchungen über das logische Schließen', Mathematische Zeitschrift39, 176-210, 405-431. English translation Investigations into logical deductions in M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pp. 68-131, North-Holland Publishing Co., 1969.]]

Google Scholar

[63]

GEUVERS H. {1992}, The Church-Rosser property for βη-reduction in typed λ-calculi, in A. Scedrov, ed., 'Seventh Annual IEEE Symposium on Logic in Computer Science', Santa Cruz, California, pp. 453-460.]]

Google Scholar

[64]

GHANI N. {1997}, Eta-expansions in dependent type theory -- the calculus of constructions, in P. de Groote and J. Hindley, eds, 'Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97)', Springer-Verlag LNCS 1210, Nancy, France, pp. 164-180.]]

Digital Library

Google Scholar

[65]

GIRARD J.-Y. {1987}, 'Linear logic', Theoretical Computer Science50, 1-102.]]

Digital Library

Google Scholar

[66]

GIRARD J.-Y. {1993}, 'On the unity of logic', Annals of Pure and Applied Logic59, 201-217.]]

Crossref

Google Scholar

[67]

GOGUEN H. {1999}, Soundness of the logical framework for its typed operational semantics, in J.-Y. Girard, ed., 'Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99)', Springer-Verlag LNCS 1581, L'Aquila, Italy, pp. 177-197.]]

Digital Library

Google Scholar

[68]

GOGUEN J. A. AND BURSTALL R. M. {1992}, 'Institutions: Abstract model theory for specification and programming', Journal of the ACM39(1), 95-146.]]

Digital Library

Google Scholar

[69]

GOLDFARB W. D. {1981}, 'The undecidability of the second-order unification problem', Theoretical Computer Science13, 225-230.]]

Google Scholar

[70]

GORDON M. J., MILNER R. AND WADSWORTH C. P. {1979}, Edinburgh LCF, Springer-Verlag LNCS 78.]]

Google Scholar

[71]

GORDON M. AND MELHAM T. {1993}, Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge University Press.]]

Digital Library

Google Scholar

[72]

HABERSTRAU M. {1994}, ECOLOG: An environment for constraint logics, in J.-P. Jouannaud, ed., 'Proceedings of the First International Conference on Constraints in Computational Logics', Springer-Verlag LNCS 845, Munich, Germany, pp. 237-252.]]

Digital Library

Google Scholar

[73]

HALLNÄS L. {1987}, A note on the logic of a logic program, in 'Proceedings of the Workshop on Programming Logic', University of Göteborg and Chalmers University of Technology, Report PMG-R37.]]

Google Scholar

[74]

HALLNÄS L. {1991}, 'Partial inductive definitions', Theoretical Computer Science87(1), 115-142.]]

Digital Library

Google Scholar

[75]

HANNAN J. {1993}, 'Extended natural semantics', Journal of Functional Programming3(2), 123-152.]]

Crossref

Google Scholar

[76]

HANNAN J. J. {1991}, Investigating a Proof-Theoretic Meta-Language for Functional Programs, PhD thesis, University of Pennsylvania. Available as Technical Report MS-CIS-91-09.]]

Digital Library

Google Scholar

[77]

HARPER R. {1988}, An equational formulation of LF, Technical Report ECS-LFCS-88-67, University of Edinburgh.]]

Google Scholar

[78]

HARPER R., HONSELL F. AND PLOTKIN G. {1987}, A framework for defining logics, in 'Symposium on Logic in Computer Science', IEEE Computer Society Press, pp. 194-204.]]

Google Scholar

[79]

HARPER R., HONSELL F. AND PLOTKIN G. {1993}, 'A framework for defining logics', Journal of the Association for Computing Machinery40(1), 143-184.]]

Digital Library

Google Scholar

[80]

HARPER R. AND PFENNING F. {1998}, 'A module system for a programming language based on the LF logical framework', Journal of Logic and Computation8(1), 5-31.]]

Crossref

Google Scholar

[81]

HARPER R. AND PFENNING F. {2000}, On equivalence and canonical forms in the LF type theory, Technical Report CMU-CS-00-148, Department of Computer Science, Carnegie Mellon University.]]

Google Scholar

[82]

HARPER R., SANNELLA D. AND TARLECKI A. {1989a}, Logic representation, in D. Pitt, D. Rydeheard, P. Dybjer, A. Pitts and A. Poigneé, eds, 'Proceedings of the Workshop on Category Theory and Computer Science', Springer-Verlag LNCS 389, Manchester, UK, pp. 250-272.]]

Digital Library

Google Scholar

[83]

HARPER R., SANNELLA D. AND TARLECKI A. {1989b}, Structure and representation in LF, in 'Fourth Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, Pacific Grove, California, pp. 226-237.]]

Digital Library

Google Scholar

[84]

HARPER R., SANNELLA D. AND TARLECKI A. {1994}, 'Structured presentations and logic representations', Annals of Pure and Applied Logic67,113-160.]]

Crossref

Google Scholar

[85]

HAYASHI S. AND NAKANO H. {1988}, PX: A Computational Logic, Foundations of Computing Series, MIT Press.]]

Digital Library

Google Scholar

[86]

HILBEHT D. AND BERNAYS P. {1934}, Grundlagen der Mathematik, Springer-Verlag, Berlin.]]

Google Scholar

[87]

HOWARD W. A. {1980}, The formulae-as-types notion of construction, in J. P. Seldin and J. R. Hindley, eds, "To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism', Academic Press, pp. 479-490. Hitherto unpublished note of 1969.]]

Google Scholar

[88]

HUET G. {1973}, 'The undecidability of unification in third order logic', Information and Control22(3), 257-267.]]

Google Scholar

[89]

HUET G. {1975}, 'A unification algorithm for typed λ-caiculus', Theoretical Computer Science1, 27-57.]]

Google Scholar

[90]

HUET G. AND LANG B. {1978}, 'Proving and applying program transformations expressed with second-order patterns', Acta Informatica11, 31-55.]]

Google Scholar

[91]

Isabelle {1998}, System home page. Version 98-1. URL: http://www.cl.cam.ac.uk/Research/HVG/Isabelle/]]

Google Scholar

[92]

JUTTING L. {1977}, Checking Landau's "Grundlagen" in the AUTOMATH System, PhD thesis, Eindhoven University of Technology.]]

Google Scholar

[93]

KAHN G. {1987}, Natural semantics, in 'Proceedings of the Symposium on Theoretical Aspects of Computer Science', Springer-Verlag LNCS 247, pp. 22-39.]]

Digital Library

Google Scholar

[94]

KIRCHNER, C. AND KIRCHNER, H., EDS {1998}, Proceedings of the International Workshop on Rewriting Logic and its Applications, Vol. 15 of Electronic Notes in Theoretical Computer Science, Elsevier Science, Pont-à-Mousson, France. URL: http://www.elsevier.com/locate/entcs/volume15.html]]

Google Scholar

[95]

KIRCHNER C., KIRCHNER H. AND VITTEK M. {1993}, Implementing computational systems with constraints, in P. van Hentenryck and V. Saraswat, eds, 'Proceedings of the First Workshop on Principles and Practice of Constraints Programming', MIT Press, Newport, Rhode Island.]]

Google Scholar

[96]

KOHLHASE M. AND PFENNING F. {1993}, Unification in a λ-calculus with intersection types, in D. Miller, ed., 'Proceedings of the International Logic Programming Symposium', MIT Press, Vancouver, Canada, pp. 488-505.]]

Digital Library

Google Scholar

[97]

LAMBEK J. AND SCOTT P. {1986}, Introduction to Higher-Order Categorical Logic, Cambridge University Press.]]

Digital Library

Google Scholar

[98]

LEGO {1998}, System home page. Version 1.3.1. URL: http://www.dcs.ed.ac.uk/home/lego]]

Google Scholar

[99]

LELEU P. {1998}, Induction et Syntaxe Abstraite d'Ordre Supérieur dans les Théories Typées, PhD thesis, Ecole Nationale des Ponts et Chaussees, Marne-la-Vallee, France.]]

Google Scholar

[100]

Logical Frameworks {1994}, Home page. Includes bibliography and pointers to implementations. Last updated June 1997. URL: http://www.cs.cmu.edu/~fp/lfs.html]]

Google Scholar

[101]

LUO Z. AND POLLACK R. {1992}, The LEGO proof development system: A user's manual, Technical Report ECS-LFCS-92-211, University of Edinburgh.]]

Google Scholar

[102]

MAGNUSSON L. {1993}, Refinement and local undo in the interactive proof editor ALF, in 'Proceedings of the Workshop on Types for Proofs and Programs', Nijmegen, The Netherlands, pp. 191-208.]]

Google Scholar

[103]

MAGNUSSON L. {1995}, The Implementation of ALF -A Proof Editor Based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution, PAD thesis, Chalmers University of Technology and Göteborg University.]]

Google Scholar

[104]

MAGNUSSON L. AND NORDSTRÖM B. {1994}, The ALF proof editor and its proof engine, in H. Barendregt and T. Nipkow, eds, 'Types for Proofs and Programs', Springer-Verlag LNCS 806, pp. 213-237.]]

Digital Library

Google Scholar

[105]

MARTÌ-OLIET N. AND MESEGUER J. {1993}, Rewriting logic as a logical and semantical framework, Technical Report SRI-CSL-93-05, SRI International.]]

Google Scholar

[106]

MARTIN-LÖF P. {1980}, Constructive mathematics and computer programming, in 'Logic, Methodology and Philosophy of Science VI', North-Holland, pp. 153-175.]]

Google Scholar

[107]

MARTIN-LÖF P. {1985a}, On the meanings of the logical constants and the justifications of the logical laws, Technical Report 2, Scuola di Specializzazione in Logica Matematica, Dipartimento di Matematica, Università di Siena. Reprinted in the Nordic Journal of Philosophical Logic, 1(1), 11-60, 1996.]]

Google Scholar

[108]

MARTIN-LÖF P. {1985b}, Truth of a proposition, evidence of a judgement, validity of a proof. Notes to a talk given at the workshop Theory of Meaning, Centro Fiorentino di Storia e Filosofia della Scienza.]]

Google Scholar

[109]

MATTHEWS S., SMAILL A. AND BASIN D. {1993}, Experience with FSo as a framework theory, in G. Huet and G. Plotkin, eds, 'Logical Environments', Cambridge University Press, pp. 61-82.]]

Digital Library

Google Scholar

[110]

Maude {1999}, System home page. Version 1.00. URL: http://maude.csl.sri.com]]

Google Scholar

[111]

McDOWELL R. {1997}, Reasoning in a Logic with Definitions and Induction, PhD thesis, University of Pennsylvania.]]

Digital Library

Google Scholar

[112]

McDOWELL R. AND MILLER D. {1997}, A logic for reasoning with higher-order abstract syntax, in G. Winskel, ed., 'Proceedings of the Twelfth Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, Warsaw, Poland, pp. 434-445.]]

Digital Library

Google Scholar

[113]

MESEGUER J. {1987}, General logics, in H.-D. Ebbinghaus, ed., 'Logic Colloquium '87', North-Holland, Granada, Spain, pp. 275-329.]]

Google Scholar

[114]

MESEGUER, J., ED. {1998}, Proceedings of the First International Workshop on Rewriting Logic and its Applications, Vol. 4 of Electronic Notes in Theoretical Computer Science, Elsevier Science, Pacific Grove, California. URL: http://www.elsevier.com/locate/entcs/volume4.html]]

Google Scholar

[115]

MICHAYLOV S. AND PFENNING F. {1991}, Natural semantics and some of its meta-theory in Elf, in L.-H. Eriksson, L. Hallnäs and P. Schroeder-Heister, eds, 'Proceedings of the Second International Workshop on Extensions of Logic Programming', Springer-Verlag LNAI 596, Stockholm, Sweden, pp. 299-344.]]

Digital Library

Google Scholar

[116]

MICHAYLOV S. AND PFENNING F. {1992}, An empirical study of the runtime behavior of higher-order logic programs, in D. Miller, ed., 'Proceedings of the Workshop on the λProlog Programming Language', University of Pennsylvania, Philadelphia, Pennsylvania, pp. 257-271. Available as Technical Report MS-CIS-92-86.]]

Google Scholar

[117]

MICHAYLOV S. AND PFENNING F. {1993}, Higher-order logic programming as constraint logic programming, in 'Position Papers for the First Workshop on Principles and Practice of Constraint Programming', Brown University, Newport, Rhode Island, pp. 221-229.]]

Google Scholar

[118]

MILLER D. {1986}, A theory of modules for logic programming, in R. M. Keller, ed., 'Third Annual IEEE Symposium on Logic Programming', Salt Lake City, Utah, pp. 106-114.]]

Google Scholar

[119]

MILLER D. {1989}, 'A logical analysis of modules in logic programming', Journal of Logic Programming 6(1-2), 79-108.]]

Digital Library

Google Scholar

[120]

MILLER D. {1991}, 'A logic programming language with lambda-abstraction, function variables, and simple unification', Journal of Logic and Computation1(4), 497-536.]]

Crossref

Google Scholar

[121]

MILLER D. {1994}, A multiple-conclusion meta-logic, in S. Abramsky, ed., 'Ninth Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, Paris, France, pp. 272-281.]]

Google Scholar

[122]

MILLER D., NADATHUR G., PFENNING F. AND SCEDROV A. {1991}, 'Uniform proofs as a foundation for logic programming', Annals of Pure and Applied Logic51, 125-157.]]

Crossref

Google Scholar

[123]

NADATHUR G. AND MILLER D. {1988}, An overview of λProlog, in K. A. Bowen and R. A. Kowalski, eds, 'Fifth International Logic Programming Conference', MIT Press, Seattle, Washington, pp. 810-827.]]

Google Scholar

[124]

NADATHUR G. AND MITCHELL D. J. {1999}, System description: Teyjus--a compiler and abstract machine based implementation of lambda Prolog, in H. Ganzinger, ed., 'Proceedings of the 16th International Conference on Automated Deduction (CADE-16)', Springer-Verlag LNCS, Trento, Italy, pp. 287-291.]]

Digital Library

Google Scholar

[125]

NADATHUR G. AND TONG G. {1999}, 'Realizing modularity in lambdaProlog', Journal of Functional and Logic Programming1999(9).]]

Google Scholar

[126]

NECULA G. C. {1997}, Proof-carrying code, in N. D. Jones, ed., 'Conference Record of the 24th Symposium on Principles of Programming Languages (POPL'97)', ACM Press, Paris, France, pp. 106-119.]]

Digital Library

Google Scholar

[127]

NECULA G. C. {1998}, Compiling with Proofs, PhD thesis, Carnegie Mellon University. Available as Technical Report CMU-CS-98-154.]]

Digital Library

Google Scholar

[128]

NECULA G. C. AND LEE P. {1996}, Safe kernel extensions without run-time checking, in 'Proceedings of the Second Symposium on Operating System Design and Implementation (OSDI'96)', Seattle, Washington, pp. 229-243.]]

Digital Library

Google Scholar

[129]

NECULA G. C. AND LEE P. {1998a}, The design and implementation of a certifying compiler, in K. D. Cooper, ed., 'Proceedings of the Conference on Programming Language Design and Implementation (PLDI'98)', ACM Press, Montreal, Canada, pp. 333-344.]]

Digital Library

Google Scholar

[130]

NECULA G. C. AND LEE P. {1998b}, Efficient representation and validation of logical proofs, in V. Pratt, ed., 'Proceedings of the 13th Annual Symposium on Logic in Computer Science (LICS'98)', IEEE Computer Society Press, Indianapolis, Indiana, pp. 93-104.]]

Digital Library

Google Scholar

[131]

NEDERPELT, R., GEUVERS, J. AND DE VRIJER, R., EDS {1994}, Selected Papers on Automath, Vol. 133 of Studies in Logic and the Foundations of Mathematics, North-Holland.]]

Google Scholar

[132]

NIPKOW T. {1989}, 'Equational reasoning in Isabelle', Science of Computer Programming12,123-149.]]

Digital Library

Google Scholar

[133]

NIPKOW T. {1993}, Order-sorted polymorphism in Isabelle, in G. Huet and G. Plotkin, eds, 'Logical Environments', Cambridge University Press, pp. 164-188.]]

Digital Library

Google Scholar

[134]

NIPKOW T. AND PAULSON L. C. {1992}, Isabelle-91, in D. Kapur, ed., 'Proceedings of the 11th International Conference on Automated Deduction', Springer-Verlag LNAI 607, Saratoga Springs, NY, pp. 673-676. System abstract.]]

Digital Library

Google Scholar

[135]

NORDSTRÖM B. {1993}, The ALF proof editor, in 'Proceedings of the Workshop on Types for Proofs and Programs', Nijmegen, pp. 253-266.]]

Google Scholar

[136]

NORDSTRÖM B., PETERSSON K. AND SMITH J. M. {1990}, Programming in Martin-Löf's Type Theory: An Introduction, Oxford University Press.]]

Digital Library

Google Scholar

[137]

Nuprl {1999}, Project home page. Version 4.2. URL: http://simon.cs.cornell.edu/Info/Projects/NuPrl/nuprl.html]]

Google Scholar

[138]

OHLBACH H., NONNENGART A., DE RIJKE M. AND GABBAY D. {2001}, Encoding two-valued nonclassical logics in classical logic, in A. Robinson and A. Voronkov, eds, 'Handbook of Automated Reasoning', Vol. II, Elsevier Science, chapter 21, pp. 1403-1486.]]

Digital Library

Google Scholar

[139]

PAULIN-MOHRING C. {1993}, Inductive definitions in the system Coq: Rules and properties, in M. Bezem and J. Groote, eds, 'Proceedings of the International Conference on Typed Lambda Calculi and Applications', Springer-Verlag LNCS 664, Utrecht, The Netherlands, pp. 328-345.]]

Digital Library

Google Scholar

[140]

PAULSON L. {1983}, Tactics and tacticals in Cambridge LCF, Technical Report 39, University of Cambridge, Computer Laboratory.]]

Google Scholar

[141]

PAULSON L. C. {1986}, 'Natural deduction as higher-order resolution', Journal of Logic Programming 3, 237-258.]]

Digital Library

Google Scholar

[142]

PAULSON L. C. {1989}, 'The foundation of a generic theorem prover', Journal of Automated Reasoning5(3), 363-397.]]

Digital Library

Google Scholar

[143]

PAULSON L. C. {1990}, Isabelle: The next 700 theorem provers, in P. Odifreddi, ed., 'Logic and Computer Science', Academic Press, pp. 361-386.]]

Google Scholar

[144]

PAULSON L. C. {1993}, Isabelle's object-logics, Technical Report 286, University of Cambridge, Computer Laboratory.]]

Google Scholar

[145]

PAULSON L. C. {1994}, Isabelle: A Generic Theorem Prover, Springer-Verlag LNCS 828.]]

Google Scholar

[146]

PETERSSON K. {1982}, A programming system for type theory, PMG Report 9, Chalmers University of Technology.]]

Google Scholar

[147]

PFENNING F. {1989}, Elf: A language for logic definition and verified meta-programming, in 'Fourth Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, Pacific Grove, California, pp. 313-322.]]

Digital Library

Google Scholar

[148]

PFENNING F. {1991a}, Logic programming in the LF logical framework, in G. Huet and G. Plotkin, eds, 'Logical Frameworks', Cambridge University Press, pp. 149-181.]]

Digital Library

Google Scholar

[149]

PFENNING F. {1991b}, Unification and anti-unification in the Calculus of Constructions, in 'Sixth Annual IEEE Symposium on Logic in Computer Science', Amsterdam, The Netherlands, pp. 74-85.]]

Google Scholar

[150]

PFENNING F. {1993}, Refinement types for logical frameworks, in H. Geuvers, ed., 'Informal Proceedings of the Workshop on Types for Proofs and Programs', Nijmegen, The Netherlands, pp. 285-299.]]

Google Scholar

[151]

PFENNING F. {1994a}, Elf: A meta-language for deductive systems, in A. Bundy, ed., 'Proceedings of the 12th International Conference on Automated Deduction', Springer-Verlag LNAI 814, Nancy, France, pp. 811-815. System abstract.]]

Digital Library

Google Scholar

[152]

PFENNING F. {1994b}, Structural cut elimination in linear logic, Technical Report CMU-CS-94-222, Department of Computer Science, Carnegie Mellon University.]]

Google Scholar

[153]

PFENNING F. {1995}, Structural cut elimination, in D. Kozen, ed., 'Proceedings of the Tenth Annual Symposium on Logic in Computer Science', IEEE Computer Society Press, San Diego, California, pp. 156-166.]]

Digital Library

Google Scholar

[154]

PFENNING F. {1996}, The practice of logical frameworks, in H. Kirchner, ed., 'Proceedings of the Colloquium on Trees in Algebra and Programming', Springer-Verlag LNCS 1059, Linköping, Sweden, pp. 119-134. Invited talk.]]

Digital Library

Google Scholar

[155]

PFENNING F. {2000}, 'Structural cut elimination I. Intuitionistic and classical logic', Information and Computation157(1/2), 84-141.]]

Digital Library

Google Scholar

[156]

PFENNING F. {2001}, Computation and Deduction, Cambridge University Press. In preparation. Draft from April 1997 available electronically. URL: http://www.cs.cmu.edu/~twelf/notes/cd.ps]]

Google Scholar

[157]

PFENNING F. AND ELLIOTT C. {1988}, Higher-order abstract syntax, in 'Proceedings of the ACM SIGPLAN '88 Symposium on Language Design and Implementation', Atlanta, Georgia, pp. 199-208.]]

Digital Library

Google Scholar

[158]

PFENNING F. AND ROHWEDDER E. {1992}, Implementing the meta-theory of deductive systems, in D. Kapur, ed., 'Proceedings of the 11th International Conference on Automated Deduction', Springer-Verlag LNAI 607, Saratoga Springs, New York, pp. 537-551.]]

Digital Library

Google Scholar

[159]

PFENNING F. AND SCHÜRMANN C. {1998a}, Algorithms for equality and unification in the presence of notational definitions, in T. Altenkirch, W. Naraschewski and B. Reus, eds, 'Types for Proofs and Programs', Springer-Verlag LNCS 1657, Kloster Irsee, Germany, pp. 179-193.]]

Digital Library

Google Scholar

[160]

PFENNING F. AND SCHÜRMANN C. {1998b}, 'Twelf', Project home page. Version 1.2. URL: http://www.cs.cmu.edu/~twelf]]

Google Scholar

[161]

PFENNING F. AND SCHÜRMANN C. {1998c}, Twelf User's Guide, 1.2 edn. Available as Technical Report CMU-CS-98-173, Carnegie Mellon University.]]

Google Scholar

[162]

PINTO L. AND DYCKHOFF R. {1998}, Sequent calculi for the normal terms of the λπ and λπσ calculi, in D. Galmiche, ed., 'Proceedings of the Workshop on Proof Search in Type-Theoretic Languages', Vol. 17 of Electronic Notes in Theoretical Computer Science, Elsevier Science, Lindau, Germany. URL: http://www.elsevier.com/locate/entcs/volume17.html]]

Google Scholar

[163]

POLLACK R. {1994}, The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions, PhD thesis, University of Edinburgh.]]

Google Scholar

[164]

λProlog {1997}, Home page. Indexes lambda Prolog implementations. URL: http://www.cse.psu.edu/~dale/lProlog/]]

Google Scholar

[165]

PYM D. {1990}, Proofs, Search and Computation in General Logic, PhD thesis, University of Edinburgh. Available as CST-69-90, also published as ECS-LFCS-90-125.]]

Google Scholar

[166]

PYM D. {1992}, 'A unification algorithm for the λII-calculus', International Journal of Foundations of Computer Science3(3), 333-378.]]

Google Scholar

[167]

PYM D. AND WALLEN L. {1990}, Investigations into proof-search in a system of first-order dependent function types, in M. Stickel, ed., 'Proceedings of the 10th International Conference on Automated Deduction', Springer-Verlag LNCS 449, Kaiserslautern, Germany, pp. 236-250.]]

Digital Library

Google Scholar

[168]

PYM D. AND WALLEN L. A. {1991}, Proof search in the λII-calculus, in G. Huet and G. Plotkin, eds, 'Logical Frameworks', Cambridge University Press, pp. 309-340.]]

Digital Library

Google Scholar

[169]

QIAN Z. {1993}, Linear unification of higher-order patterns, in M.-C. Gaudel and J.-P. Jouannaud, eds, 'Proceedings of the Colloquium on Trees in Algebra and Programming', Springer-Verlag LNCS 668, Orsay, France, pp. 391-405.]]

Digital Library

Google Scholar

[170]

ROHWEDDER E. AND PFENNING F. {1996}, Mode and termination checking for higher-order logic programs, in H. R. Nielson, ed., 'Proceedings of the European Symposium on Programming', Springer-Verlag LNCS 1058, Linköping, Sweden, pp. 296-310.]]

Digital Library

Google Scholar

[171]

RUESS H. {1996}, Reflection of formal tactics in a deductive reflection framework, in M. McRobbie and J. Slaney, eds, 'Proceedings of the 13th International Conference on Automated Deduction', Springer-Verlag LNAI 1104, New Brunswick, New Jersey, pp. 628-642.]]

Digital Library

Google Scholar

[172]

RUESS H. {1997}, Computational reflection in the calculus of constructions and its application to theorem proving, in P. de Groote and R. Hindley, eds, 'Proceedings fo the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97)', Springer-Verlag LNCS, Nancy, France, pp. 319-335.]]

Digital Library

Google Scholar

[173]

SCHROEDER-HEISTER p. {1991}, Structural frameworks, substructural logics, and the role of elimination inferences, in G. Huet and G. Plotkin, eds, 'Logical Frameworks', Cambridge University Press, pp. 385-403.]]

Digital Library

Google Scholar

[174]

SCHROEDER-HEISTER p. {1993}, Rules of definitional reflection, in M. Vardi, ed., 'Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science', Montreal, Canada, pp. 222-232.]]

Google Scholar

[175]

SCHÜRMANN C. {1995}, A computational meta logic for the Horn fragment of LF, Master's thesis, Carnegie Mellon University. Available as Technical Report CMU-CS-95-218.]]

Google Scholar

[176]

SCHÜRMANN C. {2000}, Automating the Meta Theory of Deductive Systems, PhD thesis, Department of Computer Science, Carnegie Mellon University. Available as Technical Report CMU-CS-00-146.]]

Digital Library

Google Scholar

[177]

SCHÜRMANN C. AND PFENNING F. {1998}, Automated theorem proving in a simple meta-logic for LF, in C. Kirchner and H. Kirchner, eds, 'Proceedings of the 15th International Conference on Automated Deduction (CADE-15)', Springer-Verlag LNCS 1421, Lindau, Germany, pp. 286-300.]]

Digital Library

Google Scholar

[178]

SHANKAR N. {1988}, 'A mechanical proof of the Church-Rosser theorem', Journal of the Association for Computing Machinery35(3), 475-522.]]

Digital Library

Google Scholar

[179]

TROELSTRA A. S. AND VAN DALEN D. {1988}, Constructivism in Mathematics, Vol. 121 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam.]]

Google Scholar

[180]

VIRGA R. {1996}, Higher-order superposition for dependent types, in H. Ganzinger, ed., 'Proceedings of the 7th International Conference on Rewriting Techniques and Applications', Springer-Verlag LNCS 1103, New Brunswick, New Jersey, pp. 123-137. Extended version available as Technical Report CMU-CS-95-150, May 1995.]]

Digital Library

Google Scholar

[181]

VIRGA R. {1999}, Higher-Order Rewriting with Dependent Types, PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University. Available as Technical Report CMU-CS- 99-167.]]

Digital Library

Google Scholar

Cited By

View all

Miller D(2020)A Distributed and Trusted Web of Formal ProofsDistributed Computing and Internet Technology10.1007/978-3-030-36987-3_2(21-40)Online publication date: 9-Jan-2020
https://dl.acm.org/doi/10.1007/978-3-030-36987-3_2
Chaudhuri KAndronick JFelty A(2018)A two-level logic perspective on (simultaneous) substitutionsProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3167093(280-292)Online publication date: 8-Jan-2018
https://dl.acm.org/doi/10.1145/3167093
Platzer A(2017)A Complete Uniform Substitution Calculus for Differential Dynamic LogicJournal of Automated Reasoning10.1007/s10817-016-9385-159:2(219-265)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s10817-016-9385-1
Show More Cited By

Index Terms

Logical frameworks

Recommendations

Logical Interpretation: Static Program Analysis Using Theorem Proving
CADE-21: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction

This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of <em>logical lattices</em>--- a class of lattices defined on logical formulas in a logical theory --- in an ...
Logical measure: structure of logical formula
Technologies for constructing intelligent systems

The structure of logical and/or pseudo-logical formula is introduced. The structure of logical formula is its characteristic invariant to its functional realization ({0,1}-valued, many-valued and/or [0,1]-valued logical function). The Boolean algebra is ...
Logical problem determination for SNA networks

Problem determination on a Systems Network Architecture network has dealt mostly with error detection on physical network components. Adequate logical error-detection mechanisms associated with the logical network (software-related) errors have been ...

Comments

Information & Contributors

Information

Published In

Handbook of automated reasoning

January 2001

2122 pages

ISBN:0444508120

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 January 2001

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Miller D(2020)A Distributed and Trusted Web of Formal ProofsDistributed Computing and Internet Technology10.1007/978-3-030-36987-3_2(21-40)Online publication date: 9-Jan-2020
https://dl.acm.org/doi/10.1007/978-3-030-36987-3_2
Chaudhuri KAndronick JFelty A(2018)A two-level logic perspective on (simultaneous) substitutionsProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3167093(280-292)Online publication date: 8-Jan-2018
https://dl.acm.org/doi/10.1145/3167093
Platzer A(2017)A Complete Uniform Substitution Calculus for Differential Dynamic LogicJournal of Automated Reasoning10.1007/s10817-016-9385-159:2(219-265)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s10817-016-9385-1
Horozal FRabe F(2015)Formal Logic Definitions for Interchange LanguagesProceedings of the International Conference on Intelligent Computer Mathematics - Volume 915010.1007/978-3-319-20615-8_11(171-186)Online publication date: 13-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-319-20615-8_11
Rabe FSojakova K(2013)Logical relations for a logical frameworkACM Transactions on Computational Logic10.1145/2536740.253674114:4(1-34)Online publication date: 28-Nov-2013
https://dl.acm.org/doi/10.1145/2536740.2536741
Urban CCheney JBerghofer S(2011)Mechanizing the metatheory of LFACM Transactions on Computational Logic10.1145/1877714.187772112:2(1-42)Online publication date: 27-Jan-2011
https://dl.acm.org/doi/10.1145/1877714.1877721
Pitts A(2010)Nominal system TACM SIGPLAN Notices10.1145/1707801.170632145:1(159-170)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1707801.1706321
Pitts AHermenegildo MPalsberg J(2010)Nominal system TProceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1706299.1706321(159-170)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1706299.1706321
Shankar N(2009)Automated deduction for verificationACM Computing Surveys10.1145/1592434.159243741:4(1-56)Online publication date: 9-Oct-2009
https://dl.acm.org/doi/10.1145/1592434.1592437
Rabe FSchürmann CCheney JFelty A(2009)A practical module system for LFProceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice10.1145/1577824.1577831(40-48)Online publication date: 2-Aug-2009
https://dl.acm.org/doi/10.1145/1577824.1577831
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Logical Interpretation: Static Program Analysis Using Theorem Proving

Logical measure: structure of logical formula

Logical problem determination for SNA networks

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations