The parametric lambda calculus. A metamodel for computation.
From MaRDI portal
Publication:703856
DOI10.1007/978-3-662-10394-4zbMath1084.68020OpenAlexW2483114314WikidataQ57722206 ScholiaQ57722206MaRDI QIDQ703856
Luca Paolini, Simonetta Ronchi della Rocca
Publication date: 12 January 2005
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-10394-4
Functional programming and lambda calculus (68N18) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatory logic and lambda calculus (03B40)
Related Items (25)
Eager functions as processes ⋮ A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization ⋮ Bounded combinatory logic and lower complexity ⋮ Relational graph models, Taylor expansion and extensionality ⋮ Unnamed Item ⋮ Open Call-by-Value ⋮ Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Head reduction and normalization in a call-by-value lambda-calculus ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Parametric \(\lambda \)-theories ⋮ An irregular filter model ⋮ Factorization in call-by-name and call-by-value calculi via linear logic ⋮ Classical Call-by-Need and Duality ⋮ Strong normalization from an unusual point of view ⋮ ASMs and Operational Algorithmic Completeness of Lambda Calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Recursive Domain Equations of Filter Models ⋮ Logical Semantics for Stability ⋮ Abstracting models of strong normalization for classical calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Process-Model for Linear Programs ⋮ Unnamed Item ⋮ Essential and relational models
This page was built for publication: The parametric lambda calculus. A metamodel for computation.