A Fresh Look at the λ-Calculus
From MaRDI portal
Publication:5089000
DOI10.4230/LIPIcs.FSCD.2019.1OpenAlexW2998508153MaRDI QIDQ5089000
Publication date: 18 July 2022
Full work available at URL: https://hal.archives-ouvertes.fr/hal-02415786
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semantic measure of the execution time in linear logic
- Linear logic
- Proof nets and the call-by-value \(\lambda\)-calculus
- A calculus of mobile processes. I
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- Reversible, irreversible and optimal \(\lambda\)-machines
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Proof nets and the linear substitution calculus
- Stratified coherence spaces: A denotational semantics for light linear logic
- Parallel beta reduction is not elementary recursive
- Parametric parameter passing \(\lambda\)-calculus
- Implementing open call-by-value
- On the value of variables
- Strongly reducing variants of the Krivine abstract machine
- (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
- Reasoning About Call-by-need by Means of Types
- A reflection on call-by-value
- Distilling abstract machines
- The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus
- Local Bigraphs and Confluence: Two Conjectures
- Call-by-Value Solvability, Revisited
- On Constructor Rewrite Systems and the Lambda Calculus
- The duality of computation
- A compiled implementation of strong reduction
- Estimation of the Length of Interactions in Arena Game Semantics
- Open Call-by-Value
- A Strong Distillery
- Quantitative Game Semantics for Linear Logic
- Space-Efficient Computation by Interaction
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- On Constructor Rewrite Systems and the Lambda-Calculus
- Functions as processes
- The call-by-need lambda calculus
- Deriving a lazy abstract machine
- Execution time of λ-terms via denotational semantics and intersection types
- Beta reduction is invariant, indeed
- The geometry of synchronization
- On the Relative Usefulness of Fireballs
- Parallelism and Synchronization in an Infinitary Context
- Explicit substitutions
- Call-by-value Solvability
- GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION
- The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
- Tight typings and split bounds, fully developed
- Compiling with continuations, continued
- Weighted Relational Models of Typed Lambda-Calculi
- Slot games
- Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction
- A non-deterministic call-by-need lambda calculus
- Simple Parsimonious Types and Logarithmic Space
- The geometry of parallelism: classical, probabilistic, and quantum effects
- A nonstandard standardization theorem
- A Semantical and Operational Account of Call-by-Value Solvability
- Call-by-Value -calculus and LJQ
- Derivational Complexity Is an Invariant Cost Model
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Logical Approaches to Computational Barriers
- Types by need
- Types of fireballs
This page was built for publication: A Fresh Look at the λ-Calculus
