A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf
.
Theorem proving for untyped constructive -calculus: implementation and application
2001
Logic Journal of the IGPL
This paper presents a theorem prover for a highly intensional logic, namely a constructive version of property theory [25] (this language essentially provides a combination of constructive first-order logic and the λ-calculus). The paper presents the basic theorem prover, which is a higher-order extension of Manthey and Bry's model generation theorem prover for first-order logic [14] ; considers issues relating to the compile-time optimisations that are often used with first-order theorem
doi:10.1093/jigpal/9.1.83
fatcat:w2aujrd5jrfq3ljpofvl7scqne