Two-Level Functional Languages

Více o knize

The book introduces a framework that enhances functional programming languages by incorporating binding time notation, allowing for a clearer distinction between run-time and compile-time. It extends lambda calculus with this distinction and presents methods for integrating run-time combinators. The mixed lambda-calculus and combinatory logic are explored, utilizing "parametrized semantics" for code generation and abstract interpretation. The focus includes a new abstract machine design and a generalized strictness analysis, which improves code generation efficiency.