J. Roger Hindley

24 papers Journal 18Unranked 2
YearRankTypeTitle / Venue / Authors
2009 — ch.
Lambda-Calculus and Combinators in the 20th Century.
Logic from Russell to Church
Felice Cardone, J. Roger Hindley
2008 — ch.
Lambda-Calculus.
Wiley Encyclopedia of Computer Science and Engineering
Mariangiola Dezani-Ciancaglini, J. Roger Hindley
2008 J jnl
M. H. Newman's Typability Algorithm for Lambda-calculus.
J. Log. Comput.
J. Roger Hindley
1998 J jnl
Combinatory Weak Reduction in Lambda Calculus.
Theor. Comput. Sci.
Naim Çagman, J. Roger Hindley
1996 J jnl
Two beta-Equal lambda-I-Terms with no Types in Common.
Theor. Comput. Sci.
Martin W. Bunder, J. Roger Hindley
1994 J jnl
Combinatory Abstraction Bsing B, B' and Friends.
Theor. Comput. Sci.
P. Trigg, J. Roger Hindley, Martin W. Bunder
1993 J jnl
BCK and BCI Logics, Condensed Detachment and the 2-Property.
Notre Dame J. Formal Log.
J. Roger Hindley
1992 J jnl
Intersection Types for Combinatory Logic.
Theor. Comput. Sci.
Mariangiola Dezani-Ciancaglini, J. Roger Hindley
1992 J jnl
Types with Intersection: An Introduction.
Formal Aspects Comput.
J. Roger Hindley
1990 J jnl
Principal Type-Schemes and Condensed Detachment.
J. Symb. Log.
J. Roger Hindley, David Meredith
1989 J jnl
BCK-Combinators and Linear lambda-Terms have Types.
Theor. Comput. Sci.
J. Roger Hindley
1989 J jnl
On Adding (xi) to Weak Equality in Combinatory Logic.
J. Symb. Log.
Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
1986 — book
Introduction to Combinators and Lambda-Calculus.
J. Roger Hindley, Jonathan P. Seldin
1985 — conf
Combinators and Lambda-Calculus.
Combinators and Functional Programming Languages
J. Roger Hindley
1984 J jnl
Coppo-Dezani Types do not Correspond to Propositional Logic.
Theor. Comput. Sci.
J. Roger Hindley
1983 J jnl
Curry's Type-Rules are Complete with Respect to the F-Semantics too.
Theor. Comput. Sci.
J. Roger Hindley
1983 J jnl
The Completeness Theorem for Typing lambda-Terms.
Theor. Comput. Sci.
J. Roger Hindley
1982 — conf
The simple semantics for Coppe-Dezani-Sallé types.
Symposium on Programming
J. Roger Hindley
1979 J jnl
The Discrimination Theorem Holds for Combinatory Weak Reduction.
Theor. Comput. Sci.
J. Roger Hindley
1977 J jnl
Combinatory Reductions and Lambda Reductions Compared.
Math. Log. Q.
J. Roger Hindley
1974 J jnl
An Abstract Church-Rosser Theorem. II: Applications.
J. Symb. Log.
J. Roger Hindley
1972 — book
Introduction to combinatory logic.
J. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin
1969 J jnl
An Abstract Form of the Church-Rosser Theorem. I.
J. Symb. Log.
J. Roger Hindley
1967 J jnl
Axioms for Strong Reduction in Combinatory Logic.
J. Symb. Log.
J. Roger Hindley