Pages that link to "Item:Q541228"
From MaRDI portal
The following pages link to Quasi-interpretations. A way to control resources (Q541228):
Displaying 21 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Resource control for synchronous cooperative threads (Q2503040) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Upper Bounds on Stream I/O Using Semantic Interpretations (Q3644754) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q4580325) (← links)
- (Q5013812) (← links)
- (Q5014441) (← links)
- (Q5079730) (← links)
- (Q5094117) (← links)
- (Q5141617) (← links)
- Read/write factorizable programs (Q6113488) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)