6 found
  1.  25
    Typed Lambda Calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 1091--1132.
  2. Reasoning in Simple Type Theory — Festschrift in Honor of Peter B. Andrews on His 70th Birthday, Studies in Logic, Vol. 17. [REVIEW]Christoph Benzmüller, Chad E. Brown, Jörg Siekmann & Richard Statman - 2010 - Bulletin of Symbolic Logic 16 (3):409-411.
  3.  12
    Solution to a Problem of Chang and Lee.Richard Statman - 1980 - Notre Dame Journal of Formal Logic 21 (3):518-520.
  4.  10
    Some Results on Extensionality in Lambda Calculus.Benedetto Intrigila & Richard Statman - 2005 - Annals of Pure and Applied Logic 132 (2-3):109-125.
    In this paper we consider the problem of the existence of a λ-theory T such that:–T is recursive enumerable;–the ω-rule holds in T .We solve affirmatively this problem.Some related questions are also discussed.
    Direct download (4 more)  
    Export citation  
    Bookmark   1 citation  
  5.  29
    On the Unification Problem for Cartesian Closed Categories.Paliath Narendran, Frank Pfenning & Richard Statman - 1997 - Journal of Symbolic Logic 62 (2):636-647.
    Cartesian closed categories (CCCs) have played and continue to play an important role in the study of the semantics of programming languages. An axiomatization of the isomorphisms which hold in all Cartesian closed categories discovered independently by Soloviev and Bruce, Di Cosmo and Longo leads to seven equalities. We show that the unification problem for this theory is undecidable, thus settling an open question. We also show that an important subcase, namely unification modulo the linear isomorphisms, is NP-complete. Furthermore, the (...)
    Direct download (8 more)  
    Export citation  
    Bookmark   1 citation  
  6.  8
    Solving Functional Equations at Higher Types: Some Examples and Some Theorems.Richard Statman - 1986 - Notre Dame Journal of Formal Logic 27 (1):66-74.