Pages that link to "Item:Q4899111"
From MaRDI portal
The following pages link to Linear Dependent Types and Relative Completeness (Q4899111):
Displayed 20 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Generalized bounded linear logic and its categorical semantics (Q2233407) (← links)
- Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)
- Graded modal dependent type theory (Q2233475) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- Mitigating Multi-target Attacks in Hash-Based Signatures (Q2798784) (← links)
- Towards a Formal Theory of Graded Monads (Q2811361) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- (Q4972738) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
- (Q5079730) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
- (Q5111324) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- Non-linearity as the Metric Completion of Linearity (Q5300890) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- (Q6079229) (← links)