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
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong ... semantic restrictions, involving the set of constraints in the inductive system. ... In Foundations of Software Science and Computation Structures: 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014 ...arXiv:1707.02415v4 fatcat:cxyjpr7gajh2jakgb62z5d3mhe
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 ... of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, Lecture Notes in Computer Science 8412, Springer, pp. 149-163, doi:10.1007/978-3-642-54830-7_10.  Naoki Kobayashi & C. ...arXiv:1701.05303v1 fatcat:oz3y6fo3pja6viylgr2tnsxn2y