Sciweavers

134 search results - page 23 / 27
» An Algebraic View of Program Composition
Sort
View
DOCENG
2004
ACM
14 years 3 months ago
On modular transformation of structural content
We show that an XML DTD (Document Type Definition) can be viewed as the fixed point of a parametric content model. We then use natural transformations from the source content mo...
Tyng-Ruey Chuang, Jan-Li Lin
ECOOPW
1999
Springer
14 years 2 months ago
An Aspect-Oriented Design Framework for Concurrent Systems
Abstract. In Aspect-Oriented Programming we decompose a problem into a number of functional components as well as a number of aspects and then we compose these components and aspec...
Constantinos Constantinides, Atef Bader, Tzilla El...
PDP
2008
IEEE
14 years 4 months ago
Type Safe Algorithmic Skeletons
This paper addresses the issue of type safe algorithmic skeletons. From a theoretical perspective we contribute by: formally specifying a type system for algorithmic skeletons, an...
Denis Caromel, Ludovic Henrio, Mario Leyton
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 10 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
CSL
2003
Springer
14 years 3 months ago
Modular Semantics and Logics of Classes
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
Bernhard Reus