Automatically splitting a two-stage lambda calculus

DOI10.1007/978-3-662-49498-1_11MaRDI QIDQ2802484zbMATH OpenOpenAlexFDO

Authors Nicolas Feltman, Umut A. Acar, Kayvon Fatahalian, Carlo Angiuli

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49498-1_11

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Type-specialized staged programming with process separation
• A modal analysis of staged computation
• Lambda-splitting: a higher-order approach to cross-module optimizations
• Staged computation with staged lexical scope
• Staged computation with names and necessity

Cites work

• A modal analysis of staged computation
• A partial evaluator for the untyped lambda-calculus
• Automatic autoprojection of recursive equations with global variables and abstract data types
• Computer Science Logic
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• MetaML and multi-stage programming with explicit annotations
• Staged computation with names and necessity
• Two-Level Functional Languages

Cited in

(4)

• Type-specialized staged programming with process separation
• How to Split Recursive Automata
• Lambda-splitting: a higher-order approach to cross-module optimizations
• Staged computation with names and necessity

Describes a project that uses

Uses Software

• MiniML
• Twelf
• Find
• OpenGL

This page was built for publication: Automatically splitting a two-stage lambda calculus

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