Browse thread
Estimating the size of the ocaml community
-
Yaron Minsky
-
Christopher A. Watford
-
Frédéric_Gava
-
skaller
-
Erik de Castro Lopo
- Olivier_Pérès
-
Thomas Fischbacher
-
Frédéric_Gava
-
Thomas Fischbacher
- Paul Snively
- josh
- Richard Jones
-
Jon Harrop
-
Michael Walter
-
Jon Harrop
- Damien Doligez
- Thomas Fischbacher
- Michael Walter
-
Radu Grigore
- Gerd Stolpmann
- Jon
-
Jon Harrop
- Thomas Fischbacher
- Richard Jones
-
Michael Walter
- Ville-Pertti Keinonen
- Oliver Bandel
- Basile STARYNKEVITCH
-
Thomas Fischbacher
- ronniec95@l...
- skaller
- chris.danx
-
Frédéric_Gava
-
Erik de Castro Lopo
- sejourne_kevin
- Stefano Zacchiroli
-
skaller
-
Frédéric_Gava
- Kenneth Knowles
- Michael Jeffrey Tucker
- Richard Jones
- Nicolas Cannasse
- Evan Martin
- Eric Stokes
- chris.danx
- Sylvain LE GALL
- sejourne_kevin
- Sven Luther
- Johann Spies
-
Christopher A. Watford
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Martin Berger <martinb@d...> |
| Subject: | Re: [Caml-list] The boon of static type checking |
> That's how it's supposed to be. Especially scheme tries to be nothing else
> but just the minimal "functional assembly language". So one can put other
> languages on top of it.
the words "functional" and "minimal" may be considered contradictory as the basic
primitive of functional programming, beta reduction, is a very heavy operation that
can successfully be decomposed into more lightweight operations like:
- state change + conditional branching.
- continuation passing
- name-passing interaction.
(of those the third is the most elementary and general and encompasses the others).
putting any of those on top of beta-reduction generally leads to something ugly.
functional abstractions are extremely useful in many computational situations, but
they are high-level, not something one can use successfully as a foundation to start
from. several decades of failed attempts at founding (the semantics of) computation
on lambda calculus shows this. the difficulties of finding convincing hoare-logics for
ML-like languages, a problem that has really only been solved this year, and on the
basis of pi-calculus, is another indication in this direction.
as an aside, are there any good program logics for languages with macro-facilities like
lisp-dialects?
martin