Sciweavers

54 search results - page 7 / 11
» Constructing language processors with algebra combinators
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
HICSS
2005
IEEE
151views Biometrics» more  HICSS 2005»
15 years 3 months ago
Inheritance in the Presence of Asynchronous Method Calls
— This paper considers a formal object-oriented model for distributed computing. Object orientation appears as a leading framework for concurrent and distributed systems. However...
Einar Broch Johnsen, Olaf Owe
LPNMR
1990
Springer
15 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
PPDP
2005
Springer
15 years 3 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ENTCS
2008
120views more  ENTCS 2008»
14 years 9 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier