Pages that link to "Item:Q930866"
From MaRDI portal
The following pages link to The weak lambda calculus as a reasonable machine (Q930866):
Displaying 12 items.
- Realizability models and implicit complexity (Q534712) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus (Q2820681) (← links)
- Open Call-by-Value (Q3179293) (← links)
- COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY (Q5024502) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Strong call-by-value and multi types (Q6605354) (← links)
- Light genericity (Q6629516) (← links)
