Proceedings of a tutorial and workshop on Category theory and computer programming
Structuring theories on consequence
Lecture notes in Computer Science on Recent trends in data type specification
Abstract and concrete categories
Abstract and concrete categories
Category theory for computing science
Category theory for computing science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
Journal of the ACM (JACM)
Journal of Logic, Language and Information
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of 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
Moving Between Logical Systems
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
Synchronization of Logics with Mixed Rules: Completeness Preservation
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Combining and Representing Logical Systems
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Parametrized logic programming
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Studia Logica
| Hi-index | 0.00 |
Combined logics have recently deserved much attention. In this paper we develop a detailed study of a form of combination that generalises the temporalisation construction proposed in [16]. It consists of replacing an atomic part (formal parameter) of one (parameterised) logic by another (actual parameter) logic. We provide a categorial characterisation of parameterisation and illustrate it with an example. Under reasonable assumptions, we show that the result logic is a conservative extension of both the parameterised and parameter logics and also that soundness, completeness and decidability are transferred.