Caml-list,<div><br></div><div>I have to write an interpreter for a language that has arrays explicitly indexed by anything that can be sequential (list, range, set)</div><div><br></div><div>    {string} airports = {&quot;ATL&quot;, &quot;JFK&quot;};</div>
<div>    range index = 1 .. 2;</div><div>    tuple recordAirport { airport : string; id : int }</div><div>    {recordAirport} otherAiports = { &lt;&quot;ATL&quot;, 12345&gt;, &lt;&quot;JFK&quot;, 42&gt;};</div><div><br></div>
<div>    int myArray [airports][index] = [[1, 2], [3, 4]];</div><div>    string myArray2 [a in recordAirports][i in index] = (i &lt; <a href="http://a.id">a.id</a>) ? &quot;unknown&quot; : a.airport ;</div><div>    int mySliceOfArray [a in recordAirports]  = sum (i in index) myArray[a.airport][i];</div>
<div><br></div><div>Usually the trick in interpreter implementation is to transform everything back to &quot;one-dimensional&quot; objects</div><div>- simple types</div><div>- inductive constructions for lists</div><div>- curried functions</div>
<div><br></div><div>For instance in the book &quot;Le langage Caml&quot; the return type of the eval function is</div><div><br></div><div><div>type value =</div><div>   | Val_number of int</div><div>   | Val_boolean of bool</div>
<div>   | Val_pair of value * value</div><div>   | Val_nil</div><div>   | Val_cons of value * value</div><div>   | Val_closure of closure</div><div>   | Val_primitive of value -&gt; value</div><div>and closure = { definition: (pattern * expression) list; mutable environnement: environnement }</div>
<div>and environnement == (string * value) list</div></div><div><br></div><div>I don&#39;t see however how I am going to represent a type Val_Array given that the indexes can be of arbitrary type and in arbitrary number.</div>
<div>I haven&#39;t found either how to transform the arrays into inductive types like lists to avoid the issue.</div><div><br></div><div>Any suggestions ?</div><div><br></div><div>        Diego Olivier</div>