Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!elroy.jpl.nasa.gov!decwrl!stanford.edu!neon.Stanford.EDU!brm
From: brm@neon.Stanford.EDU (Brian R. Murphy)
Newsgroups: comp.lang.misc
Subject: Re: Dynamic typing (part 3)
Summary: static typing loses
Keywords: type dynamic static inference
Message-ID: <1991Apr22.190400.9965@neon.Stanford.EDU>
Date: 22 Apr 91 19:04:00 GMT
References: <boehm.670539603@siria> <1991Apr9.021700.2688@neon.Stanford.EDU> <1991Apr16.151100.7221@maths.nott.ac.uk>
Sender: brm@cs.stanford.edu
Organization: Computer Science Department, Stanford University, Ca , USA
Lines: 18

In article <1991Apr16.151100.7221@maths.nott.ac.uk> anw@maths.nott.ac.uk (Dr A. N. Walker) writes:
>In article <1991Apr9.021700.2688@neon.Stanford.EDU>
>brm@neon.Stanford.EDU (Brian R. Murphy) writes:
>
>>My complaint about statically typed languages is that I _can't_ do
>>some things in them that I _do_ in dynamically typed languages (such
>>as Lisp).
>
>	But your examples are perfectly OK in *some* statically typed
>languages, which suggests that it's a problem with your specific languages
>rather than with typing.

Your solutions to my examples all have type declarations in them.
In my posting, I believe I clarified the my above complaint with 
"without type declarations."

					-Brian Murphy
					brm@cs.stanford.edu