Theorem Proving for Constructive lambda-Calculus

  • Authors:

  • Allan Ramsay

  • Affiliations:

  • -

  • Venue:
  • AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a theorem prover for a combination of constructive first-order logic and the λ-calculus. The paper presents the basic theorem prover, which is an extension of [6]'s model generation theorem prover for first-order logic, and considers issues relating to the compile-time optimisations that are often used with first-order theorem provers.