A Soft Type Assignment System for λ-Calculus
From MaRDI portal
(Redirected from Publication:3608417)
Recommendations
Cited in
(16)- Linear logic by levels and bounded time complexity
- Polynomial time over the reals with parsimony
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- Higher-order interpretations and program complexity
- The role of polymorphism in the characterisation of complexity by soft types
- A type assignment for -calculus complete both for FPTIME and strong normalization
- Soft linear logic and polynomial complexity classes
- Light logics and higher-order processes
- The role of polymorphism in the characterisation of complexity by soft types
- A Characterization of NC k by First Order Functional Programs
- Type Inference for a Polynomial Lambda Calculus
- From light logics to type assignments: a case study
- Foundations of Software Science and Computation Structures
- Implicit computation complexity in higher-order programming languages
- Parallelism in soft linear logic
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
This page was built for publication: A Soft Type Assignment System for λ-Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608417)