Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.68375DBLPconf/cie/2006OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898807

Ugo Dal Lago, Simone Martini

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Complexity bounds for container functors and comonads ⋮ The weak lambda calculus as a reasonable machine ⋮ A semantic measure of the execution time in linear logic ⋮ A Fresh Look at the λ-Calculus ⋮ (In)efficiency and reasonable cost models ⋮ Minimality in a Linear Calculus with Iteration

This page was built for publication: Logical Approaches to Computational Barriers