Automatically splitting a two-stage lambda calculus

DOI10.1007/978-3-662-49498-1_11zbMATH Open1335.68032OpenAlexW2489156759MaRDI QIDQ2802484FDOQ2802484

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

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• A modal analysis of staged computation
• Title not available (Why is that?)
• Computer Science Logic
• Two-Level Functional Languages
• Automatic autoprojection of recursive equations with global variables and abstract data types
• MetaML and multi-stage programming with explicit annotations
• A partial evaluator for the untyped lambda-calculus
• Staged computation with names and necessity

Cited In (4)

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

Uses Software

• OpenGL
• Twelf
• Find
• MiniML

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)