Functional back-ends within the lambda-sigma calculus
From MaRDI portal
Publication:2817681
DOI10.1145/232627.232632zbMath1345.68056OpenAlexW2080165344MaRDI QIDQ2817681
Bruno Pagano, Luc Maranget, Thérèse Hardin
Publication date: 1 September 2016
Published in: Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00073659/file/RR-3034.pdf
Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
Resource operators for \(\lambda\)-calculus ⋮ The next 700 Krivine machines ⋮ Normalisation for higher-order calculi with explicit substitutions ⋮ Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions ⋮ Equational rules for rewriting logic
This page was built for publication: Functional back-ends within the lambda-sigma calculus
