Simple parsimonious types and logarithmic space

DOI10.4230/LIPICS.CSL.2015.24MaRDI QIDQ5351948zbMATH OpenOpenAlexFDO

Authors Damiano Mazza

Publication date 31 August 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.CSL.2015.24

zbMATH Keywords

geometry of interactionimplicit computational complexitylinear logic

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• Logic programming and logarithmic space
• Space-Efficient Computation by Interaction
• A logical account of pspace
• Parsimonious types and non-uniform computation
• Soft linear logic and polynomial complexity classes

Cited in

(15)

• Polynomial time over the reals with parsimony
• Logic programming and logarithmic space
• Parsimonious types and non-uniform computation
• Simple Types in Type Theory: Deep and Shallow Encodings
• Space-Efficient Computation by Interaction
• Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
• A Fresh Look at the λ-Calculus
• scientific article; zbMATH DE number 7561616 (Why is no real title available?)
• Implicit computation complexity in higher-order programming languages
• Reasonable space for the -calculus, logarithmically
• Infinitary cut-elimination via finite approximations
• (Definitely not) boring interaction abstract machines
• Reasonable space for the -calculus, logarithmically
• Comparison-free polyregular functions
• Slightly nonlinear higher-order tree transducers

This page was built for publication: Simple parsimonious types and logarithmic space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351948)