GCLA(ID:5527/gcl004)

Prolog dialect from SICS
Related languages
GCLA => GCLA II   Evolution of
References:
  • Martin Aronsson "A Definitional Approach to the Combination of Functional and Relational Programming" SICS R91-10 1991 view details Abstract: We show how the programming language GCLA can be used to naturally express both relational and functional programs in an integrated framework. We give a short introduction to GCLA, and to the theory of partial inductive definitions on which GCLA is based. GCLA is best regarded as a logic programming language, but instead of saying that the query follows from the program in some a priori given logic, we say that the program defines the logic in which the query is proved. We then demonstrate how to implement both relational and functional programs as well as a combination of them in GCLA.
  • Eriksson, Lars-Henrik "A finitary version of the calculus of partial inductive definitions" SICS R92-08 1992 view details Abstract: The theory of partial inductive definitions is a mathematical formalism which has proved to be useful in a number of different applications. The fundamentals of the theory is shortly described. Partial inductive definitions and their associated calculi are essentially infinitary. To implement them on a computer, they must be given a formal finitary representation. We present such a finitary representation, and prove its soundness. The finitary representation is given in a form with and without variables. Without variables, derivations are unchanging entities. With variables, derivations can contain logical variables that can become bound by a binding environment that is extended as the derivation is constructed. The variant with variables is essentially a generalization of the pure GCLA programming language.