On 11/11/2010 04:12 PM, Simon Marlow wrote:
On 04/11/2010 22:38, Lennart Augustsson wrote:
The smallest Haskell I know of is Gofer/Hugs; it originally ran on a
640k PCs.
Before that languages like SASL and KRC ran on PDP-11 with 64k memory.
None of these had a compiler that was bootstrapped,
On 04/11/2010 22:38, Lennart Augustsson wrote:
It happened at various universities around the world. Look at the
original Haskell committee and you'll get a good idea where.
The smallest Haskell I know of is Gofer/Hugs; it originally ran on a 640k PCs.
Before that languages like SASL and KRC
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 11/11/10 11:12 , Simon Marlow wrote:
I bootstrapped GHC from the intermediate C files on a 640K PC around 1993 or
so. I don't remember exactly, but I think it might have worked, for some
small value of work.
If you used the right build
On Thu, Nov 4, 2010 at 20:54, Andrew Coppin andrewcop...@btinternet.com wrote:
On 04/11/2010 02:16 PM, Jonathan Geddes wrote:
I mean, comparing BASIC to FP is like comparing a water
pistol to a tactical thermonuclear device.
You have the similitude backward. It's Haskel that is fun
and BASIC
On 5/11/2010, at 9:23 PM, Ketil Malde wrote:
Then there are algorithms that give
optimal results but blow up for anything much past 15 species,
I.e, edit distance is O(n^k) for k sequences of length n.
I was actually referring to phylogeny reconstruction,
not edit distance.
Then we turn
Richard O'Keefe o...@cs.otago.ac.nz writes:
Automatically? Probably not.
Like biologist can determine the distance between two genotypes, and
determine a hierarchy between species from that.
I'm going to say the same as Richard, only differently. For computer
languages, we can't observe
On 5/11/2010, at 8:54 AM, Andrew Coppin wrote:
Can you actually run something like Haskell with mere kilobytes of
RAM?
I recall running Haskell-like programs (compiled by Gofer, the
predecessor of Hugs) on a machine with 256Kb of memory, back in the
early 1990s. They were smallish
Stephen Tetley wrote:
Did Haskell get significant whitespace from Python - doubtful as
Python possibly wasn't visible enough at the time, but you never know.
Doesn't COBOL have significant layout anyway as an inspiration to
both?
As far as I am informed, Python got the significant whitespace
Python is approximately as old as Python and most likely got
indentation from ABC.
Checking on Wikipedia, one of the ABC's creators was Lambert Meertens
(famous for *-morphisms amongst other things) so there is a lineage
going back to Algol and Peter Landin / ISWIM.
PS. my fact-checking is a bit
On 4 November 2010 12:03, Stephen Tetley stephen.tet...@gmail.com wrote:
Python is approximately as old as Python and most likely got
indentation from ABC.
Apologies that should read - as old as Haskell
Obviously IDSWIM - (I _don't_ say what I mean).
Regardless of which languages got which features for which other
languages, Haskell is surely NOT a scripting language inspired by
python...
Also, it was my understanding that Python got list comprehensions
straight from Haskell. Unless, of course, some of the pre-Haskells
also had this feature.
Hello,
reading this thread a question came to me:
Is there a way of automatically deriving programming languages ascendancy?
Like biologist can determine the distance between two genotypes, and
determine a hierarchy between species from that.
Are you aware of researchs made in the field?
On the
I'm no compiler writer but as a layperson I'd guess for that you'd at least
need a program that could determine if two constructs are equivalent, the
Haskell and Python list comprehension example from 2 emails ago. The only
way I can think to do that is to parse some source in language X and see
ZF Expressions (aka list comprehensions) date to at least David
Turner's KRC (St. Andrews Static Language) and Rod Burstall and John
Darlington's Hope c.1980. Maybe they were present in NPL, the
predecessor of Hope before that. The Hope paper nods to SETL as an
influence.
Without interviewing the
Not a city, but perhaps an island [1]. Sorry, it had to be done.
-deech
[1] http://en.wikipedia.org/wiki/Java
On Thu, Nov 4, 2010 at 11:51 AM, Stephen Tetley stephen.tet...@gmail.comwrote:
ZF Expressions (aka list comprehensions) date to at least David
Turner's KRC (St. Andrews Static
On 04/11/2010 02:16 PM, Jonathan Geddes wrote:
Regardless of which languages got which features for which other
languages, Haskell is surely NOT a scripting language inspired by
python...
Affirmative.
It's a full-scale programming language (although I gather folks do use
it for scripting
On Nov 4, 2010, at 9:51 AM, Stephen Tetley wrote:
Without interviewing the people concerned its probably impossible to
actually find out what influenced what - even though list
comprehensions have a long history the designers of Python might have
only seen them in Haskell so Python could well
On Thu, 4 Nov 2010, Andrew Coppin wrote:
It's a full-scale programming language (although I gather folks do use it for
scripting too), and while it may or may not contain features that are also in
Python, it is manifestly /not/ inspired by Python. Clearly it was inspired
my Miranda and the
Andrew Coppin andrewcop...@btinternet.com writes:
On a somewhat tangental note: It seems increadible to me that Haskell
was invented in 1990, and Miranda way back in 1985. At the same time,
Commodore Business Machines released the iconic Commodore 64 in 1982,
It is amazing - although as you
On 04/11/2010 08:17 PM, Henning Thielemann wrote:
On Thu, 4 Nov 2010, Andrew Coppin wrote:
On a somewhat tangental note: It seems increadible to me that Haskell
was invented in 1990, and Miranda way back in 1985. At the same time,
Commodore Business Machines released the iconic Commodore 64
On 04/11/2010 08:47 PM, Ketil Malde wrote:
Andrew Coppinandrewcop...@btinternet.com writes:
On a somewhat tangental note: It seems increadible to me that Haskell
was invented in 1990, and Miranda way back in 1985. At the same time,
Commodore Business Machines released the iconic Commodore 64
KRC, Miranda, and LML all predate Haskell and have list comprehensions.
On Thu, Nov 4, 2010 at 3:16 PM, Jonathan Geddes
geddes.jonat...@gmail.com wrote:
Regardless of which languages got which features for which other
languages, Haskell is surely NOT a scripting language inspired by
python...
It happened at various universities around the world. Look at the
original Haskell committee and you'll get a good idea where.
The smallest Haskell I know of is Gofer/Hugs; it originally ran on a 640k PCs.
Before that languages like SASL and KRC ran on PDP-11 with 64k memory.
None of these had a
On 11/04/2010 03:30 PM, Lennart Augustsson wrote:
KRC, Miranda, and LML all predate Haskell and have list comprehensions.
Just because those languages predate Haskell and have list
comprehensions doesn't mean that they still couldn't have gotten the
idea from Haskel!. After all, I fully
On 4 Nov 2010, at 22:38, Lennart Augustsson wrote:
The smallest bootstrapped Haskell compiler is NHC which (I think) runs
in a few MB.
Originally, it needed to be able to compile itself in the 2Mb
available on Niklas's Amiga. Then he got an upgrade to 4Mb, so he
started to become less
On 5/11/2010, at 8:54 AM, Andrew Coppin wrote:
Can you actually run something like Haskell with mere kilobytes of RAM?
There was a Lisp for PDP-11s (64k).
Henderson's LispKit ran on the Apple II, which was pretty small,
and LispKit was basically a lazy Lisp.
To that degree, yes you *can* run
On 5/11/2010, at 4:03 AM, Dupont Corentin wrote:
Hello,
reading this thread a question came to me:
Is there a way of automatically deriving programming languages ascendancy?
According to www.oed.com, ascendancy means
The state or quality of being in the ascendant; [having] paramount
27 matches
Mail list logo
