A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Confluence 32:1-32:5 Preface The 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) was held 9 -12 July 2018 in Oxford, UK as part of FLoC 2018, 6 -19 July 2018 ... FSCD (http://fscd-conference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. ... Paula Severi, the Conference Chair for FSCD 2018, deserves warm thanks for producing the Web site, for the smooth functioning of this year's meeting and for coordination with the FLoC organizers. ...doi:10.4230/lipics.fscd.2018.0 dblp:conf/rta/X18 fatcat:jescf6ae7ndv7nkiwmaigkog4q
For unsafe recursion schemes we only have soundness of the type system: if one can establish a type derivation claiming that a recursion scheme is unbounded then it is indeed unbounded. ... Decidability of the problems of unboundedness and simultaneous unboundedness (aka. the diagonal problem) for higher-order recursion schemes was established by Clemente, Parys, Salvati, and Walukiewicz ... In Hélène Kirchner, editor, 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK, volume 108 of LIPIcs, pages 27:1-27:15. ...arXiv:2204.11023v1 fatcat:3guvgbngnnds3nfntr6fhm6t5e