A prismoid framework for languages with resources
From MaRDI portal
Publication:654907
DOI10.1016/j.tcs.2011.01.026zbMath1231.68103OpenAlexW2153961574MaRDI QIDQ654907
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
Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Node Replication: Theory And Practice ⋮ The spirit of node replication
Uses Software
Cites Work
- Linear logic
- Resource operators for \(\lambda\)-calculus
- Combinatory reduction systems: Introduction and survey
- Lambda-calculus with director strings
- A λ-calculus with explicit weakening and explicit substitution
- Local Bigraphs and Confluence: Two Conjectures
- λν, 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
- Proof nets and explicit substitutions
- Automath and Pure Type Systems
- Explicit Substitutions à la de Bruijn
- Explicit substitutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item