Results 1  10
of
126
A DomainSpecific Visual Language for Domain Model Evolution
 Journal of Visual Languages and Computing
, 2004
"... Domainspecific visual languages (DSVLs) are concise and useful tools that allow the rapid development of the behavior and/or structure of applications in welldefined domains. These languages are typically developed specifically for a domain, and have a strong cohesion to the domain concepts, which ..."
Abstract

Cited by 54 (6 self)
 Add to MetaCart
(Show Context)
Domainspecific visual languages (DSVLs) are concise and useful tools that allow the rapid development of the behavior and/or structure of applications in welldefined domains. These languages are typically developed specifically for a domain, and have a strong cohesion to the domain concepts, which often appear as primitives in the language. The strong cohesion between DSVL language primitives and the domain is a benefit for development by domain experts, but can be a drawback when the domain evolves – even when that evolution appears insignificant. This paper presents a domainspecific visual language developed expressly for the evolution of domainspecific visual languages, and uses concepts from graphrewriting to specify and carry out the transformation of the models built using the original DSVL. 1.
A Coinduction Principle for Recursive Data Types Based on Bisimulation
, 1996
"... This paper provides foundations for a reasoning principle (coinduction) for establishing the equality of potentially infinite elements of selfreferencing (or circular) data types. As it is wellknown, such data types not only form the core of the denotational approach to the semantics of programmin ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
This paper provides foundations for a reasoning principle (coinduction) for establishing the equality of potentially infinite elements of selfreferencing (or circular) data types. As it is wellknown, such data types not only form the core of the denotational approach to the semantics of programming languages [SS71], but also arise explicitly as recursive data types in functional programming languages like Standard ML [MTH90] or Haskell [HPJW92]. In the latter context, the coinduction principle provides a powerful technique for establishing the equality of programs with values in recursive data types (see examples herein and in [Pit94]).
Metamodel driven model migration
 Vanderbilt University
, 2003
"... I love you, and I’m proud of you too. Thanks for being here for me. Jon iii ACKNOWLEDGEMENTS I give many thanks to my advisor, Dr. Gabor Karsai for being the Best AllAround Advisor™. Gabor, without your excellent teaching skills and motivational abilities, I would not be in the position I am today. ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
(Show Context)
I love you, and I’m proud of you too. Thanks for being here for me. Jon iii ACKNOWLEDGEMENTS I give many thanks to my advisor, Dr. Gabor Karsai for being the Best AllAround Advisor™. Gabor, without your excellent teaching skills and motivational abilities, I would not be in the position I am today. Vanderbilt is lucky to have you, as will be any other student under your tutelage. I also thank very heartily the other members of my committee. Dr. Janos Sztipanovits, for his political insight (and vision for my future career); Dr. Akos Ledeczi, for holding my feet to the fire when it comes to sticking up for the value of my research, and also social interactions within ISIS; Dr. Greg Nordstrom, for (as usual) providing valuable comments in the discussion of all things metamodeling related, not to mention being an allaround good guy to bounce ideas allaround with; and of course Dr. Doug
Vela (2000), Computable Economics
"... the Editors for the kind invitation to contribute and the immense patience with which they tolerated the various ways in which we transcended generous deadlines. The title has metamorphosed into the ultrasimple final form it has taken, having begun its life as Computational Economics, become the Co ..."
Abstract

Cited by 24 (9 self)
 Add to MetaCart
(Show Context)
the Editors for the kind invitation to contribute and the immense patience with which they tolerated the various ways in which we transcended generous deadlines. The title has metamorphosed into the ultrasimple final form it has taken, having begun its life as Computational Economics, become the Computational Paradigm in
Complementarity in categorical quantum mechanics
, 2010
"... We relate notions of complementarity in three layers of quantum mechanics: (i) von Neumann algebras, (ii) Hilbert spaces, and (iii) orthomodular lattices. Taking a more general categorical perspective of which the above are instances, we consider dagger monoidal kernel categories for (ii), so that ( ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
We relate notions of complementarity in three layers of quantum mechanics: (i) von Neumann algebras, (ii) Hilbert spaces, and (iii) orthomodular lattices. Taking a more general categorical perspective of which the above are instances, we consider dagger monoidal kernel categories for (ii), so that (i) become (sub)endohomsets and (iii) become subobject lattices. By developing a ‘pointfree’ definition of copyability we link (i) commutative von Neumann subalgebras, (ii) classical structures, and (iii) Boolean subalgebras.
Quantum picturalism
, 2009
"... Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘nocloning theorem’ is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to dis ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘nocloning theorem’ is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to discover the conceptually intriguing and easily derivable physical phenomenon of ‘quantum teleportation’? We claim that the quantum mechanical formalism doesn’t support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the arrays of 0s and 1s of the early days of computer programming practice. Using a technical term from computer science, the quantum mechanical formalism is ‘lowlevel’. In this review we present steps towards a diagrammatic ‘highlevel ’ alternative for the Hilbert space formalism, one which appeals to our intuition. The diagrammatic language as it currently stands allows for intuitive reasoning about interacting quantum systems, and trivialises many otherwise involved and tedious computations. It clearly exposes limitations such as the nocloning theorem, and phenomena such as quantum teleportation. As a logic, it supports ‘automation’: it enables a (classical) computer to reason about interacting quantum systems, prove theorems, and design protocols. It allows for a wider variety of underlying theories, and can be easily modified, having the potential to provide the required stepstone towards a deeper conceptual understanding of quantum theory, as well as its
Formalizing the Structural Semantics of DomainSpecific Modeling Languages
, 2009
"... Modelbased approaches to system design are now widespread and successful. These approaches make extensive use of model structure to describe systems using domainspecific abstractions, to specify and implement model transformations, and to analyze structural properties of models. In spite of its ge ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
Modelbased approaches to system design are now widespread and successful. These approaches make extensive use of model structure to describe systems using domainspecific abstractions, to specify and implement model transformations, and to analyze structural properties of models. In spite of its general importance the structural semantics of modeling languages are not wellunderstood. In this paper we develop the formal foundations for the structural semantics of domain specific modeling languages (DSML), including the mechanisms by which metamodels specify the structural semantics of DSMLs. Additionally, we show how our formalization can complement existing tools, and how it yields algorithms for the analysis of DSMLs and model transformations.
Transforming Data by Calculation
 IN GTTSE’07, VOLUME 5235 OF LNCS
, 2008
"... This paper addresses the foundations of datamodel transformation. A catalog of data mappings is presented which includes abstraction and representation relations and associated constraints. These are justified in an algebraic style via the pointfreetransform, a technique whereby predicates are lif ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
(Show Context)
This paper addresses the foundations of datamodel transformation. A catalog of data mappings is presented which includes abstraction and representation relations and associated constraints. These are justified in an algebraic style via the pointfreetransform, a technique whereby predicates are lifted to binary relation terms (of the algebra of programming) in a twolevel style encompassing both data and operations. This approach to data calculation, which also includes transformation of recursive data models into “flat ” database schemes, is offered as alternative to standard database design from abstract models. The calculus is also used to establish a link between the proposed transformational style and bidirectional lenses developed in the context of the classical viewupdate problem.
Selfadjunctions and matrices
 Journal of Pure and Applied Algebra
"... It is shown that the multiplicative monoids of TemperleyLieb algebras are isomorphic to monoids of endomorphisms in categories where an endofunctor is adjoint to itself. Such a selfadjunction is found in a category whose arrows are matrices, and the functor adjoint to itself is based on the Kronec ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
(Show Context)
It is shown that the multiplicative monoids of TemperleyLieb algebras are isomorphic to monoids of endomorphisms in categories where an endofunctor is adjoint to itself. Such a selfadjunction is found in a category whose arrows are matrices, and the functor adjoint to itself is based on the Kronecker product of matrices. Thereby one obtains a representation of braid groups in matrices, which, though different and presumably new, is related to the standard representation of braid groups in TemperleyLieb algebras. Mathematics Subject Classification (2000): 57M99, 20F36, 18A40 1
Mathematics of generic specifications for model management
 Encyclopedia of Database Technologies and Applications
, 2005
"... This article (further referred to as MathI), and the next one (further referred to as MathII, see p. 359), form a mathematical companion to the article in this encyclopedia on Generic Model Management (further referred to as GenMMt, see p.258). Articles MathI and II present the basics of the arro ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
This article (further referred to as MathI), and the next one (further referred to as MathII, see p. 359), form a mathematical companion to the article in this encyclopedia on Generic Model Management (further referred to as GenMMt, see p.258). Articles MathI and II present the basics of the arrow diagram machinery that provides model management with truly generic specifications. Particularly, it allows us to build a generic pattern for heterogeneous data and schema transformation, which is presented in MathII for the first time in the literature.