1 Hit in 8.5 sec

Unboundedness for Recursion Schemes: A Simpler Type System [article]

David Barozzini, Paweł Parys, Jan Wróblewski
2022 arXiv   pre-print
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