Lambda-calcul, évaluation paresseuse et mise en mémoire
From MaRDI portal
DOI10.1051/ITA/1991250100671zbMATH Open0717.03003OpenAlexW73907625MaRDI QIDQ3204440FDOQ3204440
Publication date: 1991
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92382
Recommendations
- On Storage Operators
- The call-by-need lambda calculus
- Opérateurs de mise en mémoire et traduction de Gödel. (Storage operators and Gödel translation)
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus
- Lazy lambda calculus: theories, models and local structure characterization (extended abstract)
Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Cites Work
Cited In (6)
- About classical logic and imperative programming
- Opérateurs de mise en mémoire et types $\forall $-positifs
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus
- Strong storage operators and data types
- Storage operators and directed lambda-calculus
- An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus
This page was built for publication: Lambda-calcul, évaluation paresseuse et mise en mémoire
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204440)