A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Intersection Types and Counting
[article]
2017
arXiv
pre-print
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground λ-term corresponds to some property of a derivation of a type for this λ-term, in this type system. Our approach is presented in the particular case of the language finiteness problem for nondeterministic higher-order recursion schemes (HORSes): given a nondeterministic HORS, decide whether the set of
arXiv:1701.05303v1
fatcat:oz3y6fo3pja6viylgr2tnsxn2y