| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6142035 | 2024-01-23 | Paper |
| On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089205 | 2022-07-18 | Paper |
| \(O_n\) is an \(n\)-MCFL | 2022-04-04 | Paper |
| The Diagonal Problem for Higher-Order Recursion Schemes is Decidable | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636633 | 2018-04-19 | Paper |
| A model for behavioural properties of higher-order programs | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275365 | 2017-07-13 | Paper |
| Typing Weak MSOL Properties | 2017-05-08 | Paper |
| Simply typed fixpoint calculus and collapsible pushdown automata | 2017-04-03 | Paper |
| Evaluation is MSOL compatible | 2017-02-21 | Paper |
| Typing Weak MSOL Properties | 2015-10-01 | Paper |
| Using models to model-check recursive schemes | 2015-08-25 | Paper |
| MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies | 2015-07-13 | Paper |
| The IO and OI hierarchies revisited | 2015-06-09 | Paper |
| The failure of the strong pumping lemma for multiple context-free languages | 2015-02-05 | Paper |
| Krivine machines and higher-order schemes | 2014-11-28 | Paper |
| Building PMCFG Parsers as Datalog Program Transformations | 2014-06-24 | Paper |
| On IO-Copying and Mildly-Context Sensitive Formalisms | 2013-08-07 | Paper |
| The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars | 2013-08-07 | Paper |
| On the Complexity of Free Word Orders | 2013-08-07 | Paper |
| The IO and OI Hierarchies Revisited | 2013-08-07 | Paper |
| Using Models to Model-Check Recursive Schemes | 2013-06-28 | Paper |
| Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata | 2013-01-07 | Paper |
| Loader and Urzyczyn Are Logically Related | 2012-11-01 | Paper |
| A Datalog Recognizer for Almost Affine λ-CFGs | 2011-10-07 | Paper |
| Krivine Machines and Higher-Order Schemes | 2011-07-07 | Paper |
| Minimalist Grammars in the Light of Logic | 2011-07-07 | Paper |
| Well-Nestedness Properly Subsumes Strict Derivational Minimalism | 2011-07-01 | Paper |
| Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus | 2011-06-17 | Paper |
| A Note on the Complexity of Abstract Categorial Grammars | 2010-08-31 | Paper |
| On the membership problem for non-linear abstract categorial grammars | 2010-05-26 | Paper |
| A faithful representation of non-associative Lambek grammars in abstract categorial grammars | 2010-05-26 | Paper |
| The Copying Power of Well-Nested Multiple Context-Free Grammars | 2010-05-26 | Paper |
| Recognizability in the Simply Typed Lambda-Calculus | 2009-07-02 | Paper |
| Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus | 2008-09-25 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447236 | 2004-02-16 | Paper |
