Restrict to: Header Title Order by: Expected citations Hubs Usage Date Try: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
More than 10000 results. Only retrieving 500 documents (System busy - maximum reduced).
Retrieving documents...
Order: number of citations.
A Syntactic Approach to Type Soundness - Wright, Felleisen (1992)
(Correct) (290 citations)
a type soundness theorem for the core of Standard ML, which includes the first type soundness proof for
realization in the programming language Standard ML [22, 23]Soundness proofs exist for the functional
a proof of soundness for the core 1 of Standard ML, which extends a functional polymorphic language
www.cs.rice.edu/CS/PLT/Publications/./ic94-wf.ps.gz
The Essence of Functional Programming - Wadler (1992)
(Correct) (284 citations)
Impure functional languages, such as Standard ML or Scheme, offer a tempting spread of features such
are Haskell [HPW91]Miranda 1 Tur90]Standard ML [MTH90]and Scheme [RC86]Some readers will
operation, found in Scheme [RC86] and Standard ML of New Jersey [DHM91]The following operation
cm.bell-labs.com/who/wadler/topics/../papers/essence/essence.ps.gz
Dynamic Typing in Polymorphic Languages - Abadi, Cardelli, Pierce, Rémy (1992)
(Correct) (259 citations)
consider languages with implicit polymorphism in the ML style. The same ideas can be used, with some
Mauny, who define and investigate two extensions of ML with dynamic types. We compare their designs to
must be generated at run time. For languages such as ML, where type information is not retained at run
www.cs.indiana.edu/pub/pierce/polydyn.ps.gz
Pict: A Programming Language Based on the Pi-Calculus - Pierce, Turner (1997)
(Correct) (180 citations)
language can be constructed from the calculus. ML, Haskell, calculus calculus A
-just as typed functional languages such as ML and Haskell are typically based on a -calculus
omitted from user programs. Some languages, such a ML and Haskell, which are based on the HindleyMilner
www.cs.indiana.edu/l/www/pub/pierce/pict-design.ps.gz
A Type-Theoretic Approach to Higher-Order Modules with Sharing - Harper, Lillibridge (1993)
(Correct) (171 citations)
The "sharing" specifications of Standard ML address this issue by allowing the programmer to
most uses of type sharing specifications in Standard ML. Modules are treated as "first-class" citizens, and
easily restricted to "second-class" modules found in ML-like languages. 1 Introduction Modularity is an
www.cs.cmu.edu/afs/cs.cmu.edu/project/fox/mosaic/papers/mdl-sharing.ps
Standard ML of New Jersey - Appel, MacQueen (1991)
(Correct) (152 citations)
Standard ML of New Jersey Andrew W. Appel #Princeton
528, pp. 1-13, August 1991. Abstract The Standard ML of New Jersey compiler has been under development
a robust and complete environment for Standard ML that supports the implementation of large software
www.cs.princeton.edu/fac/appel/papers/smlnj.ps
TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995)
(Correct) (139 citations)
TIL: A Type-Directed Optimizing Compiler for ML David Tarditi Greg Morrisett Perry Cheng Chris
Abstract We describe a new compiler for Standard ML called TIL, that is based on four technologies:
against that of a widely used compiler, Standard ML of New Jersey. This research was sponsored in part
www.cs.cmu.edu/~rwh/papers/til/tr.ps
Java Security: From HotJava to Netscape and Beyond - Dean, Felten, Wallach (1996)
(Correct) (129 citations)
modules in Modula-2[33]or structures in Standard ML[25]While package names consist of components
introduction of parameterized modules, like Standard ML's functors[25]should also be investigated.
M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, Cambridge, MA, 1990. 26] M. Mueller.
www.cs.umbc.edu/~nicholas/courses/491/preprint.ps
A Modal Analysis of Staged Computation - Rowan Davies (1996)
(Correct) (124 citations)
two-level functional language in our language Mini-ML 2 thus proving that bindingtime correctness is
modal correctness on this fragment. In addition Mini-ML 2 can also express immediate evaluation and
code of type A. We begin by considering Mini-ML 2 e ,a formulation of intuitionistic modal S4 in
www.cs.cmu.edu/afs/cs.cmu.edu/user/fp/www/papers/popl96.ps.gz
Optimizing ML with Run-Time Code Generation - Leone, Lee (1995)
(Correct) (119 citations)
Optimizing ML with Run-Time Code Generation Mark Leone Peter Lee
translates ordinary programs written in a subset of ML into code that generates native code at run time.
that takes ordinary programs written in a subset of ML and automatically compiles them into native code
foxnet.cs.cmu.edu/~petel/papers/staged/mleone-pldi96.ps
An Empirical Study of Smoothing Techniques for Language Modeling - Chen, al. (1996)
(Correct) (118 citations)
of words. This is called the maximum likelihood ML) estimate for P (w i jw i\Gamma1 )While
www.cs.cmu.edu/~sfc/html/../papers/acl96.ps.gz
The Revised Report on the Syntactic Theories of.. - Matthias Felleisen.. (1992)
(Correct) (117 citations)
exceptions, and continuations. Typical examples are ML [16]Scheme [19]and Common Lisp [20]While
about existing languages. Languages such as Scheme, ML, and Common Lisp have grown through practical
of closure to the more common notion of Scheme- and ML-like closures whose lexical variables may be bound
ftp.cs.indiana.edu/indra/scheme-repository/doc/pubs/ricetr100.ps.gz
Two Models For Integrating Persistence and Lazy Functional.. - McNally, Davie (1991)
(Correct) (94 citations)
as Amber[Card83] and a proposal for persistence in ML do not preserve referential integrity in that
ftp.dcs.st-and.ac.uk/pub/staple/SIGPLAN.ps.Z
Higher-Order Logic Programming - Nadathur, Miller (1986)
(Correct) (93 citations)
programming languages such as Lisp, Scheme and ML permit procedures to be encapsulated within data in
problem solvers. The functional programming language ML has often been used to implement tactics and
functions as values. For example, in a language like ML [MTH90]function expressions can be constructed
www.cs.uchicago.edu/~gopalan/papers/holp.ps.Z
Multiagent Systems: A Survey from a Machine Learning Perspective - Stone, Veloso (1997)
(Correct) (85 citations)
are biased towards those that use machine learning (ML) approaches. Furthermore, every effort is made to
to highlight additional opportunities for applying ML to MAS. Although there are many possible ways to
in the various multiagent scenarios. When possible, ML approaches are emphasized. In increasing order of
reports-archive.adm.cs.cmu.edu/anon/1997/CMU-CS-97-193.ps.gz
Competitive Algorithms for Distributed Data Management - Bartal, Fiat, Rabani (1992)
(Correct) (84 citations)
We deal with the file allocation problem (DF]ML]where copies of a file may be be stored in the
on Theory of Computing, pages 322-333, May 1988. ML] H.L. Morgan and K.D. Levin. Optimal Program and
www.cs.technion.ac.il/~rabani/pss/Publications/BartalFR92.ps.gz
Rule Induction with CN2: Some Recent Improvements - Clark, Boswell (1991)
(Correct) (83 citations)
machine learning systems, and has been the first ML technology to deliver commercially successful
This work was funded under the Esprit MLT project, Number 2154. Thanks to Ivan Bratko, Tim
Databases. Availability of CN2 As part of Esprit MLT project 2154, CN2 has been implemented in C and
www.cs.utexas.edu/users/pclark/papers/newcn.ps
Dynamic Parameter Encoding for Genetic Algorithms - Schraudolph, Belew (1992)
(Correct) (72 citations)
www.eark.polytechnique.fr/EC/GA/papers/ml-dpe92.ps.gz
www.eark.polytechnique.fr/EC/GA/papers/ml-dpe92.ps.gz
Garbage Collection Can Be Faster Than Stack Allocation - Appel (1987)
(Correct) (67 citations)
languages with garbage collection (LISP, Mesa, Icon, ML, Mainsail, etc.the programmer need not worry
a simple experiment was run: the Edinburgh Standard-ML[5] system compiling 2277 lines of Standard-ML code.
system compiling 2277 lines of Standard-ML code. This system is designed for portability
http.cs.berkeley.edu/~aiken/cs264/papers/gc-faster-than-stack.ps.Z
Proving Java Type Soundness - Syme (1997)
(Correct) (66 citations)
higher order logic)and the automatic generation of ML code for an interpreter, directly from the
Type checking of higher order logic 2. Compiling to ML and running test cases. Here we concentrate on the
v class relation shown in Section 2.1 compiles to a ML function that is semantically equivalent to the
www.cl.cam.ac.uk/users/drs1004/java.ps
First 20 documents Next 20
Try your query at:
Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC