A type system for well-founded recursion

DOI10.1145/964001.964026zbMath1325.68046OpenAlexW2140764366MaRDI QIDQ3452268

Derek R. Dreyer

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964026

zbMATH Keywords

recursiontype systemsrecursive moduleseffect systems

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Compilation of extended recursion in call-by-value functional languages ⋮ Path resolution for nested recursive modules ⋮ Type-specialized staged programming with process separation

This page was built for publication: A type system for well-founded recursion