A Soft Type Assignment System for λ-Calculus

DOI10.1007/978-3-540-74915-8_21zbMath1179.03062OpenAlexW1881110075MaRDI QIDQ3608417

Marco Gaboardi, Simonetta Ronchi della Rocca

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_21

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (12)

Higher-order interpretations and program complexity ⋮ The role of polymorphism in the characterisation of complexity by soft types ⋮ A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization ⋮ A Characterization of NC k by First Order Functional Programs ⋮ Light logics and higher-order processes ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Polynomial time over the reals with parsimony ⋮ Type Inference for a Polynomial Lambda Calculus ⋮ Linear logic by levels and bounded time complexity ⋮ On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy ⋮ Soft Linear Logic and Polynomial Complexity Classes ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: A Soft Type Assignment System for λ-Calculus