The following pages link to The Structural λ-Calculus (Q3586054):
Displaying 23 items.
- A prismoid framework for languages with resources (Q654907) (← links)
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- The bang calculus revisited (Q2039931) (← links)
- The spirit of node replication (Q2233421) (← links)
- Classical By-Need (Q2802497) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- (Q4972738) (← links)
- (Q5014809) (← links)
- (Q5111304) (← links)
- (Q5111320) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- (Q5140267) (← links)
- (Q5208874) (← links)
- (Q5856410) (← links)
- The bang calculus revisited (Q6116183) (← links)
- A strong call-by-need calculus (Q6135746) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)
- A strong bisimulation for a classical term calculus (Q6563051) (← links)
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications (Q6597960) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
- Preorder-constrained simulations for program refinement with effects (Q6666773) (← links)
