A system of linear dependent types for the lambda calculus with full higher-order recursion,
called dlPCF, is introduced and proved sound and relatively complete. Completeness holds …

European researcher. 2010. № 1 Page 1 European Journal of Technology and Design,
2016, Vol.(14), Is. 4 164 Copyright © 2016 by Academic Publishing House Researcher …

We give a semantic account of the execution time (ie 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 …

We present a functional characterization of deterministic logspace-computable predicates
based on a variant (although not a subsystem) of propositional linear logic, which we call …

We show that time complexity analysis of higher-order functional programs can be effectively
reduced to an arguably simpler (although computationally equivalent) verification problem …

We present a polymorphic type system for lambda calculus ensuring that well-typed
programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a …

We propose a new type system for lambda-calculus ensuring that well-typed programs can
be executed in polynomial time: dual light affine logic (DIAL). DIAL has a simple type …

We graft synchronization onto Girard's Geometry of Interaction in its most concrete form,
namely token machines. This is realized by introducing proof-nets for SMLL, an extension of …

Linear dependent types [11] allow to precisely capture both the extensional behavior and
the time complexity of λ-terms, when the latter are evaluated by Krivine's abstract machine …

In this paper, we analyze the complexity of functional programs written in the interaction-net
computation model, an asynchronous, parallel and confluent model that generalizes linear …