Complexity Theory and the Operational Structure of Algebraic Programming Systems

P.R.J. Asveld, J.V. Tucker

    Research output: Contribution to journalArticleAcademicpeer-review

    4 Citations (Scopus)
    42 Downloads (Pure)


    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.
    Original languageEnglish
    Pages (from-to)451-476
    Number of pages26
    JournalActa informatica
    Issue number4
    Publication statusPublished - 1982


    • HMI-SLT: Speech and Language Technology


    Dive into the research topics of 'Complexity Theory and the Operational Structure of Algebraic Programming Systems'. Together they form a unique fingerprint.

    Cite this