Quasi-varieties in abstract algebraic institutions
Journal of Computer and System Sciences
Categories of partial morphisms and the λp-calculus
Proceedings of a tutorial and workshop on Category theory and computer programming
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
A set-theoretic model for a typed polymorphic lambda calculus. a contribution tometasoft
Proceedings of the 2nd VDM-Europe Symposium on VDM---The Way Ahead
Fundamentals of algebraic specification 2: module specifications and constraints
Fundamentals of algebraic specification 2: module specifications and constraints
Abstract and concrete categories
Abstract and concrete categories
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
An implementation-oriented semantics for module composition
Foundations of component-based systems
Theoretical Computer Science
Higher-Order Logic and Theorem Proving for Structured Specifications
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
A Soft Stairway to Institutions
Selected papers from the 8th Workshop on Specification of Abstract Data Types Joint with the 3rd COMPASS Workshop on Recent Trends in Data Type Specification
HASCASL: Towards Integrated Specification and Development of Functional Programs
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
State-Based Extensions of CASL
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
On the Integration of Observability and Reachability Concepts
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Very abstract specifications: a formalism independent approach
Mathematical Structures in Computer Science
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Stratified institutions and elementary homomorphisms
Information Processing Letters
Ultraproducts and possible worlds semantics in institutions
Theoretical Computer Science
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Coalgebraic modal logic in COCASL
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Bootstrapping types and cotypes in HASCASL
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Hi-index | 0.00 |
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped with a ‘naive' semantics defined in terms of collections of instances. However, this semantics has the unpleasant property that while model reduction preserves satisfaction of sentences, model expansion generally does not. In other words, unless further measures are taken, type class polymorphism fails to constitute a proper institution, being only a so-called rps preinstitution; this is unfortunate, as it means that one cannot use institution-independent or heterogeneous structuring languages, proof calculi, and tools with it. Here, we suggest to remedy this problem by modifying the notion of model to include information also about its potential future extensions. Our construction works at a high level of generality in the sense that it provides, for any preinstitution, an institution in which the original preinstitution can be represented. The semantics of polymorphism used in the specification language HasCasl makes use of this result. In fact, HasCasl's polymorphism is a special case of a general notion of polymorphism in institutions introduced here, and our construction leads to the right notion of semantic consequence when applied to this generic polymorphism. The appropriateness of the construction for other frameworks that share the same problem depends on methodological questions to be decided case by case. In particular, it turns out that our method is apparently unsuitable for observational logics, while it works well with abstract state machine formalisms such as state-based Casl.