Proceedings of a tutorial and workshop on Category theory and computer programming
Handbook of theoretical computer science (vol. B)
Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories
Theoretical Computer Science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Free objects and equational deduction for partial conditional specifications
Theoretical Computer Science
Combining and representing logical systems using model-theoretic parchments
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Using Limits of Parchment to Systematically Construct Institutions of partial Algebras
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Combining and Representing Logical Systems
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Heterogeneous Development Graphs and Heterogeneous Borrowing
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Hi-index | 0.00 |
In the general context of the theory of institutions, several notions of parchment and parchment morphism have been proposed as the adequate setting for combining logics. However, so far, they seem to lack one of the main advantages of the combination mechanism known as fibring: general results of transference of important logical properties from the logics being combined to the resulting fibred logic. Herein, in order to bring fibring to the institutional setting, we propose to work with the novel notion of c-parchment. We show how both free and constrained fibring can be characterized as colimits of c-parchments, and illustrate both the construction and its preservation capabilities by exploring the idea of obtaining partial equational logic by fibring equational logic with a suitable logic of partiality. Last but not least, in the restricted context of propositional based, we state and prove a collection of meaningful soundness and completeness preservation results for fibring, with respect to Hilbert-like proof-calculi.