Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Journal of the ACM (JACM)
Topology and category theory in computer science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
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)
Generalized interpolation in CASL
Information Processing Letters
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
Logical systems for structured specifications
Theoretical Computer Science
Interpolation in Grothendieck institutions
Theoretical Computer Science
A semantic approach to interpolation
Theoretical Computer Science
Hi-index | 0.01 |
Interpolation results are investigated for various types of formulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and classify a series of interpolation results for first-order logic. A few of these results non-trivially generalize known interpolation results. All the others are new.