J. Roger Hindley

According to our database, J. Roger Hindley authored at least 24 papers between 1967 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

Lambda-Calculus and Combinators in the 20th Century.

Felice Cardone, J. Roger Hindley

Proceedings of the Logic from Russell to Church, 2009

2008

Lambda-Calculus.

Mariangiola Dezani-Ciancaglini, J. Roger Hindley

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

M. H. Newman's Typability Algorithm for Lambda-calculus.

J. Roger Hindley

J. Log. Comput., 2008

1998

Combinatory Weak Reduction in Lambda Calculus.

Naim Çagman, J. Roger Hindley

Theor. Comput. Sci., 1998

1996

Two beta-Equal lambda-I-Terms with no Types in Common.

Martin W. Bunder, J. Roger Hindley

Theor. Comput. Sci., 1996

1994

Combinatory Abstraction Bsing B, B' and Friends.

P. Trigg, J. Roger Hindley, Martin W. Bunder

Theor. Comput. Sci., 1994

1993

BCK and BCI Logics, Condensed Detachment and the 2-Property.

J. Roger Hindley

Notre Dame J. Formal Log., 1993

1992

Intersection Types for Combinatory Logic.

Mariangiola Dezani-Ciancaglini, J. Roger Hindley

Theor. Comput. Sci., 1992

Types with Intersection: An Introduction.

J. Roger Hindley

Formal Aspects Comput., 1992

1990

Principal Type-Schemes and Condensed Detachment.

J. Roger Hindley, David Meredith

J. Symb. Log., 1990

1989

BCK-Combinators and Linear lambda-Terms have Types.

J. Roger Hindley

Theor. Comput. Sci., 1989

On Adding (xi) to Weak Equality in Combinatory Logic.

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin

J. Symb. Log., 1989

1986

Introduction to Combinators and Lambda-Calculus.

J. Roger Hindley, Jonathan P. Seldin

Cambridge University Press, 1986

1985

Combinators and Lambda-Calculus.

J. Roger Hindley

Proceedings of the Combinators and Functional Programming Languages, 1985

1984

Coppo-Dezani Types do not Correspond to Propositional Logic.

J. Roger Hindley

Theor. Comput. Sci., 1984

1983

Curry's Type-Rules are Complete with Respect to the F-Semantics too.

J. Roger Hindley

Theor. Comput. Sci., 1983

The Completeness Theorem for Typing lambda-Terms.

J. Roger Hindley

Theor. Comput. Sci., 1983

1982

The simple semantics for Coppe-Dezani-Sallé types.

J. Roger Hindley

Proceedings of the International Symposium on Programming, 1982

1979

The Discrimination Theorem Holds for Combinatory Weak Reduction.

J. Roger Hindley

Theor. Comput. Sci., 1979

1977

Combinatory Reductions and Lambda Reductions Compared.

J. Roger Hindley

Math. Log. Q., 1977

1974

An Abstract Church-Rosser Theorem. II: Applications.

J. Roger Hindley

J. Symb. Log., 1974

1972

Introduction to combinatory logic.

J. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin

Cambridge University Press, ISBN: 978-0-521-09697-3, 1972

1969

An Abstract Form of the Church-Rosser Theorem. I.

J. Roger Hindley

J. Symb. Log., 1969

1967

Axioms for Strong Reduction in Combinatory Logic.

J. Roger Hindley

J. Symb. Log., 1967