Parsimonious Types and Non-uniform Computation

DOI10.1007/978-3-662-47666-6_28zbMath1440.03041OpenAlexW2406902927MaRDI QIDQ3449488

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

Mathematics Subject Classification ID

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

Related Items (4)

Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach ⋮ Unnamed Item ⋮ Polynomial time over the reals with parsimony ⋮ Implicit computation complexity in higher-order programming languages

Cites Work

• Unnamed Item
• Unnamed Item
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Light types for polynomial time computation in lambda calculus
• A new recursion-theoretic characterization of the polytime functions
• Light linear logic
• Full abstraction for PCF
• Asynchronous games. II: The true concurrency of innocence
• Typing streams in the Λμ-calculus
• An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
• Geometry of synthesis
• An Explicit Formula for the Free Exponential Modality of Linear Logic
• Upper Bounds on Stream I/O Using Semantic Interpretations
• A linearization of the Lambda-calculus and consequences
• Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus
• Simple Parsimonious Types and Logarithmic Space
• Ramified Corecurrence and Logspace

This page was built for publication: Parsimonious Types and Non-uniform Computation