PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES

作     者：J.V. TUCKER J.I. ZUCKER 

作者机构：Department of Mathematics and Computer Science University College of Swansea Swansea SA2 8PP Wales UK Department of Computer Science and Systems McMaster University Hamilton Ontario L8S 4K1 Canada 

出 版 物：《International Journal of Foundations of Computer Science》 

年 卷 期：1991年第2卷第3期

页      面：267-296页

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Abstract data types computability many-sorted algebras 

摘      要：We consider projections of semicomputable relations on abstract structures We show that they arise in several contexts, including nondeterministic extensions of while programs with arrays by means of arbitrary initializations and random assignments. They form a basis for an investigation of the concept of algorithmic specifications of relations with nondeterministic search. An important technique in this investigation is the study of computation trees for imperative programs, in order to prove characterization theorems for semicomputable sets, of a form first developed by E. Engeler.