Re: Polymorphism

Article View: comp.lang.misc

Article #6467

#6467

From: David Gudeman
Date: Thu, 11 May 1989 07:58

12 lines
920 bytes

In article  <6090@pdn.paradyne.com> alan@oz.nm.paradyne.com (Alan Lovejoy) writes:
>...  Turing machines are the ONLY possible model I know of for how a
>functional language could be implemented--other than in a biobrain...

I don't understand this comment.  Functional languages can be (and
are) implemented on dozens of different architectures with no
resemblence to Turing machines.
-- 
					David Gudeman
Department of Computer Science
The University of Arizona        gudeman@arizona.edu
Tucson, AZ 85721                 {allegra,cmcl2,ihnp4,noao}!arizona!gudeman

Technical Details

Message-ID: <10741@megaron.arizona.edu>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!agate!bionet!ig!arizona!gudeman

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!agate!bionet!ig!arizona!gudeman
From: gudeman@arizona.edu (David Gudeman)
Newsgroups: comp.lang.misc
Subject: Re: Polymorphism
Message-ID: <10741@megaron.arizona.edu>
Date: 11 May 89 07:58:28 GMT
Organization: U of Arizona CS Dept, Tucson
Lines: 12