Constructor-based institutions

Authors:
Daniel Găină;Kokichi Futatsugi;Kazuhiro Ogata
Affiliations:
Graduate School of Information Science, Japan Advanced Institute of Science and Technology;Graduate School of Information Science, Japan Advanced Institute of Science and Technology;Graduate School of Information Science, Japan Advanced Institute of Science and Technology
Venue:
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Year:
2009

Citing 9
Cited 4

Bits and pieces of the theory of institutions

Proceedings of a tutorial and workshop on Category theory and computer programming
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
Logical foundations of cafeOBJ

Theoretical Computer Science - Rewriting logic and its applications
CASL: the common algebraic specification language

Theoretical Computer Science
Observational logic, constructor-based logic, and their duality

Theoretical Computer Science - Foundations of software science and computation structures
Institution-independent ultraproducts

Fundamenta Informaticae
Initial algebra semantics

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

Fostering proof scores in CafeOBJ

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A combination of forward and backward reachability analysis methods

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Principles of proof scores in CafeOBJ

Theoretical Computer Science
Interpolation in logics with constructors

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many computer science applications concern properties which are true of a restricted class of models. We present a couple of constructor-based institutions defined on top of some base institutions by restricting the class of models. We define the proof rules for these logics formalized as institutions, and prove their completeness in the abstract framework of institutions.