Sciweavers

240 search results - page 38 / 48
» A Typed Calculus of Synchronous Processes
Sort
View
ICFP
2006
ACM
14 years 9 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg
TCS
2008
13 years 9 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
ICDCS
2005
IEEE
14 years 2 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 6 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
IPPS
1999
IEEE
14 years 1 months ago
Relaxing Causal Constraints in PDES
One of the major overheads that prohibits the wide spread deployment of parallel discrete event simulation PDES is the need to synchronize the distributed processes in the simulat...
Narayanan V. Thondugulam, Dhananjai Madhava Rao, R...