Sciweavers

169 search results - page 20 / 34
» A type system for well-founded recursion
Sort
View
ATAL
2003
Springer
14 years 27 days ago
A Taxonomy of Autonomy in Multiagent Organisation
Abstract. Starting from a general definition of how to model the organisation of multiagent systems with the aid of holonic structures, we discuss design parameters for such struc...
Michael Schillo, Klaus Fischer
JUCS
2008
134views more  JUCS 2008»
13 years 7 months ago
Computability of Topological Pressure for Sofic Shifts with Applications in Statistical Physics
: The topological pressure of dynamical systems theory is examined from a computability theoretic point of view. It is shown that for sofic shift dynamical systems, the topological...
Christoph Spandl
IRREGULAR
1997
Springer
13 years 11 months ago
Programming with Shared Data Abstractions
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
Simon A. Dobson, Don Goodeve
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
OOPSLA
2007
Springer
14 years 1 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright