论文信息 - Towards a theory of type structure

Towards a theory of type structure

7)(D) = B[w][71t]#D] and delta is a functor from Funct(C, C) into C. Even before defining the functors arrow and delta, it can be shown that B maps every type expression into a functor from C T into C, that w = w' implies B[w] = B[w'], and that B[WlI: 2](~) = B[Wl][ D I t I B[w2](D) ] B[WlI~2](7) = B[Wl][ ~ I t I B[w2](~) ]

John C. Reynolds | J. C. Reynolds

[1] Thomas E. Cheatham,et al. On the basis for ELF: an extensible language facility , 1968, AFIPS '68 (Fall, part II).

[2] James H. Morris,et al. Types are not sets , 1973, POPL.

[3] Michael J. Fischer,et al. Mode modules as representations of domains: preliminary report , 1973, POPL.

[4] James H. Morris. Protection in programming languages , 1973, CACM.

[5] Michael J. Fischer,et al. Mode Modules as Representations of Domains. , 1973 .

[6] B. J. Mailloux,et al. Report on the Algorithmic Language ALGOL 68 , 1969 .

[7] James H. Morris,et al. Lambda-calculus models of programming languages. , 1969 .

[8] S. Maclane,et al. Categories for the Working Mathematician , 1971 .

[9] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .

[10] Francis Lockwood Morris. Correctness of translations of programming languages--an algebraic approach , 1972 .

[11] Dana S. Scott. Mathematical concepts in programming language semantics , 1971, AFIPS '72 (Spring).

[12] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..