What's the "revised syntax" in OCaml?

Posted by aneccodeal on Stack Overflow See other posts from Stack Overflow or by aneccodeal
Published on 2010-05-26T23:32:01Z Indexed on 2010/05/27 0:41 UTC
Read the original article Hit count: 322

Filed under:

ocaml

When people refer to the "revised syntax" in OCaml, do they mean that this will become a new syntax for the language, or is it just an alternative syntax created in CamlP4? If it's the former, then when does the "revised syntax" become the "official syntax" of OCaml?

Related posts about ocaml

F# and OCaml

as seen on Stack Overflow - Search for 'Stack Overflow'
I hear that F# is derived from OCaml. How true is this statement? That is to say, are the resources available for learning OCaml useful to someone who wants to learn F#? What are the major differences between the two languages (aside from the fact that F# is .NET)? >>> More
Higher-order type constructors and functors in Ocaml

as seen on Stack Overflow - Search for 'Stack Overflow'
Can the following polymorphic functions let id x = x;; let compose f g x = f (g x);; let rec fix f = f (fix f);; (*laziness aside*) be written for types/type constructors or modules/functors? I tried type 'x id = Id of 'x;; type 'f 'g 'x compose = Compose of ('f ('g 'x));; type 'f fix = Fix… >>> More
Good projects to learn OCaml and F#

as seen on Stack Overflow - Search for 'Stack Overflow'
After learning the basic syntax, reading some non-trivial code is a fast way to learn a language. We can also learn how to design a library/software during reading others' code. I have following lists. A Chess program in OCaml by Tomek Czajka. Hal Daumé has written several machine learning libraries… >>> More
OCaml beginner needs help: What is wrong?

as seen on Stack Overflow - Search for 'Stack Overflow'
Code: let rec get_val (x, n) = match x with [] -> -1 | if (n=0) then (h::_) -> h else (_::t) -> get_val(t, n-1) ;; Error message: Characters 55-57: | if (n=0) then (h::_) - h ^^ Error: Syntax error >>> More
Tail-recursive merge sort in OCaml

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello world! I’m trying to implement a tail-recursive list-sorting function in OCaml, and I’ve come up with the following code: let tailrec_merge_sort l = let split l = let rec _split source left right = match source with | [] -> (left, right) | head :: tail ->… >>> More

Developer IT

What's the "revised syntax" in OCaml? - Developer IT

What's the "revised syntax" in OCaml?

ocaml

Related posts about ocaml

F# and OCaml

Higher-order type constructors and functors in Ocaml

Good projects to learn OCaml and F#

OCaml beginner needs help: What is wrong?

Tail-recursive merge sort in OCaml

Categories cloud