作者: José Fiadeiro , Amílcar Sernadas
关键词: Class (set theory) 、 Theoretical computer science 、 Institution (computer science) 、 Operator (linguistics) 、 Mathematics 、 Denotation 、 Forgetful functor 、 Semantics (computer science) 、 Calculus 、 Relation (database) 、 Conservative extension
摘要: Building on the work of Goguen and Burstall institutions Tarski's notion deductive system, a categorial framework for manipulating theories in an arbitrary logic is presented. Its main contribution formalisation semantics theory-building operations top consequence relation. For that purpose, π-institution proposed as alternative to institution, replacing notions model satisfaction by primitive operator definition logic. The resulting approach specification languages intrinsically different from original one sense ultimate denotation taken herein be class (sets formulae closed relation) not models Adopting this point view, Clear-like building analysed.