J. Roger Hindley

Publication Activity (10 Years)

Years Active: 1967-2008
Publications (10 Years): 0

Publications

J. Roger Hindley
M. H. Newman's Typability Algorithm for Lambda-calculus. J. Log. Comput. 18 (2) (2008)
Naim Çagman, J. Roger Hindley
Combinatory Weak Reduction in Lambda Calculus. Theor. Comput. Sci. 198 (1-2) (1998)
Martin W. Bunder, J. Roger Hindley
Two beta-Equal lambda-I-Terms with no Types in Common. Theor. Comput. Sci. 155 (1) (1996)
P. Trigg, J. Roger Hindley, Martin W. Bunder
Combinatory Abstraction Bsing B, B' and Friends. Theor. Comput. Sci. 135 (2) (1994)
J. Roger Hindley
BCK and BCI Logics, Condensed Detachment and the 2-Property. Notre Dame J. Formal Log. 34 (2) (1993)
J. Roger Hindley
Types with Intersection: An Introduction. Formal Aspects Comput. 4 (5) (1992)
Mariangiola Dezani-Ciancaglini, J. Roger Hindley
Intersection Types for Combinatory Logic. Theor. Comput. Sci. 100 (2) (1992)
J. Roger Hindley, David Meredith
Principal Type-Schemes and Condensed Detachment. J. Symb. Log. 55 (1) (1990)
J. Roger Hindley
BCK-Combinators and Linear lambda-Terms have Types. Theor. Comput. Sci. 64 (1) (1989)
Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. 54 (2) (1989)
J. Roger Hindley
Combinators and Lambda-Calculus. Combinators and Functional Programming Languages (1985)
J. Roger Hindley
Coppo-Dezani Types do not Correspond to Propositional Logic. Theor. Comput. Sci. 28 (1984)
J. Roger Hindley
Curry's Type-Rules are Complete with Respect to the F-Semantics too. Theor. Comput. Sci. 22 (1983)
J. Roger Hindley
The Completeness Theorem for Typing lambda-Terms. Theor. Comput. Sci. 22 (1983)
J. Roger Hindley
The simple semantics for Coppe-Dezani-Sallé types. Symposium on Programming (1982)
J. Roger Hindley
The Discrimination Theorem Holds for Combinatory Weak Reduction. Theor. Comput. Sci. 8 (1979)
J. Roger Hindley
Combinatory Reductions and Lambda Reductions Compared. Math. Log. Q. 23 (7-12) (1977)
J. Roger Hindley
An Abstract Church-Rosser Theorem. II: Applications. J. Symb. Log. 39 (1) (1974)
J. Roger Hindley
An Abstract Form of the Church-Rosser Theorem. I. J. Symb. Log. 34 (4) (1969)
J. Roger Hindley
Axioms for Strong Reduction in Combinatory Logic. J. Symb. Log. 32 (2) (1967)