Some New Results on Easy lambda-Terms
暂无分享,去创建一个
[1] Cecile Zylberajch. Syntaxe et semantique de la facilite en lambda-calcul , 1991 .
[2] Hendrik Pieter Barendregt. Representing 'undefined' in lambda Calculus , 1992, J. Funct. Program..
[3] J. Baeten,et al. Ω Can be anything it should not be , 1979 .
[4] Giuseppe Jacopini,et al. A condition for identifying two elements of whatever model of combinatory logic , 1975, Lambda-Calculus and Computer Science Theory.
[5] Richard Statman. Normal varieties of combinators , 1992 .
[6] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .