A categorical study on the finiteness of specifications

Authors:
Răzvan Diaconescu
Affiliations:
Institute of Mathematics “Simion Stoilow”, Calea Griviţei 21, Bucharest 010702, Romania
Venue:
Information Processing Letters
Year:
2008

Citing 11
Cited 0

Specifications in an arbitrary institution

Information and Computation - Semantics of Data Types
Structuring theories on consequence

Lecture notes in Computer Science on Recent trends in data type specification
Module algebra

Journal of the ACM (JACM)
Abstract and concrete categories

Abstract and concrete categories
Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories

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

Journal of the ACM (JACM)
Logical support for modularisation

Papers presented at the second annual Workshop on Logical environments
Logic Representation in LF

Category Theory and Computer Science
Institution-independent ultraproducts

Fundamenta Informaticae
Proof Systems for Institutional Logic

Journal of Logic and Computation
Institution-independent Model Theory

Institution-independent Model Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

Formal specification practice involve specifications which are finite. We study the concept of finiteness for specifications within the general framework of the so-called @p-institutions, which constitute an abstract categorical proof oriented formalization of the informal concept of logical system. In this paper we argue that finite specifications can be captured abstractly by the concept of finitely presented theory in @p-institutions.