4 citations · 6 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016★ 1 cited
Typing weak MSOL properties
Sylvain Salvati, Igor Walukiewicz
We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of call…
cs.FL2016★ 1 cited
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
Lorenzo Clemente, Paweł Parys, Sylvain Salvati +1
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We…