Author of the publication

History of Lambda-calculus and Combinatory Logic

, and . MRRS-05-06. Swansea University Mathematics Department, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Discrimination Theorem Holds for Combinatory Weak Reduction.. Theor. Comput. Sci., (1979)BCK-Combinators and Linear lambda-Terms have Types.. Theor. Comput. Sci., 64 (1): 97-105 (1989)The Completeness Theorem for Typing lambda-Terms.. Theor. Comput. Sci., (1983)Intersection Types for Combinatory Logic., and . Theor. Comput. Sci., 100 (2): 303-324 (1992)History of Lambda-calculus and Combinatory Logic, and . MRRS-05-06. Swansea University Mathematics Department, (2006)Combinators and Lambda-Calculus.. Combinators and Functional Programming Languages, volume 242 of Lecture Notes in Computer Science, page 104-122. Springer, (1985)Combinatory Reductions and Lambda Reductions Compared.. Math. Log. Q., 23 (7-12): 169-180 (1977)The simple semantics for Coppe-Dezani-Sallé types.. Symposium on Programming, volume 137 of Lecture Notes in Computer Science, page 212-226. Springer, (1982)Coppo-Dezani Types do not Correspond to Propositional Logic.. Theor. Comput. Sci., (1984)Curry's Type-Rules are Complete with Respect to the F-Semantics too.. Theor. Comput. Sci., (1983)