Bits and pieces of the theory of institutions
Proceedings of a tutorial and workshop on Category theory and computer programming
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Journal of the ACM (JACM)
On pushout consistency, modularity and interpolation for logical specifications
Information Processing Letters
On a generalized modularization theorem
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
CASL: the common algebraic specification language
Theoretical Computer Science
Relating CASL with other specification languages: the institution level
Theoretical Computer Science
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Observational logic, constructor-based logic, and their duality
Theoretical Computer Science - Foundations of software science and computation structures
Interpolation in Grothendieck institutions
Theoretical Computer Science
Institution-independent Model Theory
Institution-independent Model Theory
A semantic approach to interpolation
Theoretical Computer Science
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Constructor-based institutions
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Applications of craig interpolants in model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Journal of Logic and Computation
Institution-independent Ultraproducts
Fundamenta Informaticae
| Hi-index | 5.23 |
We present a generic method for establishing the interpolation property by borrowing it across the logical systems from a base institution to prove it for its constructor-based variant. The framework used is that of the so-called institution theory invented by Goguen and Burstall which is a categorical-based formulation of the informal concept of logical system sufficiently abstract to capture many examples of logics used in computer science and mathematical logic, and expressive enough to elaborate our general results. We illustrate the applicability of the present work by instantiating the abstract results to constructor-based Horn clause logic and constructor-based Horn preorder algebra but applications are also expected for many other logical systems.