Pages that link to "Item:Q5111914"
From MaRDI portal
The following pages link to Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus (Q5111914):
Displaying 12 items.
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Functional programs as compressed data (Q526441) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking (Q2946341) (← links)
- Execution time of λ-terms via denotational semantics and intersection types (Q4577984) (← links)
- (Q4625705) (← links)
- (Q4919765) (← links)
- Lambda calculus with algebraic simplification for reduction parallelisation: Extended study (Q5016210) (← links)
- (Q5092325) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) (← links)
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms (Q6635503) (← links)