Roger Hindley

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The completeness theorem for typing lambda-terms Theoretical Computer Science	1983-01-01	Paper
Curry's type-rules are complete with respect to the F-semantics too Theoretical Computer Science	1983-01-01	Paper
Lambda‐Calculus Models and Extensionality Mathematical Logic Quarterly	1980-01-01	Paper
The discrimination theorem holds for combinatory weak reduction Theoretical Computer Science	1979-01-01	Paper
Standard and Normal Reductions	1978-01-01	Paper
Reductions of Residuals are Finite	1978-01-01	Paper
Combinatory Reductions and Lambda Reductions Compared Mathematical Logic Quarterly	1977-01-01	Paper
Some remarks about the connections between Combinatory Logic and axiomatic recursion theory Archiv für Mathematische Logik und Grundlagenforschung	1977-01-01	Paper
The Equivalence of Complete Reductions	1977-01-01	Paper
An abstract Church-Rosser theorem. II: Applications Journal of Symbolic Logic	1974-01-01	Paper
A Short Proof of Curry's Normal Form Theorem Proceedings of the American Mathematical Society	1970-01-01	Paper
The Principal Type-Scheme of an Object in Combinatory Logic Transactions of the American Mathematical Society	1969-01-01	Paper
An Abstract form of the church-rosser theorem. I Journal of Symbolic Logic	1969-01-01	Paper
Axioms for strong reduction in combinatory logic Journal of Symbolic Logic	1967-01-01	Paper

Research outcomes over time

This page was built for person: Roger Hindley