Sciweavers

2272 search results - page 364 / 455
» A Calculus for
Sort
View
HASKELL
2008
ACM
14 years 8 days 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 11 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
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 11 months ago
Performance Modeling and Evaluation for Information-Driven Networks
Information-driven networks include a large category of networking systems, where network nodes are aware of information delivered and thus can not only forward data packets but m...
Kui Wu, Yuming Jiang, Guoqiang Hu
AICOM
2006
129views more  AICOM 2006»
13 years 11 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
AML
2006
120views more  AML 2006»
13 years 11 months ago
On the infinite-valued Lukasiewicz logic that preserves degrees of truth
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
Josep Maria Font, Àngel J. Gil, Antoni Torr...