[PDF][PDF] Categorical data specifications
F Piessens, E Steegmans - Theory and Applications of Categories, 1995 - Citeseer
We introduce MD-sketches, which are a particular kind of Finite Sum sketches. Two
interesting results about MD-sketches are proved. First, we show that, given two MD …
interesting results about MD-sketches are proved. First, we show that, given two MD …
Cartesian institutions with evidence: Data and system modelling with diagrammatic constraints and generalized sketches
Z Diskin - arXiv preprint arXiv:2306.16284, 2023 - arxiv.org
Data constraints are fundamental for practical data modelling, and a verifiable conformance
of a data instance to a safety-critical constraint (satisfaction relation) is a corner-stone of …
of a data instance to a safety-critical constraint (satisfaction relation) is a corner-stone of …
Selective attribute elimination for categorical data specifications
F Piessens, E Steegmans - International Conference on Algebraic …, 1997 - Springer
Semantic data specifications are important components of most object oriented software
development methodologies. When making a semantic data specification, one has to …
development methodologies. When making a semantic data specification, one has to …
[PDF][PDF] Algebraic Graph-Oriented= Category Theory Based
B Cadish, Z Diskin - Manifesto of categorizing database theory …, 1994 - cs.toronto.edu
Foreword. Category theory is well known as a high-level polymorphic framework suitable for
specifying complex structures and formalisms. Quite unexpectedly, however, it turned out …
specifying complex structures and formalisms. Quite unexpectedly, however, it turned out …
[PDF][PDF] The graph-based logic of ER-diagrams and taming heterogeneity of semantic data models
Z Diskin - Citeseer
The rst goal of the paper is to explicate the formal logic underlying ER-diagrams, ERD-logic.
It is shown that this logic is a logic of predicates over set-andfunction diagrams, that is, a …
It is shown that this logic is a logic of predicates over set-andfunction diagrams, that is, a …
[图书][B] Finite satisfiability and equivalence of finitary sketches
F Piessens - 1998 - cs.kuleuven.be
A translation from classical rst-order logic to sketches is given. This translation does not
preserve model categories, as is usually required when one studies connections between …
preserve model categories, as is usually required when one studies connections between …
[PDF][PDF] Algebraic Graph-Oriented= Category-Theory-Based
Z Diskin, B Kadish - 1996 - Citeseer
Foreword. Category theory is well known as a high-level polymorphic framework suitable for
specifying complex structures and formalisms. Quite unexpectedly, however, it turned out …
specifying complex structures and formalisms. Quite unexpectedly, however, it turned out …
[PDF][PDF] FRAME INFORM SYSTEMS
Z Diskin - cs.toronto.edu
¢¡¤£¥¡ § ¦¡ § ©©¡ § ©¡ § !¥¡!"¡!#!¦¥¡ § ©% $©'& (¤) 0 1324 356 768¤ 9¤©@¡! 5A C B4 EDF©
GB¡ H£ 9IA P QR¡ § & ITSU¦¡ § ©# VQ W) X VQ1© Y!£¥) aIA¤© bIpx 2h5 V} XpxegkVpx Qc …
GB¡ H£ 9IA P QR¡ § & ITSU¦¡ § ©# VQ W) X VQ1© Y!£¥) aIA¤© bIpx 2h5 V} XpxegkVpx Qc …
A decision procedure for semantical equivalence of thin FM specifications
F Piessens, E Steegmans - Journal of Pure and Applied Algebra, 1999 - Elsevier
Several authors have proposed sketches as a suitable specification mechanism for
specifying databases. When specifying a database, the finite models of the specification are …
specifying databases. When specifying a database, the finite models of the specification are …