arrays and lamda terms

Tue, 4 Feb 2003 18:04:52 +0200

This is a multi-part message in MIME format.

------=_NextPart_000_028F_01C2CC77.EA688C90
Content-Type: text/plain;
	charset="Windows-1252"
Content-Transfer-Encoding: quoted-printable

Greetings.

My question is not directly related to Haskell.

Is it possible to encode an array using lamda terms only, and recover =
the term specified by an index term in O(1) time (in other words in one =
step reduction, without cheating using several steps behind the scenes)? =
Or is it possible in any rewriting system? I might not be making any =
sense, but I am sure there are people out there who can read my mind, =
and possibly put my question into better terminology.

Thanks

------=_NextPart_000_028F_01C2CC77.EA688C90
Content-Type: text/html;
	charset="Windows-1252"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Dwindows-1252" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.3510.1100" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2>Greetings.</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3DArial size=3D2>My question is not directly related to=20
Haskell.</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3DArial size=3D2>Is it possible to encode an array using =
lamda terms=20
only, and recover the term specified by an index term in O(1) time (in =
other=20
words in one step reduction, without cheating using several steps behind =
the=20
scenes)? Or is it possible in any rewriting system? I might not be =
making any=20
sense, but I am sure there are people out there who can read my mind, =
and=20
possibly put my question into better terminology.</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3DArial size=3D2>Thanks</FONT></DIV>
<DIV>&nbsp;</DIV></BODY></HTML>

------=_NextPart_000_028F_01C2CC77.EA688C90--