A Soft Type Assignment System for λ-Calculus
From MaRDI portal
Publication:3608417
DOI10.1007/978-3-540-74915-8_21zbMath1179.03062MaRDI 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
03F52: Proof-theoretic aspects of linear logic and other substructural logics
03B40: Combinatory logic and lambda calculus
Related Items
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, Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca, 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, Light logics and higher-order processes, A Characterization of NC k by First Order Functional Programs, Type Inference for a Polynomial Lambda Calculus