TLDI 2010
*** First Call for Papers ***
The Fifth ACM SIGPLAN Workshop on
Types in Language Design and Implementation
Madrid, Spain, January 23, 2010
(Co-located with POPL 2010)
I am pleased to announce that experiments
on loading HOL Light in ocamlnat have
been successful. A 4x to 10x speedup on
various computations has been observed.
A preliminary how-to guide is available at:
http://www.math.carleton.ca/~kcheung/holnat.html
Kevin Cheung.
Hi,
Is there an already implemented way of doing the Cartesian product of 2 sets
in OCaml? My sets are of type Set.Make(Types), where Types is a module I
have defined.
Thanks,
Ligia
___
Caml-list mailing list. Subscription management:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Not that I know of. But you can use this general implementation. It assumes
you have Enum (from Batteries, and ExtLib before). The (~~) prefix operator
is Obj.magic.
Peng
(* makes the cross product of the given array of enumerations *)
Hello Ligia---
The following code takes cartesian products of lists:
let listListPrepend x ll = List.map (fun l - x :: l) ll
let rec cartesianProduct = function
| aList :: listList -
let prev = cartesianProduct listList in
List.flatten (
List.map (fun x - listListPrepend
On Thu, 30 Jul 2009, Ligia Nistor wrote:
Hi,
Is there an already implemented way of doing the Cartesian product of 2 sets
in OCaml? My sets are of type Set.Make(Types), where Types is a module I
have defined.
The biggest problem with implementing the cartesian product is that the
type t*t
Hi Ligia Nistor,
Supposing you want to implement the Cartesian product of 2 sets, and supposing
you implement sets as (balanced) sorted binary trees, here is how i would do
that :
implement a functor that, given x:A and a set B, maps B to a new set of pairs
(x,y), y:B
this functor
Thanks for the reply. This is how I thought of doing it, but in the module
TypeType, type t should be a list of types( the list has to be ref, so that
it can change its length). This way, you can do the cartesian product of an
arbitrary number of sets, not only of 2.
Ligia
On Thu, Jul 30, 2009
FLoC 2010: Call For Workshops Deadline Extension:
Workshop proposals can now be submitted up to Sept. 1, 2009.
The original Call for Workshops is at
http://www.floc-conference.org/cfw.html .
Organizers will be notified by October 15, 2009. Proposals should be
submitted electronically to
