Sciweavers

ML
2007
ACM
13 years 11 months ago
Status report: specifying javascript with ML
The Ecma TC39-TG1 working group is using ML as the specification language for the next generation of JavaScript, the popular programming language for browser-based web applicatio...
David Herman, Cormac Flanagan
POPL
1995
ACM
14 years 3 months ago
Applicative Functors and Fully Transparent Higher-Order Modules
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
Xavier Leroy
PLDI
1995
ACM
14 years 3 months ago
A Type-Based Compiler for Standard ML
Compile-time type information should be valuable in efficient compilation of statically typed functional languages such as Standard ML. But how should type-directed compilation w...
Zhong Shao, Andrew W. Appel
POPL
1990
ACM
14 years 3 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
PEPM
1994
ACM
14 years 3 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder
POPL
1996
ACM
14 years 3 months ago
From Region Inference to von Neumann Machines via Region Representation Inference
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...
Lars Birkedal, Mads Tofte, Magnus Vejlstrup
ASM
2000
ASM
14 years 3 months ago
An ASM Dynamic Semantics for Standard ML
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
Steven C. Cater, James K. Huggins
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 4 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...
APLAS
2003
ACM
14 years 4 months ago
Scrap Your Boilerplate
This paper introduces a Standard ML realization of the scrap-yourboilerplate generic-programming mechanism (first introduced by Simon Peyton Jones and Ralf Lämmel), which gives ...
Simon L. Peyton Jones, Ralf Lämmel
PADL
2004
Springer
14 years 4 months ago
Typing XHTML Web Applications in ML
Abstract. In this paper, we present a type system for typing Web applications in SMLserver, an efficient multi-threaded Web server platform for Standard ML scriptlets. The type sys...
Martin Elsman, Ken Friis Larsen