A type system for well-founded recursion

DOI10.1145/964001.964026MaRDI QIDQ3452268zbMATHOpenAlexFDO

Authors Derek 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)

Recommendations

• A type system for recursive modules
• Recursive modules for programming
• scientific article; zbMATH DE number 3874579
• scientific article; zbMATH DE number 1670732
• Simple general recursion in type theory

Cited in

(7)

• Path resolution for nested recursive modules
• Type-specialized staged programming with process separation
• scientific article; zbMATH DE number 179038 (Why is no real title available?)
• System F-omega with equirecursive types for datatype-generic programming
• A type system for recursive modules
• scientific article; zbMATH DE number 5142784 (Why is no real title available?)
• Compilation of extended recursion in call-by-value functional languages

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

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