Pages that link to "Item:Q1004289"
From MaRDI portal
The following pages link to Light types for polynomial time computation in lambda calculus (Q1004289):
Displaying 23 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Light logics and optimal reduction: completeness and complexity (Q627123) (← links)
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- Parsimonious Types and Non-uniform Computation (Q3449488) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- Type Inference for a Polynomial Lambda Calculus (Q3638250) (← links)
- Modular Inference of Linear Types for Multiplicity-Annotated Arrows (Q5041106) (← links)
- (Q5094117) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Non-linearity as the Metric Completion of Linearity (Q5300890) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
