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.

 

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

A Datalog Recognizer for Almost Affine λ-CFGs., и . MOL, том 6878 из Lecture Notes in Computer Science, стр. 21-38. Springer, (2011)Minimalist Grammars in the Light of Logic.. Logic and Grammar, том 6700 из Lecture Notes in Computer Science, стр. 81-117. Springer, (2011)The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars., и . FG, том 8036 из Lecture Notes in Computer Science, стр. 191-208. Springer, (2013)Krivine Machines and Higher-Order Schemes., и . ICALP (2), том 6756 из Lecture Notes in Computer Science, стр. 162-173. Springer, (2011)On the Complexity of Free Word Orders., и . FG, том 8036 из Lecture Notes in Computer Science, стр. 209-224. Springer, (2013)Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear lambda-Calculus.. RTA, том 4098 из Lecture Notes in Computer Science, стр. 151-165. Springer, (2006)Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus., и . TLCA, том 6690 из Lecture Notes in Computer Science, стр. 61-75. Springer, (2011)The Copying Power of Well-Nested Multiple Context-Free Grammars., и . LATA, том 6031 из Lecture Notes in Computer Science, стр. 344-355. Springer, (2010)Recognizability in the Simply Typed Lambda-Calculus.. WoLLIC, том 5514 из Lecture Notes in Computer Science, стр. 48-60. Springer, (2009)Problèmes de filtrage et problème d'analyse pour les grammaires catégorielles abstraites. (Matching problem and parsing problem for abstract categorial grammars).. National Polytechnic Institute of Lorraine, Nancy, France, (2005)