Functional back-ends within the lambda-sigma calculus
From MaRDI portal
Recommendations
- Functional runtime systems within the lambda-sigma calculus
- An extension of lambda-calculus for functional programming
- A consistent extension of the lambda-calculus as a base for functional programming languages
- Formalization of the functional programming languages based on lambda calculus
- scientific article; zbMATH DE number 3905828
- A calculus of lambda calculus contexts
- scientific article; zbMATH DE number 192881
- The Intensional Lambda Calculus
- The lambda-context calculus (extended version)
- The \(\lambda\)-context calculus
Cited in
(10)- Conditional lambda-theories and the verification of static properties of programs
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Equational rules for rewriting logic
- Normalisation for higher-order calculi with explicit substitutions
- State-transition machines for lambda-calculus expressions
- The next 700 Krivine machines
- Sequent calculus as a compiler intermediate language
- Functional runtime systems within the lambda-sigma calculus
- Programming Languages and Systems
- Resource operators for \(\lambda\)-calculus
This page was built for publication: Functional back-ends within the lambda-sigma calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817681)