Characterization of object behaviour in Standard ML of New Jersey

1994 ◽  
Author(s):  
Darko Stefanovic ◽  
J. Eliot B. Moss
Keyword(s):  
New Jersey ◽  
Standard Ml

Characterization of object behaviour in Standard ML of New Jersey

1994 ◽  
Vol VII (3) ◽  
pp. 43-54 ◽  
Author(s):  
Darko Stefanovic ◽  
J. Eliot B. Moss
Keyword(s):  
New Jersey ◽  
Standard Ml

Incremental Recompilation for Standard ML of New Jersey

1994 ◽  
Author(s):  
Robert Harper ◽  
Frank Pfenning ◽  
Peter Lee ◽  
Eugene Rollins
Keyword(s):  
New Jersey ◽  
Standard Ml

Characterization of the indigenous PAH-degrading bacteria of Spartina dominated salt marshes in the New York/New Jersey Harbor

2007 ◽  
Vol 19 (3) ◽  
pp. 347-363 ◽  
Author(s):  
L. A. Launen ◽  
J. Dutta ◽  
R. Turpeinen ◽  
M. E. Eastep ◽  
R. Dorn ◽  
...  
Keyword(s):  
New York ◽  
New Jersey ◽  
Salt Marshes ◽  
Degrading Bacteria

Integrated characterization of the geologic framework of a contaminated site in West Trenton, New Jersey

2012 ◽  
Vol 79 ◽  
pp. 71-81 ◽  
Author(s):  
Karl J. Ellefsen ◽  
William C. Burton ◽  
Pierre J. Lacombe
Keyword(s):  
New Jersey ◽  
Contaminated Site

Weak polymorphism can be sound

1996 ◽  
Vol 6 (1) ◽  
pp. 111-141 ◽  
Author(s):  
John Greiner
Keyword(s):  
New Jersey ◽  
Type System ◽  
Type Systems ◽  
Type Inference ◽  
Inference Algorithm ◽  
Standard Ml ◽  
Polymorphic Type

AbstractThe weak polymorphic type system of Standard ML of New Jersey (SML/NJ) (MacQueen, 1992) has only been presented as part of the implementation of the SML/NJ compiler, not as a formal type system. As a result, it is not well understood. And while numerous versions of the implementation have been shown unsound, the concept has not been proved sound or unsound. We present an explanation of weak polymorphism and show that a formalization of this is sound. We also relate this to the SML/NJ implementation of weak polymorphism through a series of type systems that incorporate elements of the SML/NJ type inference algorithm.

Functional unparsing

1998 ◽  
Vol 8 (6) ◽  
pp. 621-625 ◽  
Author(s):  
OLIVIER DANVY
Keyword(s):  
New Jersey ◽  
Dependent Types ◽  
Standard Ml ◽  
Control String

A string-formatting function such as printf in C seemingly requires dependent types, because its control string determines the rest of its arguments. Examples:formula hereWe show how changing the representation of the control string makes it possible to program printf in ML (which does not allow dependent types). The result is well typed and perceptibly more efficient than the corresponding library functions in Standard ML of New Jersey and in Caml.

Sign in / Sign up

Export Citation Format

Share Document