scientific article; zbMATH DE number 7526055
From MaRDI portal
Publication:5076060
Publication date: 12 May 2022
Full work available at URL: https://arxiv.org/abs/1904.10800
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Quantitative global memory ⋮ The bang calculus revisited ⋮ The bang calculus revisited ⋮ On reduction and normalization in the computational core
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semantic account of strong normalization in linear logic
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- A relational semantics for parallelism and non-determinism in a functional setting
- A semantic measure of the execution time in linear logic
- 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
- Normal functors, power series and \(\lambda\)-calculus
- An extension of basic functionality theory for \(\lambda\)-calculus
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- An equivalence between lambda- terms
- A Resource Aware Computational Interpretation for Herbelin’s Syntax
- Non-idempotent intersection types and strong normalisation
- Call-by-Value Solvability, Revisited
- A compiled implementation of strong reduction
- Open Call-by-Value
- A new type assignment for λ-terms
- Call-by-Value Non-determinism in a Linear Logic Type Discipline
- A linearization of the Lambda-calculus and consequences
- Execution time of λ-terms via denotational semantics and intersection types
- On the Relative Usefulness of Fireballs
- Non-idempotent intersection types for the Lambda-Calculus
- Tight typings and split bounds, fully developed
- Types, potency, and idempotency
- Head reduction and normalization in a call-by-value lambda-calculus
- Essential and relational models
- Standardization of a Call-By-Value Lambda-Calculus
- A Semantical and Operational Account of Call-by-Value Solvability
- On phase semantics and denotational semantics: The exponentials
- Types by need
- Types of fireballs
This page was built for publication: