dblp.uni-trier.dewww.uni-trier.de

J. Roger Hindley

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EEMariangiola Dezani-Ciancaglini, J. Roger Hindley: Lambda-Calculus. Wiley Encyclopedia of Computer Science and Engineering 2008
20EEJ. Roger Hindley: M. H. Newman's Typability Algorithm for Lambda-calculus. J. Log. Comput. 18(2): 229-238 (2008)
1998
19EENaim Çagman, J. Roger Hindley: Combinatory Weak Reduction in Lambda Calculus. Theor. Comput. Sci. 198(1-2): 239-247 (1998)
1996
18EEMartin W. Bunder, J. Roger Hindley: Two beta-Equal lambda-I-Terms with no Types in Common. Theor. Comput. Sci. 155(1): 265-266 (1996)
1994
17 P. Trigg, J. Roger Hindley, Martin W. Bunder: Combinatory Abstraction Bsing B, B' and Friends. Theor. Comput. Sci. 135(2): 405-422 (1994)
1993
16 J. Roger Hindley: BCK and BCI Logics, Condensed Detachment and the 2-Property. Notre Dame Journal of Formal Logic 34(2): 231-250 (1993)
1992
15 J. Roger Hindley: Types with Intersection: An Introduction. Formal Asp. Comput. 4(5): 470-486 (1992)
14 Mariangiola Dezani-Ciancaglini, J. Roger Hindley: Intersection Types for Combinatory Logic. Theor. Comput. Sci. 100(2): 303-324 (1992)
1990
13 J. Roger Hindley, David Meredith: Principal Type-Schemes and Condensed Detachment. J. Symb. Log. 55(1): 90-105 (1990)
1989
12 Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin: On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. 54(2): 590-607 (1989)
11 J. Roger Hindley: BCK-Combinators and Linear lambda-Terms have Types. Theor. Comput. Sci. 64(1): 97-105 (1989)
1986
10 J. Roger Hindley, Jonathan P. Seldin: Introduction to Combinators and Lambda-Calculus. Cambridge University Press 1986
1985
9 J. Roger Hindley: Combinators and Lambda-Calculus. Combinators and Functional Programming Languages 1985: 104-122
1984
8 J. Roger Hindley: Coppo-Dezani Types do not Correspond to Propositional Logic. Theor. Comput. Sci. 28: 235-236 (1984)
1983
7 J. Roger Hindley: The Completeness Theorem for Typing lambda-Terms. Theor. Comput. Sci. 22: 1-17 (1983)
6 J. Roger Hindley: Curry's Type-Rules are Complete with Respect to the F-Semantics too. Theor. Comput. Sci. 22: 127-133 (1983)
1982
5 J. Roger Hindley: The simple semantics for Coppe-Dezani-Sallé types. Symposium on Programming 1982: 212-226
1979
4 J. Roger Hindley: The Discrimination Theorem Holds for Combinatory Weak Reduction. Theor. Comput. Sci. 8: 393-394 (1979)
1974
3 J. Roger Hindley: An Abstract Church-Rosser Theorem. II: Applications. J. Symb. Log. 39(1): 1-21 (1974)
1969
2 J. Roger Hindley: An Abstract Form of the Church-Rosser Theorem. I. J. Symb. Log. 34(4): 545-560 (1969)
1967
1 J. Roger Hindley: Axioms for Strong Reduction in Combinatory Logic. J. Symb. Log. 32(2): 224-236 (1967)

Coauthor Index

1Martin W. Bunder [12] [17] [18]
2Naim Çagman [19]
3Mariangiola Dezani-Ciancaglini [14] [21]
4David Meredith [13]
5Jonathan P. Seldin [10] [12]
6P. Trigg [17]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)