J. Roger Hindley

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Lambda-Calculus and Combinators in the 20th Century.
Proceedings of the Logic from Russell to Church, 2009

2008
Lambda-Calculus.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

M. H. Newman's Typability Algorithm for Lambda-calculus.
J. Log. Comput., 2008

1998
Combinatory Weak Reduction in Lambda Calculus.
Theor. Comput. Sci., 1998

1996
Two beta-Equal lambda-I-Terms with no Types in Common.
Theor. Comput. Sci., 1996

1994
Combinatory Abstraction Bsing B, B' and Friends.
Theor. Comput. Sci., 1994

1993
BCK and BCI Logics, Condensed Detachment and the 2-Property.
Notre Dame Journal of Formal Logic, 1993

1992
Intersection Types for Combinatory Logic.
Theor. Comput. Sci., 1992

Types with Intersection: An Introduction.
Formal Asp. Comput., 1992

1990
Principal Type-Schemes and Condensed Detachment.
J. Symb. Log., 1990

1989
BCK-Combinators and Linear lambda-Terms have Types.
Theor. Comput. Sci., 1989

On Adding (xi) to Weak Equality in Combinatory Logic.
J. Symb. Log., 1989

1986
Introduction to Combinators and Lambda-Calculus.
Cambridge University Press, 1986

1985
Combinators and Lambda-Calculus.
Proceedings of the Combinators and Functional Programming Languages, 1985

1984
Coppo-Dezani Types do not Correspond to Propositional Logic.
Theor. Comput. Sci., 1984

1983
Curry's Type-Rules are Complete with Respect to the F-Semantics too.
Theor. Comput. Sci., 1983

The Completeness Theorem for Typing lambda-Terms.
Theor. Comput. Sci., 1983

1982
The simple semantics for Coppe-Dezani-Sallé types.
Proceedings of the International Symposium on Programming, 1982

1979
The Discrimination Theorem Holds for Combinatory Weak Reduction.
Theor. Comput. Sci., 1979

1977
Combinatory Reductions and Lambda Reductions Compared.
Math. Log. Q., 1977

1974
An Abstract Church-Rosser Theorem. II: Applications.
J. Symb. Log., 1974

1972
Introduction to combinatory logic.
Cambridge University Press, ISBN: 978-0-521-09697-3, 1972

1969
An Abstract Form of the Church-Rosser Theorem. I.
J. Symb. Log., 1969

1967
Axioms for Strong Reduction in Combinatory Logic.
J. Symb. Log., 1967


  Loading...