Pages that link to "Item:Q2904629"
From MaRDI portal
The following pages link to On constructor rewrite systems and the lambda calculus (Q2904629):
Displaying 12 items.
- A combination framework for complexity (Q276251) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- (In)efficiency and reasonable cost models (Q2333310) (← links)
- Enriching the lambda calculus with contexts: toward a theory of incremental program construction (Q2817703) (← links)
- A Lambda-Calculus with Constructors (Q3527294) (← links)
- A Polymorphic Type System for the Lambda-Calculus with Constructors (Q3637198) (← links)
- The λ-calculus with constructors: Syntax, confluence and separation (Q3644936) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- Counting environments and closures (Q4993337) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)