Sciweavers

2362 search results - page 10 / 473
» Programming in Standard ML
Sort
View
ICFP
1996
ACM
14 years 21 days ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey
ML
2008
ACM
109views Machine Learning» more  ML 2008»
13 years 8 months ago
O'browser: objective caml on browsers
We present a way to run Objective Caml programs on a standard, unmodified web browser, with a compatible data representation and execution model, including concurrency. To achieve...
Benjamin Canou, Vincent Balat, Emmanuel Chailloux
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 5 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
ICFP
2008
ACM
14 years 8 months ago
Space profiling for parallel functional programs
This paper presents a semantic space profiler for parallel functional programs. Building on previous work in sequential profiling, our tools help programmers to relate runtime res...
Daniel Spoonhower, Guy E. Blelloch, Robert Harper,...
PLDI
1998
ACM
14 years 24 days ago
Eliminating Array Bound Checking Through Dependent Types
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
Hongwei Xi, Frank Pfenning