Review: Roger Hindley, Axioms for Strong Reduction in Combinatory Logic; Bruce Lercher, The Decidability of Hindley's Axioms for Strong Reduction
Curry, Haskell B.
J. Symbolic Logic, Tome 36 (1971) no. 1, p. 171-172 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1971-03-14
Classification:  
@article{1183737548,
     author = {Curry, Haskell B.},
     title = {Review: Roger Hindley, Axioms for Strong Reduction in Combinatory Logic; Bruce Lercher, The Decidability of Hindley's Axioms for Strong Reduction},
     journal = {J. Symbolic Logic},
     volume = {36},
     number = {1},
     year = {1971},
     pages = { 171-172},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183737548}
}

Curry, Haskell B. Review: Roger Hindley, Axioms for Strong Reduction in Combinatory Logic; Bruce Lercher, The Decidability of Hindley's Axioms for Strong Reduction. J. Symbolic Logic, Tome 36 (1971) no. 1, pp.  171-172. http://gdmltest.u-ga.fr/item/1183737548/