[Caml-list] Applications written in O'Caml

[Caml-list] Applications written in O'Caml

[Vincent Foley]

On http://caml.inria.fr, there's a section mentionning some applications
written in O'Caml.  I'm pretty sure this list is not quite up to date
(considering that a very nice application, Active DVI, is not included
there.)  I'd like to know, besides the application mentionned there and
Active DVI, are there other significant applications written in O'Caml?

Regards,
  Vincent

P.S.: I also meant to ask: does anyone know schools where students are
given programming classes with O'Caml?

-- 

Vincent Foley-Bourgon
Email: vinfoley@iquebec.com
Homepage: http://darkhost.mine.nu:81
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Benjamin C. Pierce]

> P.S.: I also meant to ask: does anyone know schools where students are
> given programming classes with O'Caml?

The intro computer science sequence at the University of Pennsylvania
uses OCaml for the first two months (then switches to Java).

         http://www.seas.upenn.edu/~cse120/home.html

   -- Benjamin
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Maxence Guesdon]

> On http://caml.inria.fr, there's a section mentionning some applications
> written in O'Caml.  I'm pretty sure this list is not quite up to date
> (considering that a very nice application, Active DVI, is not included
> there.)  I'd like to know, besides the application mentionned there and
> Active DVI, are there other significant applications written in O'Caml?

You can see applications written in ocaml here :
http://caml.inria.fr/humps/caml.html#Applications

If someone knows about other applications, just let me know :

hump@pauillac.inria.fr

--
Maxence Guesdon
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

[Caml-list] Simple question

[Eric Merritt]

let me start off by saying that if this is not the
place to post this type of question please direct me
to the correct list/group. I am picking up ocaml,
starting off by doing a few simple things. I am at
somewhat of an impass here in that I cannot figure out
why the function below gives me type errors. It works
fine if I leave it non-tail recursive, but as soon as
I put in an accumulator and make it tail-recursive it
fails to compile. If one of you could please point me
in the right direction for solving this problem that
would be great. btw this is only for my own
edification. 

let rec apply_fun_list x f_list accm =
  match f_list with
     h::t ->
           apply_fun_list x t accum::(h x)
   | [] ->
        accum::[];;

Error is 

The expression has type 'a list but is here used with
type 'a

Thank you for your attention.
Eric

__________________________________________________
Do You Yahoo!?
Yahoo! Tax Center - online filing with TurboTax
http://taxes.yahoo.com/
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[Remi VANICAT]

Eric Merritt <cyberlync@yahoo.com> writes:

> let me start off by saying that if this is not the
> place to post this type of question please direct me
> to the correct list/group. I am picking up ocaml,
> starting off by doing a few simple things. I am at
> somewhat of an impass here in that I cannot figure out
> why the function below gives me type errors. It works
> fine if I leave it non-tail recursive, but as soon as
> I put in an accumulator and make it tail-recursive it
> fails to compile. If one of you could please point me
> in the right direction for solving this problem that
> would be great. btw this is only for my own
> edification. 
> 
> let rec apply_fun_list x f_list accm =
>   match f_list with
>      h::t ->
>            apply_fun_list x t accum::(h x)
>    | [] ->
>         accum::[];;

 :: is the constructor that add something at the beginning of the
list.

so you may want to say :

let rec apply_rev_fun_list x f_list accum =
  match f_list with
  | h::t ->
        apply_fun_list x t (h t)::accum
  | [] -> accum


but there, the function will reverse the list. It might not be what
you want (but List.rev is tail recursive)

by the way, I would have wrote it like :

let rec apply_fun_list x f_list =
  List.map (fun h -> h x) f_list

but List.map is not tail recursive....

-- 
Rémi Vanicat
vanicat@labri.u-bordeaux.fr
http://dept-info.labri.u-bordeaux.fr/~vanicat
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[Maxence Guesdon]

You want your accum to be a 'a list, not 'a, so use it as a list :

let rec apply_fun_list x f_list accum =
  match f_list with
     h::t ->
           apply_fun_list x t (accum@(h x))
   | [] ->
        accum;;

--
Maxence Guesdon
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Warp]

> P.S.: I also meant to ask: does anyone know schools where students are
> given programming classes with O'Caml?

The 4th year Univerty (maitrise) in Computer Sciences at Bordeaux got a
module called "Advanced Programming" where you can get a little taste of
OCaml.

Nicolas Cannasse

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[Remi VANICAT]

Maxence Guesdon <maxence.guesdon@inria.fr> writes:

> You want your accum to be a 'a list, not 'a, so use it as a list :
> 
> let rec apply_fun_list x f_list accum =
>   match f_list with
>      h::t ->
>            apply_fun_list x t (accum@(h x))
>    | [] ->
>         accum;;

erg, apply_fun_list become tail recursive, but it's in O(n^2) (when
the first version is in O(n)), and as @ is not tail recursive, this
doesn't resolve the problem of Usage of the stack....

better stick to the non tail recursive version that to do this.

-- 
Rémi Vanicat
vanicat@labri.u-bordeaux.fr
http://dept-info.labri.u-bordeaux.fr/~vanicat
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[Eric Merritt]

> erg, apply_fun_list become tail recursive, but it's
> in O(n^2) (when
> the first version is in O(n)), and as @ is not tail
> recursive, this
> doesn't resolve the problem of Usage of the
> stack....
> 
> better stick to the non tail recursive version that
> to do this.

by this I assume that the '@' function is not as
strait forward as I thought it would be? In what
manner does it append to the list to make the time
0(n^2)? -just curious.

Thanks 
Eric

__________________________________________________
Do You Yahoo!?
Yahoo! Tax Center - online filing with TurboTax
http://taxes.yahoo.com/
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[John Prevost]

>>>>> "em" == Eric Merritt <cyberlync@yahoo.com> writes:

    em> by this I assume that the '@' function is not as strait
    em> forward as I thought it would be? In what manner does it
    em> append to the list to make the time 0(n^2)? -just curious.

Actually, it's O(n) because it's straightforward and doesn't cause
side-effects.  The O(n^2) is when it is used n times.  Here's an
implementation that works similarly:

let rec append a b = match (a,b) with
  | [], _ -> b
  | h::t, _ -> h :: append t b

If you keep appending one element onto the end of a list, you can see
that append has to run down the entire first list each time to build a
new list with your new value at the end.  If you append one item at
the beginning each time, it behaves substatntially like :: does.

So (@) is O(n) with n being the size of the first argument.

John.
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[james woodyatt]

On Friday, April 12, 2002, at 12:15 PM, Eric Merritt wrote:
>
> by this I assume that the '@' function is not as
> strait forward as I thought it would be? In what
> manner does it append to the list to make the time
> 0(n^2)? -just curious.

Here's the definition of the '@' operator from $OCAMLLIB/pervasives.ml:
> let rec (@) l1 l2 =
>   match l1 with
>     [] -> l2
>   | hd :: tl -> hd :: (tl @ l2)


--
j h woodyatt <jhw@wetware.com>

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[eijiro_sumii]

From: Vincent Foley <vinfoley@iquebec.com>
> P.S.: I also meant to ask: does anyone know schools where students are
> given programming classes with O'Caml?

The department of information science in u-tokyo has been practicing a
rather ambitious curriculum involving functional languages, including
OCaml, for undergraduate students.

 - In the winter semester of the 2nd year, Scheme is taught, where the
   last assignment is implementing a meta-circular Scheme interpreter.

 - In the summer semester of the 3rd year, OCaml (and also Prolog) is
   taught, where the assignments include implementing a mini-ML
   interpreter with ML-polymorphic type inference (and also a
   mini-Prolog interpreter in ML).

 - In the winter semester of the 3rd year, students implement a
   compiler of a simply typed higher-order functional language.  This
   is linked with another class where students design and implement
   their own original CPUs, onto which a ray tracer written in mini-ML
   is compiled and its speed is competed.

These may sound like crash courses, but given enough help, most
students just do fine, maybe because our department is rather small
(there are only 30-40 students per year).

--
Eijiro Sumii (http://www.yl.is.s.u-tokyo.ac.jp/~sumii/)
Research Associate of Yonezawa Group, University of Tokyo
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Michael Vanier]

From: Vincent Foley <vinfoley@iquebec.com>
> P.S.: I also meant to ask: does anyone know schools where students are
> given programming classes with O'Caml?

Here at Caltech, the compiler design class is taught using ocaml as the
implementation language.  Also, a new course on type theory is being taught
this term, using the book "Types in Programming Languages" by Benjamin
Pierce, which uses ocaml for all its examples.  I teach a programming
languages/projects course, and two of my students are doing their project
with ocaml.  As one of them said "I have yet to meet a serious hacker who
learned ocaml and didn't like it."  I feel the same way.

Mike
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[Remi VANICAT]

Eric Merritt <cyberlync@yahoo.com> writes:

> > erg, apply_fun_list become tail recursive, but it's
> > in O(n^2) (when
> > the first version is in O(n)), and as @ is not tail
> > recursive, this
> > doesn't resolve the problem of Usage of the
> > stack....
> > 
> > better stick to the non tail recursive version that
> > to do this.
> 
> by this I assume that the '@' function is not as
> strait forward as I thought it would be? In what
> manner does it append to the list to make the time
> 0(n^2)? -just curious.

so let's look at :

let rec apply_fun_list x f_list accum =
  match f_list with
     h::t ->
           apply_fun_list x t (accum@(h x))
   | [] ->
        accum;;


so the line "apply_fun_list x t (accum@(h x))" is done O(n) time (one
time for each element in f_list), and "(accum@(h x))" take time O(n),
so the time taken by this algorithm is O(n)*O(n)=O(n^2).


-- 
Rémi Vanicat
vanicat@labri.u-bordeaux.fr
http://dept-info.labri.u-bordeaux.fr/~vanicat
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Oliver Bandel]

On Fri, 12 Apr 2002, Benjamin C. Pierce wrote:

> > P.S.: I also meant to ask: does anyone know schools where students are
> > given programming classes with O'Caml?
> 
> The intro computer science sequence at the University of Pennsylvania
> uses OCaml for the first two months (then switches to Java).

Why do they use Ocaml?
Why do they swithc to Java?

Ciao,
   Oliver

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Benjamin C. Pierce]

> Why do they use Ocaml?

Basically the obvious reasons: using a functional language with a nice
small core means that you can go directly into *programming* right at the
beginning of the semester.  We start with simple recursive numerical
algorithms, then move quickly into manipulating lists, trees, sorting,
searching, etc.  The final assignment in OCaml involves modifying an
evaluator for a tiny OCaml-core-like language.

> Why do they swithc to Java?

Basically the obvious reasons: to introduce objects (in a "conventional"
style), and so that students can get summer jobs.

     Benjamin

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Applications written in O'Caml

[Nicolas barnier]

Vincent Foley wrote:
> 
> P.S.: I also meant to ask: does anyone know schools where students are
> given programming classes with O'Caml?

The engineer students with a major in IT at the French University of Civil
Aviation (ENAC, Toulouse - www.enac.fr) are given OCaml courses during the
first year (it is the first programming language taught here), followed by
an algorithmic course with implementation in OCaml. They can use the
language in their final project (3rd year) as well.

Some first year students arrives here with a little practice learned during
the " classes préparatoires aux grandes écoles " (two or three years of
intense preparatory courses before entering an engineering school) if they
have chosen optional IT classes (or something like that, I'm not to sure).

BTW, our students often are eager to work abroad for their final training
period, if it's what you meant... (and those willing to developp with OCaml
are often the best ones :-)

Regards

-- Nicolas Barnier
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

Re: [Caml-list] Simple question

[Eric Merritt]

> Actually, it's O(n) because it's straightforward and
> doesn't cause
> side-effects.  The O(n^2) is when it is used n
> times.  Here's an
> implementation that works similarly:
> 
> let rec append a b = match (a,b) with
>   | [], _ -> b
>   | h::t, _ -> h :: append t b
> 
> If you keep appending one element onto the end of a
> list, you can see
> that append has to run down the entire first list
> each time to build a
> new list with your new value at the end.  If you
> append one item at
> the beginning each time, it behaves substatntially
> like :: does.
> 
> So (@) is O(n) with n being the size of the first
> argument.

This actually makes allot of sense. I am very new to
the functional world (basically Ocaml and Erlang are
my current learning projects) so many of things that
might be obvious to a more experienced functional
programmer I do not see. This is slowly changing as I
write more code, of course ;). 

In allot of ways this strugle reminds me of my initial
attempts to learn the Object Oriented Paradigm, only
this is a little more foriegn. In any case, I thank
you all for your help and I hope to be joining your
ranks as a decent functional programmer one day.


__________________________________________________
Do You Yahoo!?
Yahoo! Tax Center - online filing with TurboTax
http://taxes.yahoo.com/
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

[Caml-list] Applications written in O'Caml

[Jacek Chrzaszcz]

Vincent Foley writes:
 > P.S.: I also meant to ask: does anyone know schools where students are
 > given programming classes with O'Caml?
 > 

Hello list,

At Warsaw University, first-year students have the "Introduction to
programming" course. Since last year a part of them (about one third)
- the volunteers - are taught the functionnal approach, using
Ocaml. They are doing fine, but one can see that most of them already
know C or Pascal.

By the way, it is a great pleasure to see how the understanding of
such functions like fold is slowly coming to them :-)

Later in the cursus (about the third-fourth year), there is a more
"serious" functionnal programming course. The practical things are
taught using Ocaml, SML or sometimes Haskel (with some deeper insight
on the laziness), depending on the person who does the course.

Cheers

Jacek
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners