Sciweavers

756 search results - page 60 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
VL
1995
IEEE
158views Visual Languages» more  VL 1995»
13 years 11 months ago
DiaGen: A Generator for Diagram Editors Providing Direct Manipulation and Execution of Diagrams
Diagrams (e.g., flowcharts, trees for hierarchical structures, or graphs for finite state machines) are often needed as part of visual language systems and advanced user interfa...
Mark Minas, Gerhard Viehstaedt
ASM
2004
ASM
14 years 1 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
COLING
1992
13 years 9 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
POPL
2009
ACM
14 years 8 months ago
State-dependent representation independence
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
Amal Ahmed, Derek Dreyer, Andreas Rossberg