Compilation of extended recursion in call-by-value functional languages

DOI10.1007/s10990-009-9042-zzbMath1183.68140arXiv0902.1257OpenAlexW3101389771MaRDI QIDQ848739

Xavier Leroy, J. B. Wells, Tom Hirschowitz

Publication date: 5 March 2010

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.1257

zbMATH Keywords

functional languagesrecursionsemanticscompilation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items (3)

Compilation of extended recursion in call-by-value functional languages ⋮ Well-founded coalgebras, revisited ⋮ An abstract monadic semantics for value recursion

Uses Software

• ML
• Haskell
• OCaml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• Compilation of extended recursion in call-by-value functional languages
• The categorical abstract machine
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Revised report on the algorithmic language scheme
• A syntactic approach to type soundness
• Skew confluence and the lambda calculus with letrec
• Recursive monadic bindings
• A type system for well-founded recursion
• Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
• An abstract monadic semantics for value recursion
• The recursive record semantics of objects revisited
• A type system for recursive modules
• Recursive structures for standard ML
• Functional and Logic Programming
• Programming Languages and Systems

This page was built for publication: Compilation of extended recursion in call-by-value functional languages