V→M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions

DOI10.1007/11431664_6MaRDI QIDQ5423545zbMATH OpenOpenAlexFDO

Authors Baltasar Trancón y Widemann

Publication date 23 October 2007

Published in Implementation and Application of Functional Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11431664_6

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Algebraic correctness proofs for compiling recursive function definitions with strictness information
• A strict functional language with cyclic recursive data
• Generating function versions with rational strictness patterns
• Structured general corecursion and coinductive graphs (extended abstract)
• Transfinite corecursion

This page was built for publication: V→M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions

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