Sciweavers

921 search results - page 103 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
LICS
2003
IEEE
14 years 1 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
ICALP
2010
Springer
14 years 23 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
PEPM
2007
ACM
14 years 2 months ago
The semantics of graphical languages
Visual notations are pervasive in circuit design, control systems, and increasingly in mainstream programming environments. Yet many of the foundational advances in programming la...
Stephan Ellner, Walid Taha
ENTCS
2008
131views more  ENTCS 2008»
13 years 8 months ago
Connector Rewriting with High-Level Replacement Systems
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primi...
Christian Koehler, Alexander Lazovik, Farhad Arbab
AAAI
2011
12 years 8 months ago
Analogical Dialogue Acts: Supporting Learning by Reading Analogies in Instructional Texts
Analogy is heavily used in instructional texts. We introduce the concept of analogical dialogue acts (ADAs), which represent the roles utterances play in instructional analogies. ...
David Michael Barbella, Kenneth D. Forbus