A meta lambda calculus with cross-level computation

DOI10.1145/2676726.2676976MaRDI QIDQ2819825zbMATH OpenOpenAlexFDO

Authors Kazunori Tobisawa

Publication date 29 September 2016

Published in Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2676726.2676976

zbMATH Keywords

dynamic bindinglambda calculusmetavariablestextual substitution

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Two-level lambda-calculus
• Formal metatheory of the lambda calculus using Stoughton's substitution
• Computer Science Logic
• The \(\lambda\)-context calculus
• Higher-order substitutions

Cited in

(3)

• Two-level lambda-calculus
• Computer Science Logic
• The parametric lambda calculus. A metamodel for computation.

This page was built for publication: A meta lambda calculus with cross-level computation

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