Unraveling recursion: compiling an IR with recursion to System F

DOI10.1007/978-3-030-33636-3_15MaRDI QIDQ2176691zbMATH OpenOpenAlexFDO

Authors Michael Peyton Jones, Vasilis Gkoumas, Roman Kireev, Kenneth MacKenzie, Chad Nester, Philip Wadler

Publication date 5 May 2020

Full work available at URL https://www.pure.ed.ac.uk/ws/files/129967828/Unravelling_Recursion_JONES_DOA14062019_AFV.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 4096777
• scientific article; zbMATH DE number 3887103
• scientific article; zbMATH DE number 578218
• Unifying structured recursion schemes. An extended study
• Compilation of extended recursion in call-by-value functional languages
• scientific article; zbMATH DE number 572153
• Verifying and synthesizing software with recursive functions (invited contribution)
• A methodology for synthesis of recursive functional programs

Cited in

(2)

• Translation certification for smart contracts
• Compilation of extended recursion in call-by-value functional languages

This page was built for publication: Unraveling recursion: compiling an IR with recursion to System F

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