Caml-list,
I have to write an interpreter for a language that has arrays explicitly
indexed by anything that can be sequential (list, range, set)
{string} airports = {ATL, JFK};
range index = 1 .. 2;
tuple recordAirport { airport : string; id : int }
{recordAirport}
Gabriel,
| Val_table of (value, value) Hashtbl.t
It took me two days to understand that this actually solved the problem
because it fulfils type erasure and induction on dimension, just like
functions.
Actually, that's the type of a reified curried function value - value -
value - ...
Jon,
In ML there has been work on self adjusting computations (check the work of
Amut Acar and unfold recursively).
Dynamic graphs are in a sense an optimization of self-adjusting
computations in the same way logical persistence is an optimization of
physical persistence
Lets say I have an
Jon,
I was told my explanations weren't very clear so here it goes with more
details, a much simpler example and explicit links
A dynamic graph algorithm is a classical graph algorithm (say all-pairs
shortest path) that is able to update the result when there is a small
modification of the
List,
I was wondering if there was any reason not to make let rec the default /
sole option, meaning cases where you clearly don't want a let rec instead
of let (only in functions, not cyclic data).
Diego Olivier
--
Caml-list mailing list. Subscription management and archives:
Caml-list,
[Gerd Stolpmann wrote]
I think this is not possible. SQL always needs access to the complete
table for executing queries (including the complete indexes).
I am surprised by your comments. Many systems have two-layer data
storage (massive but slow one, fast but limited one), and
Caml-list,
[Gerd Stolpmann wrote]
The SQL server solves this by deciding on a query strategy beforehand.
What ??? I thought SQL servers shipped on-the-fly optimizing compilers
that would evaluate the query and use some heuristics (like table size
and density) to decide in which order to
