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 application/pdf.
Filters
Unboundedness for Recursion Schemes: A Simpler Type System
[article]
2022
arXiv
pre-print
Preserved Fulltext
We present here a simpler and much more intuitive type system serving the same purpose. ...
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. ...
In Michele Pagani and Sandra Alves, editors, Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, DCM/ITRS 2018, Oxford, UK ...
arXiv:2204.11023v1
fatcat:3guvgbngnnds3nfntr6fhm6t5e