Elsevier

Computer Languages

Volume 23, Issues 2–4, July–December 1997, Pages 179-206
Computer Languages

Program separation and definitional higher order programming

https://doi.org/10.1016/S0096-0551(97)00014-3Get rights and content

Abstract

We describe a program separation scheme based on the notions of form and content of an algorithm. The content of an algorithm consists of all local operations needed to compute the algorithm on the basis of a given definition. Separating an algorithm can thus be described as the process of finding definitions such that the algorithm is locally definable. The form of the algorithm then gives the global structure of the algorithm.

The scheme is given in a definitional context, and we show how this type of program separation can be used as a basis for definitional higher order programming.

References (13)

  • L. Hallnäs

    Partial inductive definitions

    Theoretical Computer Science

    (1991)
  • L. Hallnäs

    WM94: program separation in GCLA

  • G. Falkman et al.

    Program separation in GCLA

  • G. Falkman

    Program separation as a basis for definitional higher order programming

  • G. Falkman

    Definitional program separation

  • L. Hallnäs et al.

    A proof-theoretical approach to logic programming, part I, clauses as rules

    Journal of Logic and Computation

    (1990)
There are more references available in the full text version of this article.

Cited by (1)

View full text