UB Paderborn / Katalog / Suche / in CDI

On the Membership Problem for Non-Linear Abstract Categorial Grammars

Journal of logic, language, and information, 2010-04, Vol.19 (2), p.163-183

Salvati, Sylvain

2010

Volltextzugriff (PDF)

Typing weak MSOL properties

Logical methods in computer science, 2017-01, Vol.13, Issue 1

2017

Volltextzugriff (PDF)

The Copying Power of Well-Nested Multiple Context-Free Grammars

Language and Automata Theory and Applications, p.344-355

Volltextzugriff (PDF)

Using models to model-check recursive schemes

Logical methods in computer science, 2015-06, Vol.11, Issue 2

2015

Volltextzugriff (PDF)

The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars

Formal Grammar, p.191-208

Volltextzugriff (PDF)

MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies

Journal of computer and system sciences, 2015-11, Vol.81 (7), p.1252-1277

Salvati, Sylvain

2015

Volltextzugriff (PDF)

MIX is a 2-MCFL and the word problem in Z 2 is captured by the IO and the OI hierarchies

Journal of computer and system sciences, 2015-11, Vol.81 (7), p.1252-1277

Salvati, Sylvain

2015

Volltextzugriff (PDF)

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages

Theory of computing systems, 2014-07, Vol.55 (1), p.250-278

2014

Volltextzugriff (PDF)

On is an n-MCFL

Journal of computer and system sciences, 2022-08, Vol.127, p.41-52

2022

Volltextzugriff (PDF)

MIX is a 2-MCFL and the word problem in $\mathbb{Z}^2$ is solved by a third-order collapsible pushdown automaton

Journal of computer and system sciences, 2015, Vol.81 (7), p.1252-1277

Salvati, Sylvain

2015

Volltextzugriff (PDF)

Krivine machines and higher-order schemes

Information and computation, 2014-12, Vol.239, p.340-355

2014

Volltextzugriff (PDF)

Simply typed fixpoint calculus and collapsible pushdown automata

Mathematical structures in computer science, 2016-10, Vol.26 (7), p.1304-1350

2016

Volltextzugriff (PDF)

O is an n-MCFL

Journal of computer and system sciences, 2022-08, Vol.127, p.41-52

2022

Volltextzugriff (PDF)

A logical approach to grammar description

Journal of Language Modelling, 2015-06, Vol.3 (1)

2015

Volltextzugriff (PDF)

The IO and OI hierarchies revisited

Information and computation, 2015-08, Vol.243, p.205-221

2015

Volltextzugriff (PDF)

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars

Journal of logic, language, and information, 2010-04, Vol.19 (2), p.185-200

2010

Volltextzugriff (PDF)

Jumping Evaluation of Nested Regular Path Queries

Electronic proceedings in theoretical computer science, 2022, Vol.364, p.79-92

2022

Volltextzugriff (PDF)

Typing Weak MSOL Properties

Foundations of Software Science and Computation Structures, p.343-357

Volltextzugriff (PDF)

Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus

Lecture notes in computer science, 2006, p.151-165

2006

Volltextzugriff (PDF)

Recognizability in the Simply Typed Lambda-Calculus

Logic, Language, Information and Computation, p.48-60

Volltextzugriff (PDF)

Using Models to Model-check Recursive Schemes

Logical methods in computer science, 2015

2015

Volltextzugriff (PDF)

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016, p.96-105

2016

Volltextzugriff (PDF)

Minimalist Grammars in the Light of Logic

Logic and Grammar, p.81-117

Volltextzugriff (PDF)

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2016, p.1-10

2016

Volltextzugriff (PDF)

Using Models to Model-Check Recursive Schemes

Logical methods in computer science, 2013, Vol.11, p.189-204

2013

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

On the Membership Problem for Non-Linear Abstract Categorial Grammars

Typing weak MSOL properties

The Copying Power of Well-Nested Multiple Context-Free Grammars

Using models to model-check recursive schemes

The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars

MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies

MIX is a 2-MCFL and the word problem in Z 2 is captured by the IO and the OI hierarchies

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages

On is an n-MCFL

MIX is a 2-MCFL and the word problem in $\mathbb{Z}^2$ is solved by a third-order collapsible pushdown automaton

Krivine machines and higher-order schemes

Simply typed fixpoint calculus and collapsible pushdown automata

O is an n-MCFL

A logical approach to grammar description

The IO and OI hierarchies revisited

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars

Jumping Evaluation of Nested Regular Path Queries

Typing Weak MSOL Properties

Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus

Recognizability in the Simply Typed Lambda-Calculus

Using Models to Model-check Recursive Schemes

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

Minimalist Grammars in the Light of Logic

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

Using Models to Model-Check Recursive Schemes

Suchergebnisse filtern