Sciweavers

2477 search results - page 209 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
ICFP
2010
ACM
15 years 7 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
ICFP
2008
ACM
16 years 6 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 6 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
170
Voted
ML
2006
ACM
103views Machine Learning» more  ML 2006»
16 years 10 days 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...
TOPLAS
2008
79views more  TOPLAS 2008»
15 years 4 months ago
Witnessing side effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alex Aiken