论文信息 - Constructive λ-models

Constructive λ-models

Abstract We prove in this paper that there is a partial order P such that for every (classical) extensional countable λ-model M there exists an object U in Set P op and a bijection ƒ : such that the λ-model defined from U and ƒ has the same equational theory as M .

Andreas Knobel | Andreas Knobel

[1] A. Troelstra. Constructivism in mathematics , 1988 .

[2] H. Barendregt,et al. Are there countable topological combinatory algebras , 1986 .

[3] E. Moggi. The partial lambda calculus , 1988 .

[4] Alley Stoughton,et al. Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[5] Michael P. Fourman,et al. Sheaf models for set theory , 1980 .

[6] A. Scedrov. Intuitionistic Set Theory , 1985 .

[7] S. Lane. Categories for the Working Mathematician , 1971 .

[8] Glynn Winskel,et al. Events in computation , 1980 .

[9] Christiaan Peter Jozef Koymans,et al. Models of the Lambda Calculus , 1982, Inf. Control..

[10] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[11] Zadour Khachadourian,et al. On the homology theory of modules , 1970 .

[12] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .