Sciweavers

220 search results - page 30 / 44
» On Nets, Algebras and Modularity
Sort
View
SAIG
2001
Springer
14 years 5 days ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
AMAST
1991
Springer
13 years 11 months ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
PPDP
2007
Springer
14 years 1 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
ECEASST
2008
83views more  ECEASST 2008»
13 years 7 months ago
Layered Architecture Consistency for MANETs: Introducing New Team Members
In this paper we extend our results (as given in [PHE+07]) concerning the layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher ord...
Enrico Biermann, Kathrin Hoffmann, Julia Padberg
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 7 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann