ABSTRACT RECURSION AS A FOUNDATION FOR THE THEORY OF ALGORITHMS

被引：0
作者：
MOSCHOVAKIS, YN
机构：
来源：
LECTURE NOTES IN MATHEMATICS | 1984年 / 1104卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：289 / 364
页数：76
相关论文
共 55 条
[1]  
Aho Alfred V., 1979, 6TH P ACM S PRINC PR, P110
[2]   CAN PROGRAMMING BE LIBERATED FROM VON NEUMANN STYLE - FUNCTIONAL STYLE AND ITS ALGEBRA OF PROGRAMS [J].
BACKUS, J .
COMMUNICATIONS OF THE ACM, 1978, 21 (08) :613-641
[3]   GLOBAL INDUCTIVE DEFINABILITY [J].
BARWISE, J ;
MOSCHOVAKIS, YN .
JOURNAL OF SYMBOLIC LOGIC, 1978, 43 (03) :521-534
[4]   NEXT ADMISSIBLE SET [J].
BARWISE, KJ ;
GANDY, RO ;
MOSCHOVA.YN .
JOURNAL OF SYMBOLIC LOGIC, 1971, 36 (01) :108-&
[5]   STRUCTURE AND COMPLEXITY OF RELATIONAL QUERIES [J].
CHANDRA, A ;
HAREL, D .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (01) :99-128
[6]   COMPUTABLE QUERIES FOR RELATIONAL DATA-BASES [J].
CHANDRA, AK ;
HAREL, D .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (02) :156-178
[7]  
CHEN M, 1983, THESIS CALTECH
[8]  
DEBAKKER JW, 1980, MATH THEORY PROGRAM
[9]  
DEROUGEMONT M, 1983, THESIS UCLA
[10]  
Fagin R., 1974, COMPLEXITY COMPUTATI, V7, P43
123456