POLYMORPHISM IS NOT SET-THEORETIC

被引:0
作者
REYNOLDS, JC [1 ]
机构
[1] SYRACUSE UNIV,SYRACUSE,NY 13210
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:145 / 156
页数:12
相关论文
共 10 条
[1]  
ARBIB MA, 1975, ARROWS STRUCTURES FU, P95
[2]   THE EXPRESSIVENESS OF SIMPLE AND 2ND-ORDER TYPE STRUCTURES [J].
FORTUNE, S ;
LEIVANT, D ;
ODONNELL, M .
JOURNAL OF THE ACM, 1983, 30 (01) :151-185
[3]  
GIRARD JY, 1972, THESIS PARIS
[4]   ALGEBRAIC SPECIFICATION OF DATA-TYPES - A SYNTHETIC APPROACH [J].
LEHMANN, DJ ;
SMYTH, MB .
MATHEMATICAL SYSTEMS THEORY, 1981, 14 (02) :97-139
[5]  
MCCRACKEN NJ, 1979, THESIS SYRACUSE U
[6]  
MCCRACKEN NJ, UNPUB INFORMATION CO
[7]  
Reynolds J. C., 1983, Information Processing 83. Proceedings of the IFIP 9th World Computer Congress, P513
[8]  
REYNOLDS JC, 1974, LECT NOTES COMPUT SC, V19, P408, DOI DOI 10.1007/3-540-06859-7148
[9]   THE CATEGORY-THEORETIC SOLUTION OF RECURSIVE DOMAIN EQUATIONS [J].
SMYTH, MB ;
PLOTKIN, GD .
SIAM JOURNAL ON COMPUTING, 1982, 11 (04) :761-783
[10]  
STRACHEY C, 1967, LECTURE NOTES INT SU