Pages that link to "Item:Q3000601"
From MaRDI portal
The following pages link to Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (Q3000601):
Displaying 12 items.
- A semantic account of strong normalization in linear logic (Q276260) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- Non-idempotent intersection types and strong normalisation (Q2851671) (← links)
- Call-by-Value Non-determinism in a Linear Logic Type Discipline (Q3455843) (← links)
- Non finitely generated types and λ-terms combinatoric representation cost (Q4522149) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- Execution time of λ-terms via denotational semantics and intersection types (Q4577984) (← links)
- Types as resources for classical natural deduction (Q5111320) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- (Q5208874) (← links)
- Essential and relational models (Q5269000) (← links)