Interpolation for predefined types

DOI10.1017/S0960129511000430zbMath1279.68229MaRDI QIDQ3225735

Răzvan Diaconescu

Publication date: 22 March 2012

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

interpolationsemanticsspecificationstructured specificationtheory of institutions

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Related Items (3)

Encoding hybridized institutions into first-order logic ⋮ Structural induction in institutions ⋮ Generalised graded interpolation

Cites Work

• Generalized interpolation in CASL
• An institution-independent proof of the Robinson consistency theorem
• On the existence of free models in abstract algebraic institutions
• Complexity, convexity and combinations of theories
• A simple algebraic proof of the equational interpolation theorem
• Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
• On pushout consistency, modularity and interpolation for logical specifications
• On a generalized modularization theorem
• Logical systems for structured specifications.
• An institution-independent proof of Craig interpolation theorem
• Interpolation in Grothendieck institutions
• Herbrand theorems in arbitrary institutions
• Institution-independent model theory
• Interpolation in practical formal development
• Abstract Beth definability in institutions
• Module algebra
• Simplification by Cooperating Decision Procedures
• Initial Algebra Semantics and Continuous Algebras
• Institutions: abstract model theory for specification and programming
• Category-based constraint logic
• Elementary Diagrams in Institutions
• State of the Union: Type Inference Via Craig Interpolation

This page was built for publication: Interpolation for predefined types