Pages that link to "Item:Q534698"
From MaRDI portal
The following pages link to A semantic measure of the execution time in linear logic (Q534698):
Displaying 19 items.
- A semantic account of strong normalization in linear logic (Q276260) (← links)
- Visible acyclic differential nets. I: Semantics (Q409321) (← links)
- The relational model is injective for multiplicative exponential linear logic (without weakenings) (Q435194) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- The bang calculus revisited (Q2039931) (← links)
- Exact bounds for acyclic higher-order recursion schemes (Q2112794) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Execution time of λ-terms via denotational semantics and intersection types (Q4577984) (← links)
- (Q4580329) (← links)
- (Q4611381) (← links)
- (Q5028444) (← links)
- (Q5076060) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- The bang calculus revisited (Q6116183) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Factorization and normalization, essentially (Q6536313) (← links)
- Strong call-by-value and multi types (Q6605354) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
