论文信息 - Module algebra for relational specifications

Module algebra for relational specifications

Module algebra is described as a parametrised data type that takes a three sorted parameter, involving signatures, renamings and atomic specifications. An actual parameter describing relational specifications is given and a biinterpretation model is made for the resulting specification.

J. A. Bergstra | J. Bergstra

[1] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[2] T. Broadbent,et al. Module Algebra , 1970, Nature.

[3] H. B. M. Jonkers,et al. A semantic framework for the COLD-family of languages , 1986 .

[4] José Meseguer,et al. Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..