Sciweavers

35 search results - page 3 / 7
» A Type-Based Compiler for Standard ML
Sort
View
POPL
1990
ACM
13 years 10 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
ICFP
1999
ACM
13 years 10 months ago
Interlanguage Working Without Tears: Blending SML with Java
A good foreign-language interface is crucial for the success of any modern programming language implementation. Although all serious compilers for functional languages have some f...
Nick Benton, Andrew Kennedy
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
13 years 11 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
ML
2006
ACM
14 years 7 days ago
ML grid programming with ConCert
Grid computing has become increasingly popular with the growth of the Internet, especially in large-scale scientific computation. Computational Grids are characterized by their s...
Tom Murphy VII
APLAS
2008
ACM
13 years 8 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae