Article

Specifying Theorem Provers in a Higher-Order Logic Programming Language

Authors:

Amy P. Felty,

Dale MillerAuthors Info & Claims

Proceedings of the 9th International Conference on Automated Deduction

Pages 61 - 80

Published: 23 May 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Dunchev CCoen CTassi EAlves SDowek GLicata D(2016)Implementing HOL in an Higher Order Logic Programming LanguageProceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice10.1145/2966268.2966272(1-10)Online publication date: 23-Jun-2016
https://dl.acm.org/doi/10.1145/2966268.2966272
Aminof BMogavero FMurano A(2014)Synthesis of hierarchical systemsScience of Computer Programming10.1016/j.scico.2013.07.00183(56-79)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1016/j.scico.2013.07.001
Zhang FCarlet CHu YCao T(2014)Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functionsInformation Sciences: an International Journal10.1016/j.ins.2014.06.024283(94-106)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.ins.2014.06.024
Show More Cited By

Index Terms

Specifying Theorem Provers in a Higher-Order Logic Programming Language
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
2. Theory of computation
  1. Logic
    1. Constraint and logic programming

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

Recommendations

Specifying and implementing theorem provers in a higher-order logic programming language
Higher-order equational logic programming
POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Higher-order equational logic programming is a paradigm which combines first-order equational and higher-order logic programming, where higher-order logic programming is based on a subclass of simply typed λ-terms, called higher-order patterns. Central ...
Declarative foundations of higher-order logic programming

Comments

Information & Contributors

Information

Published In

Proceedings of the 9th International Conference on Automated Deduction

May 1988

774 pages

ISBN:354019343X

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 May 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
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

Dunchev CCoen CTassi EAlves SDowek GLicata D(2016)Implementing HOL in an Higher Order Logic Programming LanguageProceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice10.1145/2966268.2966272(1-10)Online publication date: 23-Jun-2016
https://dl.acm.org/doi/10.1145/2966268.2966272
Aminof BMogavero FMurano A(2014)Synthesis of hierarchical systemsScience of Computer Programming10.1016/j.scico.2013.07.00183(56-79)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1016/j.scico.2013.07.001
Zhang FCarlet CHu YCao T(2014)Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functionsInformation Sciences: an International Journal10.1016/j.ins.2014.06.024283(94-106)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.ins.2014.06.024
Shim K(2014)On delegatability of designated verifier signature schemesInformation Sciences: an International Journal10.1016/j.ins.2014.05.020281(365-372)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1016/j.ins.2014.05.020
Hutter FXu LHoos HLeyton-Brown K(2014)Algorithm runtime predictionArtificial Intelligence10.1016/j.artint.2013.10.003206(79-111)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1016/j.artint.2013.10.003
Miller DPimentel E(2013)A formal framework for specifying sequent calculus proof systemsTheoretical Computer Science10.5555/2438099.2438159474(98-116)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.5555/2438099.2438159
Crain TImbs DRaynal M(2013)Towards a universal construction for transaction-based multiprocess programsTheoretical Computer Science10.1016/j.tcs.2012.09.011496(154-169)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.09.011
Qin BWu QZhang LFarríS ODomingo-Ferrer J(2012)Provably secure threshold public-key encryption with adaptive security and short ciphertextsInformation Sciences: an International Journal10.1016/j.ins.2012.04.038210(67-80)Online publication date: 1-Nov-2012
https://dl.acm.org/doi/10.1016/j.ins.2012.04.038
Wu CChen XLi QLong D(2012)Efficient ID-based non-malleable trapdoor commitmentComputers and Electrical Engineering10.1016/j.compeleceng.2012.06.01338:6(1647-1657)Online publication date: 1-Nov-2012
https://dl.acm.org/doi/10.1016/j.compeleceng.2012.06.013
Dang TLe Guernic CMaler O(2011)Computing reachable states for nonlinear biological modelsTheoretical Computer Science10.1016/j.tcs.2011.01.014412:21(2095-2107)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1016/j.tcs.2011.01.014
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

Specifying and implementing theorem provers in a higher-order logic programming language

Higher-order equational logic programming

Declarative foundations of higher-order logic programming

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