Nov 12, 2005 · We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis.

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines ...

We propose to measure the efficiency of any implementation of the λ-calculus as a function of a new parameter v, that is itself a function of any λ-expression.

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines ...

We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics [12, ...

An Invariant Cost Model for the Lambda Calculus. Lago, U. D. & Martini, S. In Beckmann, A., Berger, U., Löwe, B., & Tucker, J. V., editors, ...

An Invariant Cost Model for the Lambda Calculus. Lago, U. D. & Martini, S. CoRR, 2005. An Invariant Cost Model for the Lambda Calculus [link] Paper bibtex

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines ...

An Invariant Cost Model for the Lambda Calculus. U. Lago, and S. Martini. CoRR, (2005 ). 1. 1. Meta data. BibTeX key: journals/corr/abs-cs-0511045; entry type ...

In this paper, we show that when head reduction is the underlying dynamics, the unitary cost model is indeed invariant. This improves on known results, which ...