S ‐Storage Operators | Zendy

Nour Karim | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

S ‐Storage Operators

Author(s) -

Nour Karim

Publication year - 1998

Publication title -

mathematical logic quarterly

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.473

H-Index - 28

eISSN - 1521-3870

pISSN - 0942-5616

DOI - 10.1002/malq.19980440107

Subject(s) - converse , successor cardinal , operator (biology) , mathematics , context (archaeology) , term (time) , function (biology) , discrete mathematics , mathematical analysis , physics , paleontology , biochemistry , chemistry , geometry , repressor , quantum mechanics , evolutionary biology , biology , transcription factor , gene

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 the present paper we define for every λ‐term S which realizes the successor function on Church integers the notion of S ‐storage operator. We prove that every storage operator is an S ‐storage operator. But the converse is not always true.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research