scientific article; zbMATH DE number 6260591

zbMath1282.68005MaRDI QIDQ5397484

Andrea Asperti, Stefano Guerrini

Publication date: 21 February 2014

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (31)

Reducibility between classes of port graph grammar. ⋮ (Optimal) duplication is not elementary recursive ⋮ Non-linearity as the Metric Completion of Linearity ⋮ Phase semantics and decidability of elementary affine logic ⋮ Resource operators for \(\lambda\)-calculus ⋮ Abstract machines, optimal reduction, and streams ⋮ Light logics and optimal reduction: completeness and complexity ⋮ Spinal atomic \(\lambda\)-calculus ⋮ Unnamed Item ⋮ Linear dependent types in a call-by-value scenario ⋮ Unnamed Item ⋮ A prismoid framework for languages with resources ⋮ The weak lambda calculus as a reasonable machine ⋮ The graphical Krivine machine ⋮ On randomised strategies in the \(\lambda \)-calculus ⋮ Preface to the special volume ⋮ New Developments in Environment Machines ⋮ Lambda-calculus with director strings ⋮ Unnamed Item ⋮ Jumping Boxes ⋮ Unnamed Item ⋮ Interaction Nets with McCarthy's amb ⋮ Is the Optimal Implementation Inefficient? Elementarily Not ⋮ Interaction nets for linear logic ⋮ Proof nets, garbage, and computations ⋮ Parallel beta reduction is not elementary recursive ⋮ A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine ⋮ The evaluation of first-order substitution is monadic second-order compatible ⋮ Complete Laziness: a Natural Semantics ⋮ Token-passing Nets for Functional Languages ⋮ Relating conflict-free stable transition and event models via redex families

This page was built for publication: