Light genericity
From MaRDI portal
Publication:6629516
DOI10.1007/978-3-031-57231-9_2MaRDI QIDQ6629516
Adrienne Lancelot, Beniamino Accattoli
Publication date: 30 October 2024
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. Rev. ed.
- Proof nets and the call-by-value \(\lambda\)-calculus
- The weak lambda calculus as a reasonable machine
- Parametric \(\lambda \)-theories
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- Logic, language and computation. Festschrift in Honor of Satoru Takasu
- Modelling environments in call-by-value programming languages.
- On the algebraic models of lambda calculus
- Proving congruence of bisimulation in functional programming languages
- Call-by-Value Solvability, Revisited
- Open Call-by-Value
- Reduction Under Substitution
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Call-by-value Solvability
- Proving the genericity lemma by leftmost reduction is simple
- Lazy Lambda calculus: Theories, models and local structure characterization
- A Semantical and Operational Account of Call-by-Value Solvability
- Howe's method for higher-order languages
- No solvable lambda-value term left behind
- Full intersection types and topologies in lambda calculus
- Types of fireballs
- A lambda calculus satellite
- Factorization and normalization, essentially
- Strong call-by-value and multi types
This page was built for publication: Light genericity
