Parsimonious types and non-uniform computation

DOI10.1007/978-3-662-47666-6_28MaRDI QIDQ3449488zbMATH OpenOpenAlexFDO

Authors Damiano Mazza, Kazushige Terui

Publication date 4 November 2015

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-47666-6_28

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• Non-uniform polytime computation in the infinitary affine lambda-calculus
• Simple parsimonious types and logarithmic space
• Light types for polynomial time computation in lambda calculus
• scientific article; zbMATH DE number 512786
• scientific article; zbMATH DE number 445159

Cites work

• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 512786 (Why is no real title available?)
• A linearization of the Lambda-calculus and consequences
• A new recursion-theoretic characterization of the polytime functions
• An Explicit Formula for the Free Exponential Modality of Linear Logic
• An infinitary affine lambda-calculus isomorphic to the full lambda-calculus
• Asynchronous games. II: The true concurrency of innocence
• Full abstraction for PCF
• Geometry of synthesis: a structured approach to VLSI design
• Light linear logic
• Light types for polynomial time computation in lambda calculus
• Non-uniform polytime computation in the infinitary affine lambda-calculus
• Ramified Corecurrence and Logspace
• Simple parsimonious types and logarithmic space
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Upper Bounds on Stream I/O Using Semantic Interpretations

Cited in

(10)

• scientific article; zbMATH DE number 7561616 (Why is no real title available?)
• Non-uniform polytime computation in the infinitary affine lambda-calculus
• Implicit computation complexity in higher-order programming languages
• scientific article; zbMATH DE number 2080288 (Why is no real title available?)
• Simple parsimonious types and logarithmic space
• scientific article; zbMATH DE number 7356679 (Why is no real title available?)
• Infinitary cut-elimination via finite approximations
• On the runtime complexity of type-directed unboxing
• Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
• Polynomial time over the reals with parsimony

This page was built for publication: Parsimonious types and non-uniform computation

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