Article

Automated Theorem Proving in a Simple Meta-Logic for LF

Authors:

Carsten Schürmann,

Frank PfenningAuthors Info & Claims

CADE-15: Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction

Pages 286 - 300

Published: 05 July 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Lorenzen FErdweg S(2016)Sound type-dependent syntactic language extensionACM SIGPLAN Notices10.1145/2914770.283764451:1(204-216)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2914770.2837644
Lorenzen FErdweg SBodik RMajumdar R(2016)Sound type-dependent syntactic language extensionProceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2837614.2837644(204-216)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2837614.2837644
Crole RFurniss A(2016)Canonical HybridLFElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2016.06.009323:C(125-142)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1016/j.entcs.2016.06.009
Show More Cited By

Index Terms

Automated Theorem Proving in a Simple Meta-Logic for LF
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus

Index terms have been assigned to the content through auto-classification.

Recommendations

Automated Theorem Proving in Higher-Order Logic
Theorem Proving Modulo
Abstract
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of general interest because it permits one to separate ...
Proof-checking metamathematics (theorem-proving)

Comments

Information & Contributors

Information

Published In

CADE-15: Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction

July 1998

440 pages

ISBN:3540646752

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 05 July 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lorenzen FErdweg S(2016)Sound type-dependent syntactic language extensionACM SIGPLAN Notices10.1145/2914770.283764451:1(204-216)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2914770.2837644
Lorenzen FErdweg SBodik RMajumdar R(2016)Sound type-dependent syntactic language extensionProceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2837614.2837644(204-216)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2837614.2837644
Crole RFurniss A(2016)Canonical HybridLFElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2016.06.009323:C(125-142)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1016/j.entcs.2016.06.009
Grewe SErdweg SWittmann PMezini MMurphy GJr. G(2015)Type systems for the masses: deriving soundness proofs and efficient checkers2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!)10.1145/2814228.2814239(137-150)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2814228.2814239
Wang YNadathur GMomigliano APientka BPollack R(2013)Towards extracting explicit proofs from totality checking in twelfProceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice10.1145/2503887.2503893(55-66)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1145/2503887.2503893
Popescu AGunter EChakravarty MHu ZDanvy O(2011)Recursion principles for syntax with bindings and substitutionProceedings of the 16th ACM SIGPLAN international conference on Functional programming10.1145/2034773.2034819(346-358)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034773.2034819
Popescu AGunter E(2011)Recursion principles for syntax with bindings and substitutionACM SIGPLAN Notices10.1145/2034574.203481946:9(346-358)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034574.2034819
Baelde DMiller DSnow Z(2010)Focused inductive theorem provingProceedings of the 5th international conference on Automated Reasoning10.1007/978-3-642-14203-1_24(278-292)Online publication date: 16-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14203-1_24
Scherpelz ELerner SChambers C(2007)Automatic inference of optimizer flow functions from semantic meaningsACM SIGPLAN Notices10.1145/1273442.125075042:6(135-145)Online publication date: 10-Jun-2007
https://dl.acm.org/doi/10.1145/1273442.1250750
Scherpelz ELerner SChambers CFerrante JMcKinley K(2007)Automatic inference of optimizer flow functions from semantic meaningsProceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1250734.1250750(135-145)Online publication date: 15-Jun-2007
https://dl.acm.org/doi/10.1145/1250734.1250750
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

Cited By

Index Terms

Recommendations

Automated Theorem Proving in Higher-Order Logic

Theorem Proving Modulo

Proof-checking metamathematics (theorem-proving)

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