Sciweavers

3239 search results - page 150 / 648
» A Logical Process Calculus
Sort
View
159
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
15 years 9 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
119
Voted
PPDP
2005
Springer
15 years 6 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet
104
Voted
GIS
2010
ACM
14 years 10 months ago
Tolerance geometry: Euclid's first postulate for points and lines with extension
Object representation and reasoning in vector based geographic information systems (GIS) is based on Euclidean geometry. Euclidean geometry is built upon Euclid's first postu...
Gwen Wilke, Andrew U. Frank
142
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 4 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
EPEW
2005
Springer
15 years 6 months ago
Timing Issues in Web Services Composition
webπ is a recent process calculus introduced to formally specify Web Services composition. It extends the π-calculus with timed workunits, namely an asynchronous and temporized m...
Manuel Mazzara