101. CS312 SML Resources Bob Harper s excellent introduction to programming in Standard ml. A PracticalCourse in Functional programming Using Standard ml http://www.cs.cornell.edu/Courses/cs312/2000fa/sml/sml-resources.html

CS312 Resources for SML Installing Course Software (SML/NJ): Home page for Standard ML of New Jersey (SML/NJ) Windows : Self-installing executable (Win95, Win98, WinNT, and Win2000): self-installing.exe (version 110.0.6, October 31, 1999) To get the support needed for graphics for PS1, you will need to install a patched version of the runtime overwriting the one that came with the distribution. In more detail: First, install SML/NJ using the above self-installer. Download the patched runtime run.x86-win32.exe in some temporary directory on your system. Download the installation script install-patch.bat in the same directory you downloaded the patch. Unix (including Linux): follow the instructions on the page SML/NJ version 110.0.6 CS312 will be using the Standard ML of New Jersey (SML/NJ) interactive system, compiler, and libraries. SML/NJ should be installed on the Windows machines in the CIT labs. If you'd like to install SML/NJ on your own machine, then follow the links above for installation instructions. For Windows, this is straightforward (but you'll have to reboot.) For the Macintosh, you'll have to install some other SML implementation.

102. SML/NJ Literature ml for the Working Programmer assumes a little more programming experience thanElements Applicative High Order programming the Standard ml perspective http://flint.cs.yale.edu/cs421/smlnj/doc/literature.html

SML/NJ Literature Summary Tutorials Books Documentation Other Resources Tutorials Introduction to Standard ML Author: Robert Harper, CMU Postscript 374KB HTML (preliminary version of a new edition!) Using the SML/NJ System Author: Peter Lee, CMU HTML Four Lectures on Standard ML Author: Mads Tofte, DIKU Overview Lectures 1-3 Lecture 4 Code examples in lectures Essentials of Standard ML Modules Author: Mads Tofte, DIKU Lecture Notes (Postscript) The SML code (uuencoded compressed tar) Tips for Computer Scientists On Standard ML Author: Mads Tofte, DIKU Postscript 165KB A Gentle Introduction to ML Author: Andrew Cumming, Napier University Contents (html) Canadian mirror site Books Several textbooks on SML programming are available. We recommend the first two in this list. ML for the Working Programmer assumes a little more programming experience than Elements of ML Programming , however either one ought to be adequate for learning the language. Both of these books are in their second editions, now covering the SML '97 version of the language and Basis. ML for the Working Programmer (2nd edition) Author: Larry C. Paulson

103. Principles Of Programming Languages More on ml. The example ml program that shows preorder tree traveral is For extra credit, you may write an ml program to print a multiplication table http://www.csee.umbc.edu/courses/undergraduate/CMSC331/Fall99/Nicholas/lectures/

UMBC CSEE lectures news help Click here to go to recent lectures. If this falls behind, please send me email. Approximate Dates of Lectures: Thursday 9/2 Go over syllabus and start Chapter 1. My slides for chapter 1 Tuesday 9/7 Finish Chapter 1, and start slides for Chapter 2 Thursday 9/9 (Class was cancelled this day.) Tuesday 9/14 More from Chapter 2, with a focus on grammars and the BNF notation. Homework Exercises 2.4; 2.6; 2.9 d,e,f Thursday 9/16 Class was cancelled this day due to Hurricane Floyd. Tuesday 9/21 Finish Chapter 2. Thursday 9/23 Discussion of the "dangling-else". Began going over the slides for Chapter 3 . As you read Chapter 3, it would be ok to skip section 3.6. Tuesday 9/28 Finish Chapter 3, and begin discussing the Modula programming language. Thursday 9/30 Begin discussing the Modula language, and the use of the MOCKA Modula 2 compiler on linux.gl.umbc.edu. There was a handout describing how to use the Modula compiler. The handout was a Microsoft Word document entitled A Quick Guide to Running Modula 2 at UMBC Tuesday 10/5 After struggling with connecting my PC to the LCD projector, I talked about the Modula language. The discussion was based on the Hubertus

104. PLDI 98 Tutorial -- References N. Heintze, Setbased analysis of ml programs, Lisp and Functional programming, Z. Shao and A. Appel, A type-based compiler for Standard ml, programming http://pauillac.inria.fr/~xleroy/talks/references-pldi98.html

Compilation techniques for functional and object-oriented languages References Basic techniques and overviews of whole compilers S. L. Peyton-Jones, The implementation of functional programming languages , Prentice-Hall, 1987. A. Appel, Compiling with continuations , Cambridge University Press, 1992. C. Chambers, J. Dean, and D. Grove, Whole program optimization of object-oriented languages , technical report 96-06-02, University of Washington, 1996. C. Queinnec, Lisp in small pieces , Cambridge University Press, 1996. Intermediate languages and translation to C S. L. Peyton-Jones, T. Nordin, D. Oliva, C : a portable assembly language , Workshop Implementing Functional Languages, LNCS, 1998. Available at http://www.dcs.gla.ac.uk/ simonpj/c.html with other C documents. H. J. Boehm and M. Weiser, Garbage collection in an uncooperative environment , Software Practice and Experience 18(9), 1988. J. Bartlett, Scheme C, a portable Scheme-to-C compiler , research report 89/1, DEC WRL, 1989. M. Pettersson, Simulating tailcalls in C , chapter 9 of Compiling Natural Semantics , PhD thesis 413, Linköping University, 1995.

105. Machine Language For Beginners - Chapter 1 Assembly Language programming for the Atari Computers On the Atari, you couldtype. X=USR(1536) (and hit RETURN). and this will RUN your ml program. http://www.atariarchives.org/mlb/chapter1.php

How To Use This Book Although anyone wishing to learn 6502 machine language (ML) will likely find this book instructive and worthwhile, the specific example programs are written to work on five popular personal computers: Apple, Atari, VIC, Commodore 64, and the PET/CBMs. If your computer uses the 6502 microprocessor, but is not one of these machines, you will need to find a "memory map" for your particular machine. These maps - widely available in books and magazines, and from user groups - will allow you to follow and practice with the examples of 6502 machine language throughout this book. In particular, there are several memory addresses which are used in many of the examples presented in this book. Their addresses are given for the five computers mentioned above, but if you have a different computer, you should look them up in a map of your machine: "Which key is pressed?" This is an address, usually somewhere in the first 256 addresses, which is always holding the value of the most recently pressed key on the keyboard. Starting Address of RAM Screen Memory . This is the address in your computer where, if you POKEd something into it from BASIC, you would see the effect in the upper left-hand corner of your screen.

106. Standard ML Standard ml is a popular functional programming language designed by Standard ml is one of a very few programming languages with a fully formal http://www.lfcs.inf.ed.ac.uk/software/ML/

LFCS People Publications Informatics Laboratory for Foundations of Computer Science The Standard ML Language Standard ML is a popular functional programming language designed by researchers in the LFCS in the 1980's. In 1987, Robin Milner and the LFCS won the BCS Award for Technical Excellence for work on Standard ML. Originally ML was conceived as a Meta Language for the theorem-proving system Edinburgh LCF, but it evolved into a successful general-purpose programming language. The language was standardised in 1990, and revised in 1997 as Standard ML '97 Standard ML is one of a very few programming languages with a fully formal definition, giving it significant appeal for both research purposes, and industrial-strength applications. One of the most appealing aspects of the language is that it is safe: all errors that could de-rail an ML program are detected at compile-time or handled neatly at run-time. This property makes program development and debugging much easier than in other unsafe languages (e.g. C++). Standard ML Documents Here are some useful documents which help with learning Standard ML. Beware that some of these documents only cover the older 1990 definition of Standard ML.

107. School Of Informatics Course Descriptor The clean functional programming paradigm represented by ml is quite differentfrom the Functional programming in Standard ml The functional paradigm. http://www.inf.ed.ac.uk/teaching/courses/fps.html

Course Descriptor Course: Functional Programming and Specification Course Web page Credit Points Credit Level Acronym INF-3-FPS Study Pattern Study Format Hours Lectures Tutorials Timetabled Laboratories Non-timetabled assessed assignments Private Study/Other Total Pre-requisite Courses None Other Pre-requisite Requirements CS2. Alternatively, a good background in some programming language together with a familiarity with basic notation from logic (logical connectives, quantifiers, etc.) and proofs using equational reasoning and induction. Co-requisites/Forbidden Combinations None Short Description The course has two aims. The first is to provide an introduction to programming in Standard ML including the use of the facilities it offers for structuring programs into modules. The clean functional programming paradigm represented by ML is quite different from the imperative object-oriented paradigm represented by Java, making it more suitable for some applications. The second aim is to provide an introduction to formal methods for specification and development of programs, using the Extended ML specification framework as a vehicle. Simple proofs of properties of functions are interwoven with the first part of the course to link it with the second part. Summary of Intended Learning Outcomes Students will be able to design a representation of an informally-described data structure in ML as a datatype, and translate an informal description of an algorithm into an ML function, making appropriate use of higher-order functions and other characteristic features of the functional programming paradigm.

108. Applicative Programming Reading List An excellent textbook to accompany these notes is Paulson s ``ml for the WorkingProgrammer (Second Edition) Pau96. In fact, at the time of writing, http://www.disi.unige.it/person/MoggiE/LP/SML/NOTES/node8.html

NEXT UP PREVIOUS CONTENTS ... INDEX Reading material 's ``ML for the Working Programmer (Second Edition)'' [ ]. In fact, at the time of writing, this is the only textbook which can be recommended without reservation because it is the only textbook which deals with the 1997 revision of the Standard ML languagesometimes called SML'97the other textbooks refer to the 1990 issue of the language standard, and some even pre-date that. Of particular interest in Paulson's book are the chapters devoted to the module system of Standard ML and the material on proving the correctness of a function with respect to a description of its behaviour. The book contains many exercises and specimen answers for some of these can be obtained from Paulson's Web page 's ``Elements of ML Programming'' [ 's ``Applicative High-Order Programming'' [ 's ``Elements of Functional Programming'' [ ]. These also contain exercises but they do provide specimen solutions, at least for selected exercises. 's ``Introduction to Standard ML'' [ ] is published as a University of Edinburgh technical report and gives a concise description of the Standard ML core language and the modules system. Material on the verification of functions is not included. There are many exercises with specimen answers.

109. A Gentle Introduction To ML a tutorial for the Standard ml language. http://www.dcs.napier.ac.uk/course-notes/sml/manual.html

A Gentle Introduction to ML By Andrew Cumming Computer Studies Napier University Edinburgh Also in this series A Gentle Introduction to SQL A Gentle Introduction to XML This service is hosted by There are copies and other formats Contents Lessons Other resources Introductions Functional languages are introduced. Advice on how to use this document is given and CAL is dismissed. Contributions from readers are presented. Lesson One "Hello World" is our first program. Tutorial One concerns expressions and simple functions. Diversion: The Reconcilation Ball Self Test One: some multiple choice question to try. Lesson Two Types, bindings, pattern matching and lists are all introduced Tutorial two Diversion: Bitmaps Self Test Two. Lesson Three More on types, Currying and recursion Tutorial Three (simple recursion on integers) Diversion: The Mandelbrot Set Self Test Three. Lesson Four List processing. Tutorial Four (list and more lists) Lesson Five Incompleteness, Overlapping Left Hand Sides, Conditions, Anonymous Functions. Tutorial Five (even more recursion) Diversion: Language Translation. Lesson Six Common recursive patterns, map, reduce, zip

110. 4. Using ML This tells you that the ml.EXE program has automatically called up the LINK. COM program. The ml program figured this out because we d used the .model http://users.easystreet.com/jkirwan/new/x86lrn04.html

Now that we've gone through the process of using DEBUG, let's walk though the creation of the second program when using ML. Using ML and LINK Although you can create a finished program with a single DOS command, using ML, there are actually two programs at work. These are ML.EXE and LINK.EXE. ML will assemble a source code file written by you into what is called an "object file." This object file is not the completed program, though. It's an intermediate step. The reason that an intermediate step is used is because there are many times when programmers will prefer to write a program using more than one source file one program, many source files. So when your source code is first assembled, it is assembled into an object file with the extension of .OBJ. As a second step, the linker (LINK.EXE) is then notified about how many object files are supposed to be combined into a single program and it does it. This process of compiling into object files and then later linking those object files into the final program is called "separate compilation." Some languages support it, some don't. Assembly coding almost always does support it. When you use ML, by default it invokes LINK.EXE to finish up the process and make the final program. If you don't want that, you have to add a command line option, "/c", to the DOS command you use to start ML.EXE. But for short programs (and particularly, for your first programming efforts), it's a lot easier to simply let ML invoke the linker after it is done assembling the source code file.

111. Language/ml/ml_lex/ mlLex has a syntax similar to Lex, and produces an ml program instead of aCprogram. ml-Lex produces a program that runs very efficiently. http://www.ptf.com/ptf/products/UNIX/current/0367.0.html

language/ml/ml_lex/ Prime Time Freeware for UNIX, Issue 4-2 Help Home Overview Topic Full Contents Topic Full Keyword Page: A B C D ... Z Package: language ml functional programming language ... Home Send inquiries or trouble reports to webmaster@ptf.com

112. Take-home (Fall 2002) Also, put a comment at the top of each ml program telling me whether you used aWin PC version of ml, or the Unix version that I have online for the class. http://www.cs.unc.edu/~stotts/COMP204/exams/f02mtout.html

Take-home (Fall 2002) COMP 204 Midterm Exam Due classtime, Tuesday Nov. 19 This portion of the exam is open-book, open-notes, open-web, open-instructor, but closed-friends-and-classmates. Please sign a pledge on the part you turn in stating that you can done your own work within these guidelines. In all the problems that require you to write ML code, submit a text file that conatins your code, and your test cases, so that I can run the ML interpreter, "use" your file, and see the execution... have the execution demonstrate via tests the correctness of your solution. Also, put a comment at the top of each ML program telling me whether you used a Win PC version of ML, or the Unix version that I have online for the class. Oh, I guess there is a third possibility... a Linux version of the latest ML on PC. So, I want a separate text file submitted (as email attachments) for each ML program. Name the files according to problem... such as "p1a.txt", "p2b.txt" etc... Make the file names end in ".txt" so my mailer will auto-display the attached files too. The rest of the exam please hand in on paper to my mailbox or office. In the paper you write, make sure you explicitly state for the problems with program parts something like "emailed attached program p1a.txt" or whatever so I will know to look for it and that you did not overlook the problem. There may well be other explanatory information needed for the program parts as well (for example, problem 5).

113. Student Projects At IT-C First, support for accessing Web services from Standard ml programs (eg, Xml parsing The goal of this project is to write a Standard ml program that http://www.itu.dk/people/mael/studentprojects.html

Student Projects at IT-C by Martin Elsman - last revised: 2003-04-02 Home : Student Projects at IT-C Possible Master's Thesis Projects SMLserver Web Services: The goal of this project is to add support for SOAP -based Web services in the Standard ML programming language. There are two aspects of this project. First, support for accessing Web services from Standard ML programs (e.g., from SMLserver scriptlets) is needed. Second, support for writing Web services in the programming language Standard ML and publicising such Web services are open to investigation. Requirements: Knowledge about Standard ML and XML. Posix Library for Standard ML: On the basis of the Standard ML Basis Library specification, the goal of this project is to implement and create test cases for the Posix part of the library. The library should be implemented in the framework of the ML Kit compiler, although compatibility with other compilers (such as Moscow ML ) is important. Requirements: Knowledge about Standard ML and C. Thread Support for the ML Kit with Regions: The goal of this project is to design and implement a thread library for the ML Kit , a Standard ML compiler, which uses a non-traditional mechanism for memory management, called region inference. The thread-library should be implemented on top of

114. Project Proposals For Master Of Science Projects And 4/12/16-week Projects First, support for accessing Web services from Standard ml programs (eg, The goal of this project is to write a Standard ml program that takes a text http://www.itu.dk/research/plt/proglangproposals.html

Project Proposals for Master of Science projects and 4/12/16-week projects Projects SMLserver Web Services Suggested size: Master's Thesis project; workload: 30% theoretical/70% practical. Add SOAP-capabilities to SMLserver (client-side and server-side). The goal of this project is to add support for SOAP -based Web services in the Standard ML programming language. There are two aspects of this project. First, support for accessing Web services from Standard ML programs (e.g., from SMLserver scriptlets) is needed. Second, support for writing Web services in the programming language Standard ML and publicising such Web services are open to investigation. People: Martin Elsman (contact); ME HN (possible supervisors). Prerequisites: Knowledge about Standard ML and XML. Keywords: web services; SOAP; Standard ML; functional programming; SMLserver; POSIX library for Standard ML Suggested size: Master's Thesis project; workload: 30% theoretical/70% practical. Implement the POSIX part of the SML Basis Library and construct test case that show that the implementation follows the spec.

115. FAQ: Use Of Ml For Nonlinear Model We could extend the ml program to estimate robust variances with the robust optionor with the cluster() option. . ml model lf mlnexpgr (B1rep78=headroom http://www.stata.com/support/faqs/stat/nl_ml8.html

Home FAQs Use of ml for nonlinear model How do I estimate a nonlinear model using ml? Title Use of ml for nonlinear model Authors Weihua Guan, Gustavo Sanchez, StataCorp Date February 2002; updated July 2005 Consider the model y = f(x) + e where y is the outcome, f(x) is a nonlinear form of covariate x, and e is the random error. We can change the equation into e = y - f(x) Assuming that the errors are distributed as N(0,sigma), we are allowed to write the density function, which is also the likelihood function. 1 e^2 f(e) = - exp(- -) sqrt(2*_pi)*sigma 2*sigma^2 Then, the log-likelihood function will be lnL = -0.5*ln(2*_pi) - ln(sigma) - 0.5*e^2/sigma^2 = -0.5*ln(2*_pi) - ln(sigma) - 0.5*(y-f(x))^2/sigma^2 We now need to parse f(x) into several linear combinations of x covariates and other parameters. Here we use the first example in [R] nl to show how to write the ml program for the same model. The nl program is written in the manual as Using the auto dataset we obtain the following results: . sysuse auto, clear

116. The BANE Home Page The only way an ml program can unexpectedly terminate is with an uncaught exception . Tracking down Exceptions in Standard ml Programs. http://http.cs.berkeley.edu/Research/Aiken/bane.html

The Berkeley ANalysis Engine Introduction The Engine Applications People ... Carillon , a BANE-based system for finding Y2K errors in C programs, is now available! Introduction BANE is a toolkit for constructing program analyses such as dataflow and type inference systems. Program analyses are widely used in compilers and software engineering tools for discovering or verifying specific properties of software systems, such as type safety and opportunities for program optimization. BANE is constraint-based , meaning that analyses are formulated as systems of constraints generated from the program text. Constraint resolution (i.e., solving the constraints) computes the desired information. Constraints are a natural conceptual and engineering framework for program analysis. From the viewpoint of the analysis designer, the problem of implementing an analysis is reduced to the problem of writing code to generate appropriate constraints, which is often done with a simple recursive walk of the abstract syntax tree. The analysis engine takes care of all details of constraint representation and resolution. From an engineering perspective, there are many opportunities for optimizing the representation and resolution of constraints that can be encapsulated inside the resolution engine. In addition to work on the engine itself, we are devoting substantial energy to writing

117. Pop11 Help Pml For help in writing mixedlanguage programs in Pop-11 and ml seeHELP*mlINPOP -6 http://www.poplog.org/docs/popdocs/pop11/help/pml

HELP PML Robert Duncan, March 1990 Revised November 1994 An introduction to the Poplog Standard ML subsystem. Introduction Running PML Initialisation Command Line Arguments ... References and Further Reading 1 Introduction Poplog ML (PML) is an implementation of the programming language Standard ML (SML): a statically-scoped, strict functional language with a polymorphic, static type system, a type-secure exception mechanism and a powerful module facility for the support of large-scale programming projects. Both the static and dynamic semantics of SML are formally defined: see references [1,2] below. Poplog ML attempts a faithful implementation of the formal semantics: known deficiences are documented in HELP*BUGS ; extensions are described in HELP*FEATURES pml 2 Running PML PML is supplied as a Poplog saved-image. To run it, give + pml as an argument to the command invoked from the shell or DCL, as follows: $ pop11 +pml Most sites should have a command abbreviation installed for this which will allow you to type just: $ pml instead. In either case, PML will print a version banner, followed by the word Setml Setml is printed whenever the PML system is reset on start-up, or after an error or an interrupt. The primary prompt indicates that PML is waiting for new input: you can then type either a standard top-level declaration for evaluation, or a PML command. A secondary prompt, "=", will appear whenever the input typed so far is incomplete. Commands are not a part of Standard ML: they are an addition to PML to allow access to features of the Poplog system. Useful commands to try are: -

118. CS152 Spring 2005 Schedule Question for the day Where does a new, unknown type come from in an ml program?When do two types have to be equal in an ml program? http://www.eecs.harvard.edu/~nr/cs152/schedule.html

CS 152 Schedule Note: This schedule is subject to change without notice at any time . Expect it to change approximately weekly throughout the semester. For pointers to lecture notes, and for more information about what's going on, consult the syllabus Wednesday, 2/2 Course intro Read: Ramsey and Kamin, chapters 1 and 2 Paul Graham, Beating the Averages Friday, 2/4 An imperative core; abstract syntax and environments Question for the day: What could a name or identifier possibly mean? Monday, 2/7 Inference rules and evaluation Question for the day: How do I prove a fact that is true of any possible program? Tuesday, 2/8 Not a class day, but Assignment for intro: Introduction; imperative core; ASTs, environments, and semantics due at 11:59 PM. Wednesday, 2/9 Scheme: S-expressions, programming with recursion and lists, association lists Question for the day: In language design, what are the connections between data and control? Read: Ramsey and Kamin, chapter 3. Friday, 2/11 Scheme: functions as values, the funarg problem, closures Question for the day: Why doesn't C have nested functions?

119. VUMC Department Of Biomedical Informatics (Courses) MD/PhD and MD/MS Program Part 2 Machine Learning. Introduction to MLprogramming techniques with MATLAB. Data cleaning and preparation (confidentiality http://www.mc.vanderbilt.edu/dbmi/education/courses.php

Search DBMI : Courses/Syllabus Course # Title Instructor Credits Info Fall Only Healthcare Organization and Management N Lorenzi Syllabus Lab - Healthcare Organization and Management N Lorenzi Lab Introduction to Disease Processes R Miller K Johnson Fall and Spring Foundations of Biomedical Informatics K Johnson D Masys Syllabus Lab - Foundations of Biomedical Informatics D Masys K Johnson Foundations of Bioinformatics and Computational Biology E Boczko Lab - Foundations of Bioinformatics and Computational Biology E Boczko Biomedical Artificial Intelligence I C Aliferis R Miller I Tsamardinos Lab - Biomedical Artificial Intelligence I I Tsamardinos C Aliferis R Miller Clinical Information Systems and Databases D Giuse Advanced Biomedical Informatics R Miller Summer Graduate Seminar on Biomedical Informatics Algorithms I Tsamardinos C Aliferis Class descriptions: 300. Foundations of Biomedical Informatics. Management and transformation of health data, information, and knowledge to improve health care. Focus on information systems in clinical settings and the use of databases for outcome management. Introduction to clinical cognitive biases, formal Medical Decision Making methods, and methods for Evidence-Based Practice. FALL/SPR [3] K Johnson D Masys 300a. Lab - Foundations of Biomedical Informatics.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 6     101-119 of 119    Back | 1  | 2  | 3  | 4  | 5  | 6