S-Storage Operators

DOI10.1002/MALQ.19980440107MaRDI QIDQ4379630zbMATH OpenOpenAlexFDO

Authors Karim Nour

Publication date 4 March 1998

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.0770

zbMATH Keywords

call by namecall by valueChurch integershead reductionstorage operator

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Specification and verification (program logics, model checking, etc.) (68Q60)

Abstract: In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church integers, the "call by value" in a context of a "call by name" strategy. In this present paper, we define, for every $lambda$-term S which realizes the successor function on Church integers, the notion of S-storage operator. We prove that every storage operator is a $S-storage operator. But the converse is not always true.

Recommendations

• On Storage Operators
• scientific article; zbMATH DE number 458872
• Strong storage operators and data types

Cited in

(1)

• scientific article; zbMATH DE number 458872 (Why is no real title available?)

This page was built for publication: S-Storage Operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379630)