scientific article; zbMATH DE number 7204428
From MaRDI portal
Publication:5111304
DOI10.4230/LIPICS.FSCD.2017.9zbMATH Open1434.68217MaRDI QIDQ5111304FDOQ5111304
Authors: Pablo Barenbaum, Eduardo Bonelli 
Publication date: 26 May 2020
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
- Title not available (Why is that?)
- Call-by-value solvability, revisited
- Computing in systems described by equations
- Title not available (Why is that?)
- The optimal implementation of functional programming languages
- Explicit substitutions
- Local bigraphs and confluence: two conjectures (extended abstract)
- The structural \(\lambda \)-calculus
- Beta reduction is invariant, indeed
- A nonstandard standardization theorem
- Distilling abstract machines
- Discrete normalization and standardization in deterministic residual structures
- Finite family developments
- Axiomatic rewriting theory II: the -calculus enjoys finite normalisation cones
- Reasoning about call-by-need by means of types
- On the Relative Usefulness of Fireballs
- Weak optimality, and the meaning of sharing
- A strong distillery
- (Leftmost-outermost) beta reduction is invariant, indeed
- Title not available (Why is that?)
- Generalized finite developments
- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
Cited In (7)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- Minimality in a linear calculus with iteration
- A Fresh Look at the λ-Calculus
- Title not available (Why is that?)
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Term Rewriting and Applications
- A nonstandard standardization theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111304)
