|
|
| |
| Authors | ?? |
| Language | English |
| Type | public |
| Url | |
| Summary | This document is an introduction to ML programming,
specifically for the OCaml implementation. |
| Pages | 101 |
| Parts | |
| |
| |
| Authors | Laurent Chéno
Alain Bèges |
| Language | Français |
| Type | public |
| Url | |
| Summary | décrit les structures rencontrés dans toutes sortes
d'algorithmes classiques, des algorithmes spécifiques aux graphes
et des algorithmes de géometrie comme par exempe la recherche de
l'enveloppe convexe d'un ensemble de points du plan. |
| Pages | 136 |
| Parts | Structures de données
Quelques qlgorithmes sur les graphes
Quelques qlgorithmes de géométrie combinatoire
Annexes |
| |
| |
| Authors | Tom Hirschowitz
Xavier Leroy |
| Language | Français |
| Type | public |
| Url | |
| Summary | The ML module system provides powerful parameterization
facilities, but lacks the ability to split mutually recursive
definitions across modules, and does not provide enough facilities
for incremental programming. A promising approach to solve these
issues is Ancona and Zucca s mixin modules calculus CMS. However,
the straightforward way to adapt it to ML fails, because it allows
arbitrary recursive definitions to appear at any time, which ML
does not support. In this paper, we enrich CMS with a refined type
system that controls recursive definitions through the use of
dependency graphs. |
| Pages | 15 |
| Parts | Introduction
Overview
The CMSv calculus
Compilation
Type soundness of the translation
Related work |
| |
| |
| Authors | Xavier Leroy |
| Language | English |
| Type | public |
| Url | |
| Summary | Documentation and user's manual |
| Pages | 468 |
| Parts | An introduction to Objective Caml
The Objective Caml language
The Objective Caml tools
The Objective Caml library |
| |
| |
| Authors | Jason Hickey |
| Language | English |
| Type | public |
| Url | |
| Summary | This document is an introduction to ML programming,
specifically for the Objective Caml (OCaml) programming language
from INRIA. OCaml is a dialect of the ML (Meta-Language) family of
languages, which derive from the Classic ML language designed by
Robin Milner in 1975 for the LCF (Logic of Computable Functions)
theorem prover. |
| Pages | 109 |
| Parts | 1 Introduction
2 Simple Expressions
3 Variables and Functions
4 Basic Pattern Matching
5 Tuples, Lists, and Polymorphism
6 Unions
7 Exceptions 47
8 Records, Arrays, and Side-E ects
9 Input and Output
10 Files, Compilation Units, and Programs
11 The OCaml Module System
12 The OCaml Object System |
| |
| |
| Authors | Didier Rémy |
| Language | English |
| Type | public |
| Url | |
| Summary | These course notes are addressed to a wide audience of
people interested in modern programming languages in general,
ML-like languages in particular, or simply in OCaml, whether they
are programmers or language designers, beginners or knowledgeable
readers little prerequiresite is actually assumed. |
| Pages | 180 |
| Parts | 1 Core ML
2 The core of OCaml
3 The object layer
4 The module language
5 Mixing modules and objects |
| |
| |
| Authors | Antonio Vicente |
| Language | English |
| Type | public |
| Url | |
| Summary | Give an implementation of design patterns in Ocaml |
| Pages | 18 |
| Parts | 1 Background and Motivation
2 Results and Evaluation
3 Lessons Learned and Conclusions
4 Creational Patterns
5 Structural Patterns
6 Behavior Patterns
7 References |
| |
generated by OrgaDoc 0.8
|