Constructor-based Institutions

Many computer science applications concern properties which are true of a restricted class of models. We present a couple of constructorbasedinstitutions 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.リサーチレポート（北陸先端科学技術大学院大学情報科学研究科

Constructor-based Logics

Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized asinstitutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions.

Constructor-based Logics

Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized asinstitutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions.

Constructor-based logics

Abstract: Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized as institutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions