scientific article; zbMATH DE number 7205322

DOI10.4230/LIPIcs.RTA.2012.22zbMath1437.68039arXiv1202.1641MaRDI QIDQ5111892

Beniamino Accattoli, Ugo Dal Lago

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1202.1641

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lambda calculusexplicit substitutionsimplicit computational complexitycost models

Mathematics Subject Classification ID

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

Related Items (8)

On sharing, memoization, and polynomial time ⋮ On the value of variables ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Tight typings and split bounds, fully developed ⋮ A Fresh Look at the λ-Calculus ⋮ Call-by-value lambda calculus as a model of computation in Coq ⋮ Processes against tests: on defining contextual equivalences ⋮ (In)efficiency and reasonable cost models

This page was built for publication: