Loops in combinator-based compilers

DOI10.1016/S0019-9958(83)80041-2MaRDI QIDQ3334057zbMATH OpenWikidataFDO

Authors Mitchell Wand

Publication date 1983

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(83)80041-2

zbMATH Keywords

combinatorscompilationcompiler writer's virtual machinecorrectnessexplicit loopslambda-calculustransformations

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Combinator-based compilation of recursive functions with different parameter passing modes
• Incorporating static analysis in a combinator-based compiler
• scientific article; zbMATH DE number 4035191
• scientific article; zbMATH DE number 3846829
• Combinators for program generation

Cited in

(7)

• Combinator-based compilation of recursive functions with different parameter passing modes
• Incorporating static analysis in a combinator-based compiler
• Extending the loop language with higher-order procedural variables
• scientific article; zbMATH DE number 4035191 (Why is no real title available?)
• scientific article; zbMATH DE number 234026 (Why is no real title available?)
• The compiler forest
• Correctness of procedure representations in higher-order assembly language

This page was built for publication: Loops in combinator-based compilers

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