Sciweavers

900 search results - page 14 / 180
» Pure Type Systems Formalized
Sort
View
APLAS
2008
ACM
13 years 9 months ago
ML Modules and Haskell Type Classes: A Constructive Comparison
Researchers repeatedly observed that the module system of ML and the type class mechanism of Haskell are related. So far, this relationship has received little formal investigation...
Stefan Wehr, Manuel M. T. Chakravarty
ICFP
1999
ACM
13 years 12 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
ECOOP
1999
Springer
13 years 12 months ago
Type-Safe Delegation for Run-Time Component Adaptation
Abstract. The aim of component technology is the replacement of large monolithic applications with sets of smaller software components, whose particular functionality and interoper...
Günter Kniesel
ICFP
1999
ACM
13 years 12 months ago
Type Dispatch for Named Hierarchical Types
Type dispatch constructs are an important feature of many programming languages. Scheme has predicates for testing the runtime type of a value. Java has a class cast expression an...
Neal Glew
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...