Recommendations
Cites work
- (Leftmost-outermost) beta reduction is invariant, indeed
- A calculus of mobile processes. I
- A compiled implementation of strong reduction
- A non-deterministic call-by-need lambda calculus
- A nonstandard standardization theorem
- A reflection on call-by-value
- A semantic measure of the execution time in linear logic
- A Semantical and Operational Account of Call-by-Value Solvability
- A strong distillery
- An abstract factorization theorem for explicit substitutions
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- Beta reduction is invariant, indeed
- Bounding skeletons, locally scoped terms and exact bounds for linear head reduction
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Call-by-value Solvability
- Call-by-value solvability, revisited
- Call-by-Value -calculus and LJQ
- Collapsing non-idempotent intersection types
- Compiling with continuations, continued
- Derivational complexity is an invariant cost model
- Deriving a lazy abstract machine
- Distilling abstract machines
- Estimation of the length of interactions in arena game semantics
- Evaluating functions as processes
- Execution time of λ-terms via denotational semantics and intersection types
- Explicit substitutions
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Full abstraction in the lazy lambda calculus
- Functions as processes
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- scientific article; zbMATH DE number 1670494 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 482822 (Why is no real title available?)
- scientific article; zbMATH DE number 1953273 (Why is no real title available?)
- scientific article; zbMATH DE number 2044494 (Why is no real title available?)
- scientific article; zbMATH DE number 1500649 (Why is no real title available?)
- scientific article; zbMATH DE number 7204428 (Why is no real title available?)
- Implementing open call-by-value
- Linear logic
- Local bigraphs and confluence: two conjectures (extended abstract)
- Logical Approaches to Computational Barriers
- On constructor rewrite systems and the lambda calculus
- On Constructor Rewrite Systems and the Lambda-Calculus
- On the invariance of the unitary cost model for head reduction
- On the Relative Usefulness of Fireballs
- On the value of variables
- Open call-by-value
- Parallel beta reduction is not elementary recursive
- Parallelism and synchronization in an infinitary context
- Parametric parameter passing \(\lambda\)-calculus
- Proof nets and the call-by-value \(\lambda\)-calculus
- Proof nets and the linear substitution calculus
- Quantitative Game Semantics for Linear Logic
- Reasoning about call-by-need by means of types
- Reversible, irreversible and optimal \(\lambda\)-machines
- Simple parsimonious types and logarithmic space
- Slot games: a quantitative model of computation
- Space-Efficient Computation by Interaction
- Stratified coherence spaces: A denotational semantics for light linear logic
- Strongly reducing variants of the Krivine abstract machine
- The call-by-need lambda calculus
- The duality of computation
- The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
- The geometry of concurrent interaction: handling multiple ports by way of multiple tokens
- The geometry of parallelism: classical, probabilistic, and quantum effects
- The geometry of synchronization
- The useful MAM, a reasonable implementation of the strong -calculus
- Tight typings and split bounds, fully developed
- Types by need
- Types of fireballs
- Weighted relational models of typed lambda-calculi
Cited in
(4)
This page was built for publication: A Fresh Look at the λ-Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089000)
