Partial Higher-Order Specifications¹

Article type: Research Article

Authors: Astesiano, Egidio | Cerioli, Maura

Affiliations: Dipartimento di Matematica, Università di Genova, Via L.B. Alberti 4, 16132 Genova, Italy, E-mails: Astes@igecuniv.bitnet, Cerioli@igecuniv.bitnet

Note: [1] This work has been partially supported by Esprit-BRA-WG COMPASS, PFI-CNR “Sistemi Informatici e Calcolo Parallelo” and by MURST 40%.

Abstract: In this paper the classes of extensional models of higher-order partial conditional specifications are studied, with the emphasis on the closure properties of these classes. Further it is shown that any equationally complete inference system for partial conditional specifications may be extended to an inference system for partial higher-order conditional specifications, which is equationally complete w.r.t. the class of all extensional models. Then, applying some previous results, a deduction system is proposed, equationally complete for the class of extensional models of a partial conditional specification. Finally, turning the attention to the special important case of termextensional models, it is first shown a sound and equationally complete inference system and then necessary and sufficient conditions are given for the existence of free models, which are also free in the class of term-generated extensional models.

DOI: 10.3233/FI-1992-16203

Journal: Fundamenta Informaticae, vol. 16, no. 2, pp. 101-126, 1992