Pages that link to "Item:Q1577481"
From MaRDI portal
The following pages link to Safe recursion with higher types and BCK-algebra (Q1577481):
Displaying 23 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Linear types and non-size-increasing polynomial time computation. (Q1401943) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- Quantitative classical realizability (Q2343127) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- On Equivalences, Metrics, and Polynomial Time (Q2947890) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197) (← links)
- A Formalization of Polytime Functions (Q3088001) (← links)
- Tiering as a Recursion Technique (Q3370611) (← links)
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
- A new “feasible” arithmetic (Q4532603) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- The calculus of dependent lambda eliminations (Q5372010) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
