1 citations · 1 across the 4 of their papers we have counts for
4 papers
A cartesian closed fibration of higher-order regular languages
Paul-André Melliès, Vincent Moreau
We explain how to construct in two different ways a cartesian closed fibration of higher-order regular languages in the sense of Salvati. In the first construction, we use fibratio…
Profinite trees, through Lawvere theories and the lambda-calculus
Vincent Moreau
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a…
Syntactically and semantically regular languages of lambda-terms coincide through logical relations
Vincent Moreau, Lê Thành Dũng Nguyên
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of…
Profinite lambda-terms and parametricity
Sam van Gool, Paul-André Melliès, Vincent Moreau
Combining ideas coming from Stone duality and Reynolds parametricity, we formulate in a clean and principled way a notion of profinite lambda-term which, we show, generalizes at ev…