Algebraic interpretation of lambda calculus with resources
From MaRDI portal
Publication:6162097
DOI10.1007/3-540-61604-7_68zbMath1515.68095MaRDI QIDQ6162097
Publication date: 28 June 2023
Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- A calculus of mobile processes. I
- Full abstraction in the lazy lambda calculus
- Lambda-calculi for (strict) parallel functions
- The discriminating power of multiplicities in the \(\lambda\)-calculus
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Approximate Reduction and Lambda Calculus Models
- Confluence properties of weak and strong calculi of explicit substitutions
- Explicit substitutions
- Full abstraction for lambda calculus with resources and convergence testing
This page was built for publication: Algebraic interpretation of lambda calculus with resources