On the Operational Structure of Algebraic Programming Systems

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

    Research output: Book/ReportReportOther research output

    15 Downloads (Pure)

    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.
    Original languageUndefined
    Place of PublicationAmsterdam
    PublisherDept. of Computer Science, Mathematical Centre
    Number of pages37
    Publication statusPublished - 1980

    Publication series

    NameCWI report
    PublisherStichting Mathematisch Centrum
    No.IW 152/80
    ISSN (Print)0376-4028

    Keywords

    • HMI-SLT: Speech and Language Technology
    • complexity of algebraic computations
    • EWI-3732
    • operational semantics
    • implementations of data types
    • complexity of implementations
    • IR-66022
    • Algebraic data types

    Cite this

    Asveld, P. R. J., & Tucker, J. V. (1980). On the Operational Structure of Algebraic Programming Systems. (CWI report; No. IW 152/80). Amsterdam: Dept. of Computer Science, Mathematical Centre.
    Asveld, P.R.J. ; Tucker, J.V. / On the Operational Structure of Algebraic Programming Systems. Amsterdam : Dept. of Computer Science, Mathematical Centre, 1980. 37 p. (CWI report; IW 152/80).
    @book{0b0dc79daf9b423c82d4687ee82087ec,
    title = "On the Operational Structure of Algebraic Programming Systems",
    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.",
    keywords = "HMI-SLT: Speech and Language Technology, complexity of algebraic computations, EWI-3732, operational semantics, implementations of data types, complexity of implementations, IR-66022, Algebraic data types",
    author = "P.R.J. Asveld and J.V. Tucker",
    year = "1980",
    language = "Undefined",
    series = "CWI report",
    publisher = "Dept. of Computer Science, Mathematical Centre",
    number = "IW 152/80",

    }

    Asveld, PRJ & Tucker, JV 1980, On the Operational Structure of Algebraic Programming Systems. CWI report, no. IW 152/80, Dept. of Computer Science, Mathematical Centre, Amsterdam.

    On the Operational Structure of Algebraic Programming Systems. / Asveld, P.R.J.; Tucker, J.V.

    Amsterdam : Dept. of Computer Science, Mathematical Centre, 1980. 37 p. (CWI report; No. IW 152/80).

    Research output: Book/ReportReportOther research output

    TY - BOOK

    T1 - On the Operational Structure of Algebraic Programming Systems

    AU - Asveld, P.R.J.

    AU - Tucker, J.V.

    PY - 1980

    Y1 - 1980

    N2 - 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.

    AB - 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.

    KW - HMI-SLT: Speech and Language Technology

    KW - complexity of algebraic computations

    KW - EWI-3732

    KW - operational semantics

    KW - implementations of data types

    KW - complexity of implementations

    KW - IR-66022

    KW - Algebraic data types

    M3 - Report

    T3 - CWI report

    BT - On the Operational Structure of Algebraic Programming Systems

    PB - Dept. of Computer Science, Mathematical Centre

    CY - Amsterdam

    ER -

    Asveld PRJ, Tucker JV. On the Operational Structure of Algebraic Programming Systems. Amsterdam: Dept. of Computer Science, Mathematical Centre, 1980. 37 p. (CWI report; IW 152/80).