Sciweavers

424 search results - page 74 / 85
» A Lambda Calculus with Forms
Sort
View
IANDC
2006
97views more  IANDC 2006»
13 years 8 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
FUIN
2002
107views more  FUIN 2002»
13 years 8 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
MAGS
2010
106views more  MAGS 2010»
13 years 3 months ago
On the convergence of autonomous agent communities
Community is a common phenomenon in natural ecosystems, human societies as well as artificial multi-agent systems such as those in web and Internet based applications. In many sel...
Hong Zhu, Fang Wang, Shufeng Wang
HASKELL
2008
ACM
13 years 10 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 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