1,009 research outputs found
Diagrammatic Inference
Diagrammatic logics were introduced in 2002, with emphasis on the notions of
specifications and models. In this paper we improve the description of the
inference process, which is seen as a Yoneda functor on a bicategory of
fractions. A diagrammatic logic is defined from a morphism of limit sketches
(called a propagator) which gives rise to an adjunction, which in turn
determines a bicategory of fractions. The propagator, the adjunction and the
bicategory provide respectively the syntax, the models and the inference
process for the logic. Then diagrammatic logics and their morphisms are applied
to the semantics of side effects in computer languages.Comment: 16 page
Deduction as Reduction
Deduction systems and graph rewriting systems are compared within a common
categorical framework. This leads to an improved deduction method in
diagrammatic logics
States and exceptions considered as dual effects
In this paper we consider the two major computational effects of states and
exceptions, from the point of view of diagrammatic logics. We get a surprising
result: there exists a symmetry between these two effects, based on the
well-known categorical duality between products and coproducts. More precisely,
the lookup and update operations for states are respectively dual to the throw
and catch operations for exceptions. This symmetry is deeply hidden in the
programming languages; in order to unveil it, we start from the monoidal
equational logic and we add progressively the logical features which are
necessary for dealing with either effect. This approach gives rise to a new
point of view on states and exceptions, which bypasses the problems due to the
non-algebraicity of handling exceptions
Diagrammatic logic applied to a parameterization process
This paper provides an abstract definition of some kinds of logics, called
diagrammatic logics, together with a definition of morphisms and of 2-morphisms
between diagrammatic logics. The definition of the 2-category 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 2-morphism of logics
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
Paper 2: Practical Application of the Composite Modeling Units, and an Exercise on Emulating the Mathematics of Time Dilation in a Relative Velocity or Gravity Situation
Paper 1 suggests intuitively that as humans, we must continue to investigate physical Objects by our natural Geometry. At the same time, we may want to explore a Nongeometric tool to check some other aspects. The two positions presume two distinct scopes and two independent Logics, so they are not conflictual, and we should be able to form a single consistent picture (no-strange-things criterion). In Paper 2, we enter the technique of NBM more systematically. The text below comes from a compromise, as we want to make as clear as possible any assumption which hides into the Model. At the same time, we want it to remain a very straight and practical tool, so we formulate it in term of Rules, Procedures, and lists of instructions
Recommended from our members
Formalizing graphical notations
The thesis describes research into graphical notations for software engineering, with a principal interest in ways of formalizing them. The research seeks to provide a theoretical basis that will help in designing both notations and the software tools that process them.
The work starts from a survey of literature on notation, followed by a review of techniques for formal description and for computational handling of notations. The survey concentrates on collecting views of the benefits and the problems attending notation use in software development; the review covers picture description languages, grammars and tools such as generic editors and visual programming environments. The main problem of notation is found to be a lack of any coherent, rigorous description methods. The current approaches to this problem are analysed as lacking in consensus on syntax specification and also lacking a clear focus on a defined concept of notated expression.
To address these deficiencies, the thesis embarks upon an exploration of serniotic, linguistic and logical theory; this culminates in a proposed formalization of serniosis in notations, using categorial model theory as a mathematical foundation. An argument about the structure of sign systems leads to an analysis of notation into a layered system of tractable theories, spanning the gap between expressive pictorial medium and subject domain. This notion of 'tectonic' theory aims to treat both diagrams and formulae together.
The research gives details of how syntactic structure can be sketched in a mathematical sense, with examples applying to software development diagrams, offering a new solution to the problem of notation specification. Based on these methods, the thesis discusses directions for resolving the harder problems of supporting notation design, processing and computer-aided generic editing. A number of future research areas are thereby opened up. For practical trial of the ideas, the work proceeds to the development and partial implementation of a system to aid the design of notations and editors. Finally the thesis is evaluated as a contribution to theory in an area which has not attracted a standard approach
- …