Theoretical Computer Science
Information and Computation
Discreet Games, Light Affine Logic and PTIME Computation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Obsessional experiments for linear logic proof-nets
Mathematical Structures in Computer Science
Stratified coherence spaces: a denotational semantics for light linear logic
Theoretical Computer Science - Implicit computational complexity
Context Semantics, Linear Logic and Computational Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Quantitative Game Semantics for Linear Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Strong normalization property for second order linear logic
Theoretical Computer Science
Intersection Types for Light Affine Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
An invariant cost model for the lambda calculus
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Böhm trees, krivine's machine and the taylor expansion of lambda-terms
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Solvability in resource lambda-calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 5.23 |
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: (1) a net is head-normalizable (i.e. normalizable at depth 0) if and only if its interpretation in the multiset based relational semantics is not empty and (2) a net is normalizable if and only if its exhaustive interpretation (a suitable restriction of its interpretation) is not empty. We then give a semantic measure of execution time: we prove that we can compute the number of cut elimination steps leading to a cut free normal form of the net obtained by connecting two cut free nets by means of a cut-link, from the interpretations of the two cut free nets. These results are inspired by similar ones obtained by the first author for the untyped lambda-calculus.