Sciweavers

LICS
2010
IEEE
13 years 9 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...