default search action
J. Roger Hindley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [r1]Felice Cardone, J. Roger Hindley:
Lambda-Calculus and Combinators in the 20th Century. Logic from Russell to Church 2009: 723-817 - 2008
- [j18]J. Roger Hindley:
M. H. Newman's Typability Algorithm for Lambda-calculus. J. Log. Comput. 18(2): 229-238 (2008) - [p1]Mariangiola Dezani-Ciancaglini
, J. Roger Hindley:
Lambda-Calculus. Wiley Encyclopedia of Computer Science and Engineering 2008
1990 – 1999
- 1998
- [j17]Naim Çagman
Combinatory Weak Reduction in Lambda Calculus. Theor. Comput. Sci. 198(1-2): 239-247 (1998) - 1996
- [j16]Martin 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
- [j15]P. Trigg, J. Roger Hindley, Martin W. Bunder:
Combinatory Abstraction Bsing B, B' and Friends. Theor. Comput. Sci. 135(2): 405-422 (1994) - 1993
- [j14]J. Roger Hindley:
BCK and BCI Logics, Condensed Detachment and the 2-Property. Notre Dame J. Formal Log. 34(2): 231-250 (1993) - 1992
- [j13]J. Roger Hindley:
Types with Intersection: An Introduction. Formal Aspects Comput. 4(5): 470-486 (1992) - [j12]Mariangiola Dezani-Ciancaglini
Intersection Types for Combinatory Logic. Theor. Comput. Sci. 100(2): 303-324 (1992) - 1990
- [j11]J. Roger Hindley, David Meredith:
Principal Type-Schemes and Condensed Detachment. J. Symb. Log. 55(1): 90-105 (1990)
1980 – 1989
- 1989
- [j10]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) - [j9]J. Roger Hindley:
BCK-Combinators and Linear lambda-Terms have Types. Theor. Comput. Sci. 64(1): 97-105 (1989) - 1986
- [b2]J. Roger Hindley, Jonathan P. Seldin:
Introduction to Combinators and Lambda-Calculus. Cambridge University Press 1986 - 1985
- [c2]J. Roger Hindley:
Combinators and Lambda-Calculus. Combinators and Functional Programming Languages 1985: 104-122 - 1984
- [j8]J. Roger Hindley:
Coppo-Dezani Types do not Correspond to Propositional Logic. Theor. Comput. Sci. 28: 235-236 (1984) - 1983
- [j7]J. Roger Hindley:
The Completeness Theorem for Typing lambda-Terms. Theor. Comput. Sci. 22: 1-17 (1983) - [j6]J. Roger Hindley:
Curry's Type-Rules are Complete with Respect to the F-Semantics too. Theor. Comput. Sci. 22: 127-133 (1983) - 1982
- [c1]J. Roger Hindley:
The simple semantics for Coppe-Dezani-Sallé types. Symposium on Programming 1982: 212-226
1970 – 1979
- 1979
- [j5]J. Roger Hindley:
The Discrimination Theorem Holds for Combinatory Weak Reduction. Theor. Comput. Sci. 8: 393-394 (1979) - 1977
- [j4]J. Roger Hindley:
Combinatory Reductions and Lambda Reductions Compared. Math. Log. Q. 23(7-12): 169-180 (1977) - 1974
- [j3]J. Roger Hindley:
An Abstract Church-Rosser Theorem. II: Applications. J. Symb. Log. 39(1): 1-21 (1974) - 1972
- [b1]J. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin:
Introduction to combinatory logic. Cambridge University Press 1972, ISBN 978-0-521-09697-3, pp. 1-170
1960 – 1969
- 1969
- [j2]J. Roger Hindley:
An Abstract Form of the Church-Rosser Theorem. I. J. Symb. Log. 34(4): 545-560 (1969) - 1967
- [j1]J. Roger Hindley:
Axioms for Strong Reduction in Combinatory Logic. J. Symb. Log. 32(2): 224-236 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: