The computer modelling of mathematical reasoning
The computer modelling of mathematical reasoning
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
Journal of the ACM (JACM)
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Dependent types and formal synthesis
Mechanized reasoning and hardware design
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A uniform treatment of order of evaluation and aggregate update
Theoretical Computer Science
Handbook of logic in artificial intelligence and logic programming
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Reasoning about Java classes: preliminary report
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Subtypes for Specifications: Predicate Subtyping in PVS
IEEE Transactions on Software Engineering
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for reasoning about equality
Communications of the ACM
Proceedings of the 10th International Conference on Computer Aided Verification
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Stålmarck's Algorithm as a HOL Derived Rule
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Constructions: A Higher Order Proof System for Mechanizing Mathematics
EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Transforming the Theorem Prover into a Digital Design Tool: From Concept Car to Off-Road Vehicle
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The TPS Theorem Proving System
Proceedings of the 9th International Conference on Automated Deduction
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Extensional Higher-Order Resolution
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Certified Version of Buchberger's Algorithm
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Proof Generation in the Touchstone Theorem Prover
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Automated verification using deduction, exploration, and abstraction
Programming methodology
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Set Constraints for Destructive Array Update Optimization
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
A Compressing Translation from Propositional Resolution to Natural Deduction
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
| Hi-index | 0.00 |
In automated reasoning, there is a perceived trade-off between expressiveness and automation. Higher-order logic is typically viewed as expressive but resistant to automation, in contrast with firstorder logic and its fragments. We argue that higher-order logic and its variants actually achieve a happy medium between expressiveness and automation, particularly when used as a front-end to a wide range of decision procedures and deductive procedures. We illustrate the discussion with examples from PVS, but some of the observations apply to other variants of higher-order logic as well.