The following pages link to (Q3142166):
Displaying 26 items.
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Word operation definable in the typed \(\lambda\)-calculus (Q1099156) (← links)
- Light linear logic (Q1271560) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Ordinals and ordinal functions representable in the simply typed lambda calculus (Q1302304) (← links)
- Safe recursion with higher types and BCK-algebra (Q1577481) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- Causal computational complexity of distributed processes (Q2112798) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158) (← links)
- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets (Q3638260) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations (Q5092382) (← links)
- (Q5094117) (← links)
- Polynomial Time in the Parametric Lambda Calculus. (Q5277846) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
