Pages that link to "Item:Q3608417"
From MaRDI portal
The following pages link to A Soft Type Assignment System for λ-Calculus (Q3608417):
Displayed 12 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- Soft Linear Logic and Polynomial Complexity Classes (Q2866738) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Type Inference for a Polynomial Lambda Calculus (Q3638250) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)