J. Roger Hindley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2009

Lambda-Calculus and Combinators in the 20th CenturyFelice Cardone, J. Roger Hindley. In Dov M. Gabbay, John Woods, editors, Logic from Russell to Church. Volume 5 of Handbook of the History of Logic, pages 723-817, Elsevier, 2009. [doi]

2008

M. H. Newman s Typability Algorithm for Lambda-calculusJ. Roger Hindley. logcom, 18(2):229-238, 2008. [doi]

1998

Combinatory Weak Reduction in Lambda CalculusNaim Çagman, J. Roger Hindley. TCS, 198(1-2):239-247, 1998. [doi]

1996

Two beta-Equal lambda-I-Terms with no Types in CommonMartin W. Bunder, J. Roger Hindley. TCS, 155(1):265-266, 1996. [doi]

1994

Combinatory Abstraction Bsing B, B and FriendsP. Trigg, J. Roger Hindley, Martin W. Bunder. TCS, 135(2):405-422, 1994.

1993

BCK and BCI Logics, Condensed Detachment and the 2-PropertyJ. Roger Hindley. ndjfl, 34(2):231-250, 1993.

1992

Intersection Types for Combinatory LogicMariangiola Dezani-Ciancaglini, J. Roger Hindley. TCS, 100(2):303-324, 1992.

Types with Intersection: An IntroductionJ. Roger Hindley. fac, 4(5):470-486, 1992.

1990

Principal Type-Schemes and Condensed DetachmentJ. Roger Hindley, David Meredith 0002. JSYML, 55(1):90-105, 1990.

1989

On Adding (xi) to Weak Equality in Combinatory LogicMartin W. Bunder, J. Roger Hindley, Jonathan P. Seldin. JSYML, 54(2):590-607, 1989.

BCK-Combinators and Linear lambda-Terms have TypesJ. Roger Hindley. TCS, 64(1):97-105, 1989.

1986

Introduction to Combinators and Lambda-CalculusJ. Roger Hindley, Jonathan P. Seldin. Cambridge University Press, 1986.

1985

Combinators and Lambda-CalculusJ. Roger Hindley. litp 1986: 104-122

1984

Coppo-Dezani Types do not Correspond to Propositional LogicJ. Roger Hindley. TCS, 28:235-236, 1984.

1983

Curry s Type-Rules are Complete with Respect to the F-Semantics tooJ. Roger Hindley. TCS, 22:127-133, 1983.

The Completeness Theorem for Typing lambda-TermsJ. Roger Hindley. TCS, 22:1-17, 1983.

1982

The simple semantics for Coppe-Dezani-Sallé typesJ. Roger Hindley. programm 1982: 212-226

1979

The Discrimination Theorem Holds for Combinatory Weak ReductionJ. Roger Hindley. TCS, 8:393-394, 1979.

1977

Combinatory Reductions and Lambda Reductions ComparedJ. Roger Hindley. mlq, 23(7-12):169-180, 1977. [doi]

1974

An Abstract Church-Rosser Theorem. II: ApplicationsJ. Roger Hindley. JSYML, 39(1):1-21, 1974.

1972

Introduction to combinatory logicJ. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin. Cambridge University Press, 1972.

1969

An Abstract Form of the Church-Rosser Theorem. IJ. Roger Hindley. JSYML, 34(4):545-560, 1969.

1967

Axioms for Strong Reduction in Combinatory LogicJ. Roger Hindley. JSYML, 32(2):224-236, 1967.

Sign in or sign up to see more results.

runs on WebDSL