Pages that link to "Item:Q276268"
From MaRDI portal
The following pages link to A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268):
Displaying 9 items.
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- The bang calculus revisited (Q2039931) (← links)
- (Q2766796) (← links)
- An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types (Q3612624) (← links)
- (Q5076060) (← links)
- Types as resources for classical natural deduction (Q5111320) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic (Q5412171) (← links)
- The bang calculus revisited (Q6116183) (← links)