The 2008 Workshop on Scheme and Functional Programming
will be held

* in Victoria, British Columbia,
* on Saturday, 20 September, two days before ICFP.

The submission deadline is Friday, 20 June.

I hope to see many of you in that lovely city. I also
encourage you to submit a paper. If your friends have
something to say about Scheme or functional programming,
I hope you will encourage them to submit papers also.

For details, see http://www.schemeworkshop.org/2008/

Will Clinger
workshop chair

--------

Call for Papers

Apologies if you receive multiple copies
________________________________________

Final Call for Papers

------------------------------------------------------------
Fifth Workshop on Constraint Handling Rules
CHR 2008

July 14, 2008
Hagenberg, Austria

Co-located with the International Conference on
Rewriting Techniques and Applications (RTA 2008)
------------------------------------------------------------

http://www.uni-ulm.de/in/pm/research/events/chr2008

Introduction
------------

One of the functional programming feature is absence of variables
assignments, than allows to avoid side effects. But writing and
reading data is alike set and get external variables, so we again come
to a risk get side effects working with databases.
Are there any ideas how to walk around this risk, excluding 'human
element' from the process.

Hello All,

We have started with a new programming discussion group on Gmail.
TechnicalTalk is a group dedicated to computer programming discussion,
programming tutorials, programming articles and much more.

Feel free to join this group and solve your programming queries while
discussing them to other programs in the group.

We invite you all to visit the group once and join the group!

Visit the Group
http://groups.google.co.in/group/Technical_Talk

This group is part of online programming discussion forum.
http://www.technicaltalk.net

Feel free to join this online forum.

Am Donnerstag, den 24.04.2008, 19:04 -0700 schrieb Paul Rubin:

Not bogus - in fact adding a feature does make a language more capable.

Usually the situation is subtly different: you want to have X, but
you'll lose Y if you get X.

The Y that you lose is usually some kind of guarantee.
Adding mutability loses the guarantee that aliasing will never be a
problem.
Adding pointers into arrays loses the guarantee that you'll never get a
buffer overflow.
Adding reinterpreting casts loses the guarantee that a data object may
never be misinterpreted.
Adding a Turing-complete template language loses the ability to
typecheck templates.
Etc. etc. etc.

Not that you need such a hack since there seems to have been a slew of
folks coming up with extentions to HM that play nice. But I was
wondering if one could approximate

/* horrible pseudocode */
id x = x : 'a -> 'a.
foo i:int s:string = Pair(id i, id s) : int -> string ->
Pair(int,string).

in regular old non-System-F supporting HM systems by generating (sorta
like C++ template expansion) a new version of id for every type it is
applied to in foo. Sort of a macro expansion.

?

Call for Papers: International Conference on Computational Biology
ICCB 2008
From: International Association of Engineers (IAENG)

San Francisco, USA, 22-24 October, 2008
http://www.iaeng.org/WCECS2008/ICCB2008.html

The conference ICCB'08 is held under the World Congress on Engineering
and Computer Science 2008. The WCECS 2008 is organized by the
International Association of Engineers (IAENG), a non-profit
international association for the engineers and the computer
scientists. The conference has the focus on the frontier topics in the
theoretical and applied engineering and computer science subjects. Our
last IAENG conference has attracted more than one thousand
participants from over 50 countries, and our IAENG conference
committees have been formed with over two hundred committee members
who are mainly research center heads, faculty deans, department heads,
professors, and research scientists from universities like Harvard,
MIT, Stanford, UCLA, UC Berkeley and Yale etc.

The conference proceedings will be published by IAENG (ISBN:
978-988-98671-0-2) in hardcopy. The abstracts will be indexed and
available at major academic databases. The accepted papers will also
be considered...

Am Mittwoch, den 23.04.2008, 06:12 -0700 schrieb
anonposting@googlemail.com:

That depends.
If efficiency is your goal, then you're probably right. But then you
probably should be coding in assembly.
If maintainability is your goal, then you're probably not right. Imagine
the situation...

In February, i spent few hours researching the popularity of some
computer language websites.

(The message can be found here:

http://xahlee.org/lang_traf/lang_sites.html
http://community.livejournal.com/lisp/42778.html
http://groups.google.com/group/comp.lang.perl.misc/msg/59c87899c2668f4c
)

In that post, one question i puzzeled over is why PaulGraham.com's
traffic is surprisingly high, since the site doesn't seems to host
forums, computer lang documentation, or wiki type of thing, yet it is
ranked higher than perl.com, which actually host online forum, faq,
documentation, news etc. I wrote:

------------
paulgraham.com 48153 (lisp bigwig, but huh?)
Perl.com 49104
xahlee.org 80060 ← Me!
-------------

Compared to xahlee.org, it's a ranking difference about 32 thousand!

Am Dienstag, den 22.04.2008, 07:32 -0700 schrieb
anonposting@googlemail.com:

Something like this already exists in some languages. (OCaml would be
one example, I think.)

This would be one of the more straightforward optimizations.