Theoretical Computer Science
Building visual language parsers
CHI '91 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Definite-clause set grammars: a formalism for problem solving
Journal of Logic Programming
Research directions in concurrent object-oriented programming
KidSim: programming agents without a programming language
Communications of the ACM
The coordination language facility: coordination of distributed objects
Theory and Practice of Object Systems - Special issue on distributed object management
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
A survey of visual language specification and recognition
Visual language theory
A fully formalized theory for describing visual notations
Visual language theory
Application of graph transformation to visual languages
Handbook of graph grammars and computing by graph transformation
Specification and dialogue control of visual interaction through visual rewriting systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deductive Parsing of Visual Languages
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
From Formulae to Rewriting Systems
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Non-standard Logics for Diagram Interpretation
Diagrams '00 Proceedings of the First International Conference on Theory and Application of Diagrams
Programming in Lygon: An Overview
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
A declarative specification and semantics for visual languages
Journal of Visual Languages and Computing
Hi-index | 0.00 |
Diagrammatic notations, such as Venn diagrams, Petri-Nets and finite state automata, are in common use in mathematics and computer science. While the semantic domain of such systems is usually well formalized, the visual notation itself seldom is, so that they cannot be used as valid devices of formal reasoning. A complete formalization of such notations requires the construction of diagram systems with rigorously defined syntax and semantics. We discuss how diagram specification can be interpreted as multiset rewriting and, based on this, how it can be formalized in linear logic. We discuss the power of our approach through an illustration of its possible extension with reflective capabilities to manage negative conditions, and through the identification of a class of diagrammatic transformations which can be directly expressed in our framework.