1.  4
    Typability and Type Checking in System F Are Equivalent and Undecidable.J. B. Wells - 1999 - Annals of Pure and Applied Logic 98 (1-3):111-156.
    Girard and Reynolds independently invented System F to handle problems in logic and computer programming language design, respectively. Viewing F in the Curry style, which associates types with untyped lambda terms, raises the questions of typability and type checking. Typability asks for a term whether there exists some type it can be given. Type checking asks, for a particular term and type, whether the term can be given that type. The decidability of these problems has been settled for restrictions and (...)
    Direct download (6 more)  
    Export citation  
    Bookmark   4 citations  
  2. Downey, R., F, iiForte, G. And Nies, A., Addendum To.R. Jin, I. Kalantari, L. Welch, B. Khoussainov, R. A. Shore, A. P. Pynko, P. Scowcroft, S. Shelah, J. Zapletal & J. B. Wells - 1999 - Annals of Pure and Applied Logic 98:299.
    No categories
    Export citation  
    Bookmark   2 citations  
  3.  14
    Bridging Curry and Church's Typing Style.Fairouz Kamareddine, Jonathan P. Seldin & J. B. Wells - 2016 - Journal of Applied Logic 18:42-70.
  4.  3
    Letter to the Editor.J. B. Wells - 1955 - New Blackfriars 36 (419):48-48.
    No categories
    Direct download  
    Export citation