A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Recursion Schemes and Logical Reflection

2010
*
2010 25th Annual IEEE Symposium on Logic in Computer Science
*

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ϕ is a ϕ-reflection of R just if (i) R and Rϕ generate the same underlying tree, and (ii) suppose a node u of the tree [[R]] generated by R has label f , then the label of the node u of ] is the computation tree of a program R, we may regard Rϕ as a transform of R that can internally observe its behaviour against a

doi:10.1109/lics.2010.40
dblp:conf/lics/BroadbentCOS10
fatcat:qpkit35y3fb6zc6xo5z4jjw2be