The parametric lambda calculus. A metamodel for computation.

DOI10.1007/978-3-662-10394-4zbMath1084.68020WikidataQ57722206 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

zbMATH Keywords

parametric lambda calculus; sets of input values

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68-02: Research exposition (monographs, survey articles) pertaining to computer science

03B40: Combinatory logic and lambda calculus

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Essential and relational models, Head reduction and normalization in a call-by-value lambda-calculus, Recursive Domain Equations of Filter Models, 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, Strong normalization from an unusual point of view, 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, Characterizing polynomial and exponential complexity classes in elementary lambda-calculus, Eager functions as processes, Factorization in call-by-name and call-by-value calculi via linear logic, Abstracting models of strong normalization for classical calculi, Logical Semantics for Stability, Classical Call-by-Need and Duality, Unnamed Item, Open Call-by-Value, ASMs and Operational Algorithmic Completeness of Lambda Calculus, A Process-Model for Linear Programs