Sciweavers

43 search results - page 6 / 9
» A Typed, Compositional Logic for a Stack-Based Abstract Mach...
Sort
View
EFDBS
2003
13 years 8 months ago
Four-Level-Architecture for Closure in Interoperability
A definition of types in an information system is given from ld abstractions through data constructs, schema and definitions to physical data values. Category theory suggests tha...
B. Nick Rossiter, Michael A. Heather
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 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
ML
2006
ACM
103views Machine Learning» more  ML 2006»
14 years 1 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
ICFEM
2010
Springer
13 years 6 months ago
Dynamic Resource Reallocation between Deployment Components
Abstract. Today’s software systems are becoming increasingly configurable and designed for deployment on a plethora of architectures, ranging from sequential machines via multic...
Einar Broch Johnsen, Olaf Owe, Rudolf Schlatte, Si...
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 1 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...