An authenticated data structure (ADS) is a data structure whose operations can be carried
out by an untrusted prover, the results of which a verifier can efficiently check as authentic …

We give a formalised and machine-checked account of computability theory in the Calculus
of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof …

Whether the number of β-steps in the λ-calculus can be taken as a reasonable time cost
model (that is, polynomially related to the one of Turing machines) is a delicate problem …

The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and
closed terms, that are natural hypotheses in the study of programming languages. To model …

We formalise a weak call-by-value λ-calculus we call L in the constructive type theory of Coq
and study it as a minimal functional programming language and as a model of computation …

We provide a plugin extracting Coq functions of simple polymorphic types to the (untyped)
call-by-value $\lambda $-calculus L. The plugin is implemented in the MetaCoq framework …

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 …

In CSL-LICS 2014, Accattoli and Dal Lago [1] showed that there is an implementation of the
ordinary (ie strong, pure, call-by-name) λ-calculus into models like RAM machines which is …

The lambda-calculus is a widely accepted computational model of higher-order functional
programs, yet there is not any direct and universally accepted cost model for it. As a …

Programming resource-sensitive systems, such as real-time embedded systems, requires
guaranteeing both the functional correctness of computations and also that time and space …