Sciweavers

116 search results - page 11 / 24
» Operations Preserving Recognizable Languages
Sort
View
AGP
1997
IEEE
13 years 12 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
FOSSACS
2003
Springer
14 years 28 days ago
A Monadic Multi-stage Metalanguage
We describe a metalanguage MMML, which makes explicit the order of evaluation (in the spirit of monadic metalanguages) and the staging of computations (as in languages for multi-l...
Eugenio Moggi, Sonia Fagorzi
ECOOP
2009
Springer
14 years 8 months ago
Stepping Stones over the Refactoring Rubicon
Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this ...
Mathieu Verbaere, Max Schäfer, Oege de Moor, ...
CONCUR
1994
Springer
13 years 11 months ago
Weak Sequential Composition in Process Algebras
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
Arend Rensink, Heike Wehrheim
SIGSOFT
2002
ACM
14 years 8 months ago
Composable semantics for model-based notations
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
Jianwei Niu, Joanne M. Atlee, Nancy A. Day