Complexity Theory and the Operational Structure of Algebraic Programming Systems

Share/Save/Bookmark

Asveld, P.R.J. and Tucker, J.V. (1982) Complexity Theory and the Operational Structure of Algebraic Programming Systems. Acta Informatica, 17 (4). pp. 451-476. ISSN 0001-5903

open access
[img]
Preview
PDF
1MB
Abstract:An algebraic programming system is a language built from a fixed algebraic data abstraction and a selection of deterministic, and non-deterministic, assignment and control constructs. First, we give a detailed analysis of the operational structure of an algebraic data type, one which is designed to classify programming systems in terms of the complexity of their implementations. Secondly, we test our operational description by comparing the computations in deterministic and non-deterministic programming systems under certain space and time restrictions.
Item Type:Article
Copyright:© 1982 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/66030
Official URL:http://dx.doi.org/10.1007/BF00264163
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page