H. L auchli, An abstract notion of realizability for which intuitionistic predicate logic is complete, Intuitionism and proof theory (J. Myhill, A. Kino, and R. E. Vesley, editors), North-Holland, 1970, pp. 227--234. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Explicit Provability and Constructive Semantics - Artemov (2000) (1 citation) (Correct)
.... does not specify Int; decent calculi can be built for a variety of logics including proper fragments of Int, classical logic ( 19] 81] 82] Abstract computational and functional semantics for Int which did not address the issue of the original BHK semantics for Int were also studied in [64], 87] and many other papers (cf. 17] 20] 96] Kuznetsov Muravitsky Goldblatt semantics for Int is based on a nonconstructive notion classically true and formally provable incompatible with the BHK semantics. In particular, it does not contain any BHK constructions or proofs whatsoever. ....
H. L auchli, An abstract notion of realizability for which intuitionistic predicate logic is complete, Intuitionism and proof theory (J. Myhill, A. Kino, and R.E. Vesley, editors), North-Holland, 1970, pp. 227--234.
Introduction to Lambda Calculus - Barendregt, Barendsen (1994) (1 citation) (Correct)
....be viewed as a proposition and a term M in A as a proof of this proposition. This so called propositions as types interpretation is independently due to de Bruijn (1970) and Howard (1980) both papers were conceived in 1968) Hints in this direction were given in Curry and Feys (1958) and in L auchli (1970). Several systems of proof checking are based on this interpretation of propositions as types and of proofs as terms. See e.g. de Bruijn (1980) for a survey of the so called automath proof checking system. Normalization of terms corresponds in the formulas as types interpretation to normalisation ....
Lauchli, H. (1970). An abstract notion of realizability for which intuitionistic predicate logic is complete, in: G. Myhill, A. Kino and R. Vesley (eds.), Intuitionism and Proof Theory: Proceedings of the Summer School Conference, Bu alo, New York, North-Holland, Amsterdam, pp. 227-234.
From Constructivism to Computer Science - Troelstra (1999) (Correct)
....interpretation. For a long time the results on AUTOMATH were not very accessible, since a lot of it could be found in internal reports and Ph.D. theses only; but recently all the interesting material on AUTOMATH was brought together in one volume [42] H. L# auchli Independently also, L#auchli [36] used in 1968 the ideas of formulas as types for obtaining a completeness proof for intuitionistic predicate logic, relative to a notion which might be regarded as a version of realizability. Martin L# of s type theories Formulas as types in the form FAT(B) and FAT(C) was the guiding idea ....
H. L#auchli, An abstract notion of realizability for which intuitionistic predicate calculus is complete, in: A. Kino, J.R. Myhill, R.E. Vesley (Eds.), Intuitionism and Proof Theory, North-Holland, Amsterdam, 1970, pp. 227--234.
Explicit Provability And Constructive Semantics - Artemov (2001) (1 citation) (Correct)
No context found.
H. L auchli, An abstract notion of realizability for which intuitionistic predicate logic is complete, Intuitionism and proof theory (J. Myhill, A. Kino, and R. E. Vesley, editors), North-Holland, 1970, pp. 227--234.
Kripke-Style Models for Typed Lambda Calculus - Mitchell, Moggi (1996) (39 citations) (Correct)
No context found.
H. Lauchli. An abstract notion of realizability for which intuitionistic predicate calculus is complete. In Kino Myhill and Vesley, editors, Intuitionism and Proof Theory: Proc. of the Summer Conference at Bu alo N.Y., North Holland, 1970. pages 227234.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC