Parsimonious types and non-uniform computation
From MaRDI portal
Publication:3449488
DOI10.1007/978-3-662-47666-6_28zbMATH Open1440.03041OpenAlexW2406902927MaRDI QIDQ3449488FDOQ3449488
Kazushige Terui, Damiano Mazza
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
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)
Cites Work
- Full abstraction for PCF
- Light types for polynomial time computation in lambda calculus
- A new recursion-theoretic characterization of the polytime functions
- Light linear logic
- Geometry of synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linearization of the Lambda-calculus and consequences
- Ramified Corecurrence and Logspace
- Uniformity and the Taylor expansion of ordinary lambda-terms
- Asynchronous games. II: The true concurrency of innocence
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- Typing streams in the Λμ-calculus
- Simple Parsimonious Types and Logarithmic Space
- Upper Bounds on Stream I/O Using Semantic Interpretations
- An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus
Cited In (7)
- Title not available (Why is that?)
- Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach
- Implicit computation complexity in higher-order programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the runtime complexity of type-directed unboxing
- 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)
