8 found
  1.  19
    Combinatory Logic.Haskell B. Curry, J. Roger Hindley & Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):109-110.
    Direct download  
    Export citation  
    Bookmark   50 citations  
  2.  45
    Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - Cambridge University Press.
    Combinatory logic and lambda-conversion were originally devised in the 1920s for investigating the foundations of mathematics using the basic concept of 'operation' instead of 'set'. They have now developed into linguistic tools, useful in several branches of logic and computer science, especially in the study of programming languages. These notes form a simple introduction to the two topics, suitable for a reader who has no previous knowledge of combinatory logic, but has taken an undergraduate course in predicate calculus and recursive (...)
    Direct download  
    Export citation  
    Bookmark   16 citations  
  3.  46
    Introduction to Combinatory Logic.J. Roger Hindley - 1972 - Cambridge University Press.
    Introduction Combinatory logic deals with a class of formal systems designed for studying certain primitive ways in which functions can be combined to form ...
    Direct download (2 more)  
    Export citation  
    Bookmark   12 citations  
  4.  28
    Principal type-schemes and condensed detachment.J. Roger Hindley & David Meredith - 1990 - Journal of Symbolic Logic 55 (1):90-105.
  5.  25
    Lambda-calculus and combinators in the 20th century.Felice Cardone & J. Roger Hindley - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--723.
  6.  28
    BCK and BCI logics, condensed detachment and the $2$-property. [REVIEW]J. Roger Hindley - 1993 - Notre Dame Journal of Formal Logic 34 (2):231-250.
  7.  16
    To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism.Haskell B. Curry, J. Roger Hindley & J. P. Seldin (eds.) - 1980 - Academic Press.
  8.  46
    On adding (ξ) to weak equality in combinatory logic.Martin W. Bunder, J. Roger Hindley & Jonathan P. Seldin - 1989 - Journal of Symbolic Logic 54 (2):590-607.
    Because the main difference between combinatory weak equality and λβ-equality is that the rule \begin{equation*}\tag{\xi} X = Y \vdash \lambda x.X = \lambda x.Y\end{equation*} is valid for the latter but not the former, it is easy to assume that another way of defining combinatory β-equality is to add rule (ξ) to the postulates for weak equality. However, to make this true, one must choose the definition of combinatory abstraction in (ξ) very carefully. If one tries to use one of the (...)
    Direct download (8 more)  
    Export citation