Unboundedness for recursion schemes: a simpler type system

DOI10.4230/LIPICS.ICALP.2022.112MaRDI QIDQ6560912zbMATH OpenFDO

Authors David Barozzini, Paweł Parys, Jan Wróblewski

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.112

zbMATH Keywords

boundednesshigher-order recursion schemesintersection typessafe schemes

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

• Verifying unboundedness via amalgamation

This page was built for publication: Unboundedness for recursion schemes: a simpler type system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560912)