A prismoid framework for languages with resources
From MaRDI portal
Publication:654907
DOI10.1016/J.TCS.2011.01.026zbMATH Open1231.68103OpenAlexW2153961574MaRDI QIDQ654907FDOQ654907
Publication date: 23 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.026
Recommendations
Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18)
Cites Work
- Automath and Pure Type Systems
- Linear logic
- Combinatory reduction systems: Introduction and survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Explicit substitutions
- Lambda-calculus with director strings
- A \(\lambda\)-calculus with explicit weakening and explicit substitution
- Local bigraphs and confluence: two conjectures (extended abstract)
- Title not available (Why is that?)
- λν, a calculus of explicit substitutions which preserves strong normalisation
- The Prismoid of Resources
- Perpetuality for Full and Safe Composition (in a Constructive Setting)
- The Structural λ-Calculus
- The Theory of Calculi with Explicit Substitutions Revisited
- Jumping Boxes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proof nets and explicit substitutions
- Explicit Substitutions à la de Bruijn
- Resource operators for \(\lambda\)-calculus
Cited In (3)
Uses Software
This page was built for publication: A prismoid framework for languages with resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654907)