The following pages link to (Q4218937):
Displaying 17 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations (Q1392661) (← links)
- Polytime, combinatory logic and positive safe induction (Q1407533) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Safe recursion with higher types and BCK-algebra (Q1577481) (← links)
- On an interpretation of safe recursion in light affine logic (Q1827399) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- On Equivalences, Metrics, and Polynomial Time (Q2947890) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
- (Q5079730) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Cyclic implicit complexity (Q6649449) (← links)