A parameterization process as a categorical construction

The parameterization process used in the symbolic computation systems Kenzo and EAT is studied here as a general construction in a categorical framework. This parameterization process starts from a given specification and builds a parameterized specification by transforming some operations into parameterized operations, which depend on one additional variable called the parameter. Given a model of the parameterized specification, each interpretation of the parameter, called an argument, provides a model of the given specification. Moreover, under some relevant terminality assumption, this correspondence between the arguments and the models of the given specification is a bijection. It is proved in this paper that the parameterization process is provided by a free functor and the subsequent parameter passing process by a natural transformation. Various categorical notions are used, mainly adjoint functors, pushouts and lax colimits.

[1]  Kenneth L Stoler.  A hidden agenda. , 2008, The New York state dental journal.

[2]  César Domínguez,et al.  Towards Diagrammatic Specifications of Symbolic Computation Systems , 2005, Mathematics, Algorithms, Proofs.

[3]  Peter Gabriel,et al.  Calculus of Fractions and Homotopy Theory , 1967 .

[4]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[5]  Dominique Duval.  Diagrammatic Specifications , 2003, Math. Struct. Comput. Sci..

[6]  Dominique Duval.  Diagrammatic Inference , 2007, ArXiv.

[7]  M. Makkai.  Generalized sketches as a framework for completeness theorems , 1997 .

[8]  Hartmut Ehrig,et al.  A Kernel Language for Algebraic Specification and Implementation , 1983, ADT.

[9]  César Domínguez,et al.  Modeling Inheritance as Coercion in the Kenzo System , 2006, J. Univers. Comput. Sci..

[10]  S. Lane.  Categories for the Working Mathematician , 1971 .

[11]  Andrew M. Pitts,et al.  Categorical logic , 2001, LICS 2001.

[12]  Hans-Dieter Ehrich,et al.  Specification of abstract data types , 1996 .

[13]  Vico Pascual,et al.  An Object-oriented Interpretation of the EAT System , 2003, Applicable Algebra in Engineering, Communication and Computing.

[14]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[15]  Horst Reichel,et al.  Defining Equations in Terminal Coalgebras , 1994, COMPASS/ADT.

[16]  César Domínguez,et al.  Object oriented institutions to specify symbolic computation systems , 2007, RAIRO Theor. Informatics Appl..

[17]  S. Lellahi.  Categorical abstract data type (CADT) , 1989 .