scientific article; zbMATH DE number 7533334
From MaRDI portal
Publication:5079730
DOI10.4230/LIPIcs.CSL.2018.9MaRDI QIDQ5079730
Patrick Baillot, Alexis Ghyselen
Publication date: 28 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear logic\(\lambda\)-calculustype systemsimplicit computational complexitypolynomial time complexitysize types
Related Items (3)
Combining linear logic and size types for implicit complexity ⋮ Unnamed Item ⋮ Causal computational complexity of distributed processes
Cites Work
- Unnamed Item
- Higher-order interpretations and program complexity
- Quasi-interpretations. A way to control resources
- A new recursion-theoretic characterization of the polytime functions
- Light linear logic
- Linear types and non-size-increasing polynomial time computation.
- Linear logic and elementary time
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- Linear dependent types in a call-by-value scenario
- The geometry of types
- Static prediction of heap space usage for first-order functional programs
- An Elementary Affine λ-Calculus with Multithreading and Side Effects
- A Higher-Order Characterization of Probabilistic Polynomial Time
- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
- Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
- A PolyTime Functional Language from Light Linear Logic
- Amortized Resource Analysis with Polynomial Potential
- Linear Dependent Types and Relative Completeness
- Static determination of quantitative resource usage for higher-order programs
- Multivariate amortized resource analysis
- Typed Lambda Calculi and Applications
This page was built for publication:
