Results 1 
3 of
3
Diagrammatic logic applied to a parameterization process
, 2009
"... Abstract. This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2morphisms between diagrammatic logics. The definition of the 2category of diagrammatic logics rely on category theory, mainly on adjunction, cat ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2morphisms between diagrammatic logics. The definition of the 2category of diagrammatic logics rely on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalization of a parameterization process. This process, which consists in adding a formal parameter to some operations in a given specification, is presented as a morphism of logics. Then the parameter passing process, for recovering a model of the given specification from a model of the parameterized specification and an actual parameter, is seen as a 2morphism of logics. 1
A parameterization process as a categorical construction
, 908
"... Abstract. 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 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. 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
A parameterization process, functorially
, 2009
"... Abstract. 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 adding a parameter as a new ..."
Abstract
 Add to MetaCart
Abstract. 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 adding a parameter as a new variable to some operations. 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 functor and the subsequent parameter passing process by a natural transformation. Various categorical notions are used, mainly adjoint functors, pushouts and lax colimits. 1