2 citations · 2 across the 5 of their papers we have counts for
5 papers
Introducing Proof Tree Automata and Proof Tree Graphs
Valentin D. Richard
In structural proof theory, designing and working on large calculi make it difficult to get intuitions about each rule individually and as part of a whole system. We introduce two…
Keyboards as a new model of computation
Yoan Géran, Bastien Laboureix, Corto Mascle +1
We introduce a new formalisation of languages, called keyboards. We consider a set of elementary operations (writing/erasing a letter, going to the right or to the left,...) and we…
Lambek-Grishin Calculus: Focusing, Display and Full Polarization
Giuseppe Greco, Valentin D. Richard, Michael Moortgat +1
\emph{Focused sequent calculi} are a refinement of sequent calculi, where additional side-conditions on the applicability of inference rules force the implementation of a proof sea…
Introduction of Quantification in Frame Semantics
Valentin D. Richard
Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of re…
Traduction des Grammaires Catégorielles de Lambek dans les Grammaires Catégorielles Abstraites
Valentin D. Richard
Lambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types. It has been widely studied, especially for languages where the…