comp.lang.ml Google Group

Commercial Users of Functional Programming Workshop Call for Participation

jim.gru...@acm.org (Jim Grundy) — Tue, 22 Jul 2008 21:31:13 UT

Commercial Users of Functional Programming Workshop (CUFP) 2008
Functional Programming As a Means, Not an End
Call for Participation
Sponsored by SIGPLAN
Co-located with ICFP 2008
______________________________ ______________________________ ______

ICLP'08 CALL FOR POSTER SUBMISSIONS

iclp08...@cs.nmsu.edu (ICLP 08) — Tue, 22 Jul 2008 14:22:12 UT

ICLP'08
Call for Posters Submissions
24th International Conference on Logic Programming
Udine, Italy, December 9th-13th, 2008
[link]
DEADLINE: August 15th, 2008

CFP: DEADLINE EXTENSION: DDBP @ EDOC 2008 [International Workshop on Declarative and Dynamic Business Processes]

ha...@info.uqam.ca (Sylvain Hallé) — Mon, 16 Jun 2008 00:58:43 UT

****************************** ****************************** ***********
*** DEADLINE EXTENSION
***
*** First International Workshop on Dynamic and Declarative Business
*** Processes (DDBP 2008)
***
*** In conjuction with the 12th IEEE International EDOC Conference
*** (EDOC 2008), September 2008, Muenchen, Germany

DEFUN08: Final Call for Talks & Tutorials (deadline: June 27)

icfp.public...@googlemail.com (Matthew Fluet (ICFP Publicity Chair)) — Tue, 10 Jun 2008 12:48:20 UT

Final Call for Talks and Tutorials
ACM SIGPLAN 2008 Developer Tracks on Functional Programming
[link]
Victoria, BC, Canada, 25, 27 September, 2008
The workshop will be held in conjunction with ICFP 2008.
[link]

2008 ICLP Doctoral Consortium

iclp08...@cs.nmsu.edu (ICLP 08) — Mon, 09 Jun 2008 20:44:36 UT

****************************** ****************************** **********
International Conference on Logic Programming
Fourth Doctoral Consortium
Udine, Italy
December 9-13, 2008
[link]

Re: Question about OCaml's list Comprehensions

torb...@pc-003.diku.dk (Torben Ægidius Mogensen) — Thu, 05 Jun 2008 08:17:00 UT

The latter, though later steps of the compilation might unfold these
calls. Haskell also supports intervals of the form [1..], which
obviously can not be evaluated to constants at compile time.
List comprehensions are in the Glasgow Haskell compiler compiled using
shortcut deforestation, which means that many of the intermediate

FINAL CFP: DDBP @ EDOC 2008 [International Workshop on Declarative and Dynamic Business Processes]

ha...@info.uqam.ca (Sylvain Hallé) — Fri, 06 Jun 2008 20:19:20 UT

****************************** ****************************** ***********
*** FINAL CALL FOR PAPERS
*** First International Workshop on Dynamic and Declarative Business
*** Processes (DDBP 2008)
***
*** In conjuction with the 12th IEEE International EDOC Conference
*** (EDOC 2008), September 2008, Muenchen, Germany

Re: Question about OCaml's list Comprehensions

chrba...@web.de (Christoph Bauer) — Thu, 05 Jun 2008 18:49:43 UT

really? try is again!
In OCaml you could do:
$ ocaml
Camlp4 Parsing version 3.10.2
val range : int -> int -> int list = <fun>
- : int list = [4; 6; 8; 10; 12; 14; 16]
Christoph Bauer

LaSh08 Call for Papers

marc.denec...@cs.kuleuven.be (Marc Denecker) — Tue, 03 Jun 2008 19:04:26 UT

LaSh08 - WORKSHOP ON LOGIC AND SEARCH
Computation of structures from declarative descriptions
Second Call For Papers
Leuven, Belgium, November 6-7, 2008
[link]
.............................. .............................. ....

Re: Question about OCaml's list Comprehensions

eric.jaeger.pa...@noos.fr (Eric Jaeger) — Wed, 04 Jun 2008 23:12:47 UT

What for ? Try
let l1=let rec f n=if n<=10 then n::f (n+1) else [] in f 1;;
let l2=let rec f n=if n<=8 then (2*n)::f (n+1) else [] in f 2;;
Now I don't know Haskell, so I'm not sure of how [1..10] works ; is it a
constant evaluated at compilation time to allow e.g. a form of pattern
matching ? Or is it just a notation trick to call a function of the form

Re: Question about OCaml's list Comprehensions

ne...@cs.cmu.edu (Neelakantan Krishnaswami) — Tue, 03 Jun 2008 23:33:06 UT

In article <<mailman.5.1212466881.9368.sm l-redistribut...@mailman.srv.c s.cmu.edu>>,
Nothing built-in, but you can define higher-order functions to do
these operations.
let rec range i j = if i < j then [] else i :: (range (i+1) j)
# range 1 10;;
- : int list = [1; 2; 3; 4; 5; 6; 7; 8; 9; 10]
let (>>) lst f = List.concat (List.map f lst)

ICFP2008 Call for Poster proposals

icfp.public...@googlemail.com (Matthew Fluet (ICFP Publicity Chair)) — Wed, 04 Jun 2008 16:53:43 UT

ICFP 2008 poster session
September 21, 2008
Call for presentation proposals
ICFP 2008 will feature a poster session for researchers and
practitioners, including students. The session will provide friendly
feedback for work that is in gestation or ongoing, as well as
opportunities to meet each other and exchange ideas. We welcome poster

Question about OCaml's list Comprehensions

kecheng...@gmail.com (Kecheng) — Mon, 02 Jun 2008 22:48:47 UT

Are there some built-in like it in Haskell to generate and manipulate
list like this in OCaml?
Mant Thanks
Generators
Main> [1..10]
[1,2,3,4,5,6,7,8,9,10]
Manipulators
Main> [ i * 2 | i <- [2..8]]
[4,6,8,10,12,14,16]

ICLP'08 CALL FOR WORKSHOP PROPOSALS

iclp08...@cs.nmsu.edu (ICLP 08) — Sat, 24 May 2008 17:55:58 UT

*** CALL FOR WORKSHOP PROPOSALS ***
ICLP'08
24rd International Conference on Logic Programming
December 9-13, 2008
Udine, Italy
URL: [link]
ICLP'08, the 24rd International Conference on Logic Programming, will

ICLP'08 CALL FOR PAPERS

iclp08...@cs.nmsu.edu (ICLP 08) — Mon, 26 May 2008 15:32:06 UT

CALL FOR PAPERS
ICLP'08
24th International Conference on Logic Programming
Udine, Italy, December 9th-13th, 2008
[link]

CONFERENCE SCOPE
----------------