Switch to: References

Add citations

You must login to add citations.
  1. Finite type structures within combinatory algebras.Inge Bethke - 1991 - Annals of Pure and Applied Logic 55 (2):101-123.
    Inside a combinatory algebra, there are ‘internal’ versions of the finite type structure over ω, which form models of various systems of finite type arithmetic. This paper compares internal representations of the intensional and extensional functionals. If these classes coincide, the algebra is called ft-extensional. Some criteria for ft-extensionality are given and a number of well-known ca's are shown to be ft-extensional, regardless of the particular choice of representation for ω. In particular, DA, Pω, Tω, Hω and certain D∞-models all (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • The impact of the lambda calculus in logic and computer science.Henk Barendregt - 1997 - Bulletin of Symbolic Logic 3 (2):181-215.
    One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   10 citations