<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">465743714</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323111814.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170327e19900701xx      s     000 0 fre  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF01792986</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF01792986</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Krivine</subfield>
   <subfield code="D">Jean-Louis</subfield>
   <subfield code="u">Equipe de Logique mathématique, Université Paris VII, C.N.R.S., Tour 45-55, 5e étage, 2 place 2, place Jussieu, F-75251, Paris Cedex 05, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Opérateurs de mise en mémoire et traduction de Gödel</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Jean-Louis Krivine]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Inλ-calculus, the strategy of leftmost reduction (&quot;call-by-name”) is known to have good mathematical properties; in particular, it always terminates when applied to a normalizable term. On the other hand, with this strategy, the argument of a function is re-evaluated at each time it is used. To avoid this drawback, we define the notion of &quot;storage operator”, for each data type. IfT is a storage operator for integers, for example, let us replace the evaluation, by leftmost reduction, ofϕτ (whereτ is an integer, andϕ anyλ-term) by the evaluation oftτϕ. Then, this computation is the same as the following: first computeτ up to some reduced formτ 0, and then applyϕ toτ 0. So, we have simulated &quot;call-by-value” evaluation within the strategy of leftmost reduction. The main theorem of the paper (Corollary of Theorem 4.1) shows that, in a second orderλ-calculus, using Gödel's translation of classical intuitionistic logic, we can find a very simple type (or specification) for storage operators. Thus, it gives a way to get such operators, which is to prove this type in second order intuitionistic predicate calculus.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 1990</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Archive for Mathematical Logic</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">30/4(1990-07-01), 241-267</subfield>
   <subfield code="x">0933-5846</subfield>
   <subfield code="q">30:4&lt;241</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">30</subfield>
   <subfield code="o">153</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF01792986</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF01792986</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Krivine</subfield>
   <subfield code="D">Jean-Louis</subfield>
   <subfield code="u">Equipe de Logique mathématique, Université Paris VII, C.N.R.S., Tour 45-55, 5e étage, 2 place 2, place Jussieu, F-75251, Paris Cedex 05, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Archive for Mathematical Logic</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">30/4(1990-07-01), 241-267</subfield>
   <subfield code="x">0933-5846</subfield>
   <subfield code="q">30:4&lt;241</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">30</subfield>
   <subfield code="o">153</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
