Efficient multi-variate abstraction using an array representation for combinators.

DOI10.1016/S0020-0190(02)00318-6MaRDI QIDQ1853162zbMATH OpenFDO

Authors Antoni Diller

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(02)00318-6

zbMATH Keywords

Bracket abstractionCombinatory logicCompilersFunctional programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites work

• A new implementation technique for applicative languages
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• Variable abstraction in O(n log n) space

This page was built for publication: Efficient multi-variate abstraction using an array representation for combinators.

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