Affiliation:
1. Dipartimento di Matematica, Università di Genova, Via L.B. Alberti 4, 16132 Genova, Italy, E-mails: Astes@igecuniv.bitnet, Cerioli@igecuniv.bitnet
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.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Subsorted Partial Higher-Order Logic as an Extension of CASL;Recent Trends in Algebraic Development Techniques;2000
2. From abstract data types to logical frameworks;Recent Trends in Data Type Specification;1995
3. May I borrow your logic?;Lecture Notes in Computer Science;1993
4. Relationships between logical frameworks;Recent Trends in Data Type Specification;1993