( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
BCK-Combinators and Linear lambda-Terms have Types.

. Theor. Comput. Sci., 64 (1): 97-105 (1989)

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.

Lily Hindley

Lily Hindley

Lily Hindley

Sebastian Roger

Susanne Rogers

 

Другие публикации лиц с тем же именем

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., и . Theor. Comput. Sci., 100 (2): 303-324 (1992)Basic Simple Type Theory. Cambridge University Press, Cambridge, (1997)Basic Simple Type Theory. Cambridge University Press, Second издание, (2008)Curry's Type-Rules are Complete with Respect to the F-Semantics too.. Theor. Comput. Sci., (1983)Coppo-Dezani Types do not Correspond to Propositional Logic.. Theor. Comput. Sci., (1984)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, том 137 из Lecture Notes in Computer Science, стр. 212-226. Springer, (1982)