Parametric \(\lambda \)-theories
From MaRDI portal
Publication:930867
DOI10.1016/j.tcs.2008.01.021zbMath1145.68013OpenAlexW2048932540WikidataQ57722180 ScholiaQ57722180MaRDI QIDQ930867
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.021
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- The parametric lambda calculus. A metamodel for computation.
- The lambda calculus, its syntax and semantics
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- A discrimination algorithm inside \(\lambda -\beta\)-calculus
- Full abstraction in the lazy lambda calculus
- Parametric parameter passing \(\lambda\)-calculus
- Locus Solum: From the rules of logic to the logic of rules
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Foundations of Software Science and Computation Structures
This page was built for publication: Parametric \(\lambda \)-theories