From post

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.

 

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

ML Typability is DEXTIME-Complete., , и . CAAP, том 431 из Lecture Notes in Computer Science, стр. 206-220. Springer, (1990)Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions., и . J. Symb. Log., 73 (3): 919-932 (2008)The Emptiness Problem for Intersection Types. LICS, стр. 300-309. IEEE Computer Society, (1994)Typed Lambda Calculi and Applications 2003, Selected Papers., и . Fundam. Informaticae, (2005)The Hierarchy of Finitely Typed Functional Programs (Short Version), , и . LICS, стр. 225-235. IEEE Computer Society, (1987)Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report)., и . Logic of Programs, том 164 из Lecture Notes in Computer Science, стр. 279-289. Springer, (1983)In the Search of a Naive Type Theory., и . TYPES, том 4941 из Lecture Notes in Computer Science, стр. 110-124. Springer, (2007)Type reconstruction in F-omega is undecidable.. TLCA, том 664 из Lecture Notes in Computer Science, стр. 418-432. Springer, (1993)Inhabitation of Low-Rank Intersection Types.. TLCA, том 5608 из Lecture Notes in Computer Science, стр. 356-370. Springer, (2009)The Logic of Persistent Intersection.. Fundam. Informaticae, 103 (1-4): 303-322 (2010)