HDTenEightyP/NetNews huggingface dataset:
From: steve@taumet.com (Steve Clamage)
Subject: Re: Overloading Parent Declaration: Bug or Feature?
Organization: TauMetric Corporation
Date: Fri, 21 Aug 1992 15:33:19 GMT

kring@efes.physik.uni-kl.de (Jochen Voss) writes:

|I tried to compile the following program with GNU C++ version 2.1

|	class B {
|	public:
|	    void f(int x)	{ cout << "B::f(" << x << ")\n"; }
|	};
|	class D : public B {
|	public:
|	    void f(char *str)	{ cout << "D::f(" << str << ")\n"; }
|	};
|	main()
|	{
|	    D d;
|	    d.f(1);		// (*) should be an error ?
|	}

|It compiles without warnings (even with the -Wall flag set) and outputs
|	B::f(1)

The compiler is wrong.  An identifier in a derived class hides all
instances of that identifier in all its base classes.  In this
example, only the version of f() taking a char* is visible, so the
call is illegal.  You could write "d.B::f(1)", however.

I assume this bug has been fixed in a more recent version of g++.
-- 

Steve Clamage, TauMetric Corp, steve@taumet.com
Vice Chair, ANSI C++ Committee, X3J16
From: rmartin@thor.Rational.COM (Bob Martin)
Newsgroups: comp.lang.c++
Subject: Re: C++, how easy it to learn
Date: 20 Aug 92 02:21:41 GMT

jmwojtal@vela.acs.oakland.edu (Wojo) writes:

>Our company is thinking of getting C++ for our DecWindows.  Can anyone give me
>some comments on how well it works, and especially how easy (or difficult) it
>is to learn it.  If we do get it, would take weeks to figure how it works?

C++ is a reasonably difficult language to learn.  It has a lot of
features, and some very interesting quirks.  However, making effective
use of C++ is not simply a matter of learning the syntax and semantics
of the language.  It is just as important (if not more important) to
learn the concepts and practice of Object Oriented Design (OOD) and
Object Oriented Analysis.  Without this knowledge, C++ is little
better than C with strong types.


--
Robert Martin                        Training courses offered in:
R. C. M. Consulting                       Object Oriented Analysis
2080 Cranbrook Rd.                        Object Oriented Design
Green Oaks, Il 60048 (708) 918-1004       C++
From: tmb@arolla.idiap.ch (Thomas M. Breuel)
Newsgroups: comp.lang.c++
Subject: Re: Garbage Collection for C++
Date: 14 Aug 92 17:03:23 GMT
	<1992Aug14.021547.15215@news.mentorg.com>
Reply-To: tmb@idiap.ch
Organization: IDIAP (Institut Dalle Molle d'Intelligence Artificielle
	Perceptive)
In-reply-to: bcannard@hppcb36.mentorg.com's message of 14 Aug 92 02:15:47 GMT

In article <1992Aug14.021547.15215@news.mentorg.com> bcannard@hppcb36.mentorg.com (Bob Cannard @ PCB x5565) writes:

   In article <DAVEG.92Aug13025629@synaptx.synaptics.com>, daveg@synaptics.com (Dave Gillespie) writes:
   |> Couldn't we get away with having a garbage collector that didn't
   |> need pointers to be declared `GC'?

   I can't see that this is viable given the basic constraints on C++: among
   other things, those who don't want GC shouldn't have to suffer the hits.

What "hits"? In all the cases that I have looked at, the GC overhead
has been _smaller_ than the overhead of explicit memory management in
C++. Now, maybe my sample of programs is biased, but if you claim that
there are "hits", please state either whether you have concrete
evidence that there are, or whether your statement is just religious
belief. Your vague statements might easily turn into gospel truth.

Based on my experience, I would turn your statement around and say:
"those of us who want GC shouldn't have to suffer the inefficiencies
of not having it".

					Thomas.
Newsgroups: comp.lang.functional,comp.lang.prolog
From: ghogen@kreon.informatik.rwth-aachen.de (Guido Hogen)
Subject: Re: BABEL people
Organization: Rechnerbetrieb Informatik  /  RWTH Aachen
Date: 21 Aug 92 07:55:59 GMT

The mail address of Mario Rodriguez-Artalejo is 
     mario@dia.ucm.es

The address of Juanjo Moreno-Navarro should be the 
recent one, but it's bouncing back (at the moment?).

---
Guido Hogen
(ghogen@zeus.informatik.rwth-aachen.de)
From: smk@dcs.ed.ac.uk (Stefan Kahrs)
Newsgroups: comp.lang.functional
Subject: Re: Definitions
Date: 21 Aug 92 11:02:55 GMT
Distribution: comp
Organization: University of Edinburgh, LFCS
In-reply-to: goodrich@lynx.larc.nasa.gov's message of 20 Aug 92 16:26:02 GMT

In article <BtAIzF.7wJ@news.larc.nasa.gov> goodrich@lynx.larc.nasa.gov (Mike Goodrich) writes:

[... Michael Norris asking about FuncProg terminology ...]
>   I am currently reading "Functional Programming: Practice and Theory"
>   by Bruce J. MacLennan and highly recommend it.

My 0.02$:
I cannot support that.  The book is not a very good source for
definitions, in particular when it comes to formal definitions (the
section about lambda-calculus is awful).

--
Stefan Kahrs	                   JANET:    smk@uk.ac.ed.dcs
LFCS, Dept. of Computer Science    Internet: smk@dcs.ed.ac.uk
University of Edinburgh            UUCP:     ..!mcsun!uknet!dcs!smk
Edinburgh                          ARPA:     smk%dcs.ed.ac.uk@nsfnet-relay.ac.uk
EH9 3JZ                            Tel:      (44)-31-650-5139
SCOTLAND                           Fax:      (44)-31-667-7209
From: henni@ida.liu.se (Henrik Nilsson)
Newsgroups: comp.lang.functional
Subject: Algorithmic Debugging for Lazy Functional Languages
Date: 19 Aug 92 13:37:53 GMT
Organization: CIS Dept, Univ of Linkoping, Sweden

schiex@cert.fr (Thomas Schiex) writes:

[examples illustrating the usefulness of laziness deleted]

>All these GOOD thing have too be payed in terms of time (small overhead, so
>small it is negligible). But the main issue is DEBUGGING which is very
>difficult. Sequencing is completly disturbed and the poor human is lost when
>tracing ! (obvious relations with concurrent processing). However some
>papers gives interesting debugging issues for lazy languages (for Daisy, see
>"Lisp and symbolic computations", in the first numbers).

Our group has been involved in research on algorithmic debugging for some time
and recently we have applied this technique to lazy functional languages with
some success. However, several difficult problems remain to be solved before
this can be regared as a practical approach.

In algorithmic debugging, the program to be debugged is first executed and a
complete execution trace tree is built at the procedure/function level. This
tree is then searched top-down for the procedure/function invocation that
caused the entire program to misbehave, and once this invocation is found it
is concluded that the bug is inside the corresponding procedure/function.
The user must aid the debugger in this search by answering questions regarding
whether or not invocations behaved correctly. Thus the user need not concern 
himself with operational aspects such as execution order but can concentrate
on the declarative semantics of the program instead.

I'm going to present a paper on this topic at PLILP'92 next week and I'll be
happy to e-mail copies (postscript) of it to anyone who is interested.



-- 

Henrik Nilsson (henni@ida.liu.se)
Department of Computer and Information Science
Linkoping University
S-581 83 Linkoping
Sweden
--

Henrik Nilsson (henni@ida.liu.se)
Department of Computer and Information Science
Linkoping University
S-581 83 Linkoping
Sweden
From: fs@cs.tulane.edu (Frank Silbermann)
Subject: BABEL people
Organization: Computer Science Dept., Tulane Univ., New Orleans, LA
Date: Thu, 20 Aug 1992 16:17:18 GMT
Nntp-Posting-Host-[nntpd-27145]: caesar


I recently read the paper:

   "Logic Programming with Functions and Predicates: the Language BABEL,"
   by Moreno-Navarro and Rodriquez-Artalejo,
    _Journal of Logic Programming_, vol 12, No. 3, Feb. '92.

I would like to correspond with the authors.
The paper suggests addressing correspondence to
        jjmoreno@fi.upm.es
and it also gives the address W450@EMDUCM11.BITNET.

I've tried those addresses, as well as the postmasters
at those locations, but my mail keeps bouncing back.
Can anybody tell me how to reach either of these fellows?

Thank you.

------------------------------------------
Frank Silbermann	fs@cs.tulane.edu
Tulane University	New Orleans, Louisiana  USA
From: kozato@canon.co.uk (Yasuo Kozato)
Newsgroups: comp.lang.functional
Subject: Re: FFTs in Miranda
Date: 20 Aug 92 07:36:29 GMT
Organization: Canon Research Centre Europe Ltd

farrell@coral.cs.jcu.edu.au (John Farrell) writes:

>"A Functional Program for the Fast Fourier Transform"
>by Fer-Jan de Vries, Dept of Philosophy, University of Utrecht,
>Heidelberglaan 2, 3584 CS Utrecht, The Netherlands.

>It's on pp67-74 but I didn't copy what of! The papers are typeset differently,
>so it's not an actual proper book.

My biblio file says:

de Vries, F. J., "A Functional Program For The Fast Fourier
Transform," SIGPLAN, vol. 23, no. 1, pp. 67 - 75, ACM, 1988.

-- 
Yasuo Kozato                      kozato@canon.co.uk
Canon Research Centre Europe
From: weis@margaux.inria.fr (Pierre Weis)
Newsgroups: comp.lang.functional
Subject: Caml mailing-list
Keywords: Caml, mailing-list
Date: 12 Aug 92 16:49:58 GMT
Organization: INRIA * Rocquencourt BP 105 * F-78153 LE CHESNAY CEDEX* France

We are setting up a mailing list of users of the Caml and Caml Light
systems developed at INRIA. The purpose of this list is to share
experience, exchange ideas (and even code), and report on applications
of the Caml language. This list will be moderated; messages can be
written in English or in French.  If you wish to subscribe to this
list, please send a message to:

                caml-list-request@margaux.inria.fr

Best regards,

        Pierre Weis.



Nous sommes en train de mettre en place une tribune de discussions par
courrier electronique pour les utilisateurs des systemes Caml et Caml
Light realises a l'INRIA. Cette liste a pour objet de partager les
experiences, idees, programmes, et de decrire des applications du
langage Caml. Cette liste sera arbitree; les messages peuvent etre
ecrits indifferemment en Anglais ou en Francais. Si vous souhaitez
vous abonner a cette liste, envoyez un message a

                caml-list-request@margaux.inria.fr

Dans l'attente de vous lire,

        Peter Weis.

----------------------------------------------------------------------------
Formel Project
INRIA, BP 105, F-78153 Le Chesnay Cedex (France)
E-mail: Pierre.Weis@inria.fr
Telephone: +33 1 39 63 55 98
----------------------------------------------------------------------------
Newsgroups: comp.lang.functional
From: farrell@coral.cs.jcu.edu.au (John Farrell)
Subject: FFTs in Miranda
Organization: James Cook University
Date: 19 Aug 92 05:09:49 GMT

Someone was asking earlier about mathematical algorithms in functional
languages. Well looking through my filing cabinet, I have found the paper I
had read:

"A Functional Program for the Fast Fourier Transform"
by Fer-Jan de Vries, Dept of Philosophy, University of Utrecht,
Heidelberglaan 2, 3584 CS Utrecht, The Netherlands.

It's on pp67-74 but I didn't copy what of! The papers are typeset differently,
so it's not an actual proper book.


John
From: dbh@doc.ic.ac.uk (Denis Howe)
Newsgroups: comp.lang.functional
Subject: Re: Definitions
Date: 20 Aug 92 16:54:59 GMT
Organization: Computing Department, Imperial College, London, UK
NNTP-Posting-Host: wombat.doc.ic.ac.uk
In-reply-to: michaeln@cs.uq.oz.au's message of 20 Aug 92 14:41:32 GMT

In article <9910@uqcspe.cs.uq.oz.au> michaeln@cs.uq.oz.au (Michael
Norris) wrote:

>Where can I find good definitions of the words relating to
>functional programming?

I don't know where you can find good definitions (apart from the usual
books) but you can find lots of bad ones :-) in wombat.doc.ic.ac.uk
(146.169.22.42) /pub/glossary.

It's probably a bit out of date in places, lacks references to sources
and was mostly written by someone who knew little about the subjects
(me).

Its coverage is wide but shallow - programming languages (particularly
declarative), architectures, a little theory.  It is quite well
cross-referenced.

I would of course be delighted to receive corrections and additions.
Mail me if you'd like me to mail it to you.
--
Denis Howe <dbh@doc.ic.ac.uk>
So Biggs, you're the idiot who bought all these IBM PCs.  You're fired!
Newsgroups: comp.lang.functional
From: eppler@bordeaux.informatik.uni-kl.de (Reinhard Eppler)
Subject: Re: Questions from soc.college
Reply-To: eppler@bordeaux.informatik.uni-kl.de (Reinhard Eppler)
Organization: University of Kaiserslautern (Germany)
Date: Wed, 19 Aug 1992 16:03:26 GMT

In article <1992Aug19.053005.28328@src.umd.edu>, clin@eng.umd.edu
(Charles Lin) writes:

|>   So, the question is this.  While people are looking
|>to functional languages for their own research purposes,
|>is there a general feeling that these languages ought to
|>be the foundational basis of all work done, or at least
|>most work (in the same way that C is) done?  I doubt there
|>is any kind of academic push to make functional languages
|>the medium of instruction on general, or the language
|>for general "real world" use.

My opinion is:

 o most of the concepts needed (at least I need) are present in LISP
 o we need another syntax for LISP
 o list comprehension, pattern matching, soft typing (and ...?) 
   should be added to LISP
 o a pure functional language might be too difficult to use
   (if we had started with pure functional languages, someone would have
   invented global variables to keep the number of parameters small.)
   -> we need multiparadigm languages, e.g. assignments for some cases 
 o by now functional languages are too slow; we need better optimization
   techniques. This also holds for 'pure' OOP.
 o Haskell probably has too much concepts (this is the case with LISP, too)
 o I regard the work on Haskell and similar languages as very useful
   for research and some day someone has to put the good things into
   a "real world" language.

--
Reinhard Eppler
eppler@cognac.informatik.uni-kl.de

"Would you like to end up with all work done?"
From: reetz@i80s11.ira.uka.de (reetz)
Newsgroups: comp.lang.functional
Subject: SML for IBM-PC with MSDOS ?
Keywords: SML, IBM-PC, MSDOS
Date: 17 Aug 92 14:15:08 GMT
Organization: University of Karlsruhe, FRG
NNTP-Posting-Host: i80s11.ira.uka.de


Dear all,

I'm looking for an implementation of Standard ML for an IBM-PC or
compatible with MSDOS. I appreciate your advice!

Ralf Reetz
Institut fuer Rechnerentwurf und Fehlertoleranz
University of Karlsruhe
reetz@ira.uka.de
From: ror@dcs.ed.ac.uk (Roopa Rangaswami)
Newsgroups: comp.lang.functional
Subject: Programming in FP
Date: 17 Aug 92 13:36:52 GMT
Organization: Department of Computer Science, University of Edinburgh


Hello everyone.

I would be interested to know what programs people are writing in FP. I don't mean
small toy examples, but some of the more computationally intensive ones. Could anyone
using FP or anyone who can point me to such sources please send me some e_mail. Any
form of help gratefully received.

Thanks in advance.

Roopa.
From: vin@cs.arizona.edu (Vincent W. Freeh)
Newsgroups: comp.lang.functional
Subject: Formatted I/O
Date: 12 Aug 92 18:11:03 GMT
Organization: U of Arizona, CS Dept, Tucson

I hve recently learn SML and Haskell.  I have written a few
programs in each.  However, I have been frustrated in my 
attempts to read floating point data from a file.  Do these
provide for reading/writing formatted data?
I have read the Haskell papers in SIGPLAN and Harper's intro to
SML, but they did not help me.

I would appreciate it if I could see an example of formatted 
input or output, in SML and in Haskell.

Thanks,
Vince Freeh (vin@cs.arizona.edu)
Newsgroups: comp.lang.functional
From: pieter@fwi.uva.nl (Pieter H. Hartel)
Subject: Re: FFTs in Miranda
Organization: FWI, University of Amsterdam
Date: Fri, 21 Aug 1992 07:43:32 GMT

At the last ATABLE-92 workshop in Montreal we presented a paper
discussing the FFT in Miranda. The proceedings are not out yet, but I
can send out copies of a technical report to those interested:

\title{ Arrays in a Lazy Functional Language -- \\
        a case study: the Fast Fourier Transform}

\author{Pieter H. Hartel and Willem G. Vree \\
        Department of Computer Systems \\
        University of Amsterdam \\
        Kruislaan 403, 1098 SJ Amsterdam, The Netherlands}

\begin{abstract}
The array plays a prominent role in imperative programming languages
because the data structure bears a close resemblance to the
mathematical notion of a vector and because array operations can be
implemented efficiently. Not all lazy functional languages offer arrays
as a primitive data structure because laziness makes it difficult to
implement arrays efficiently. We study 8 different versions of the Fast
Fourier Transform, with and without arrays, to assess the importance of
arrays in a lazy functional language.

An efficient implementation of arrays contributes significantly to the
performance of functional languages in certain areas. However, a clear
distinction should be made between array construction and array
subscription.  In the FFT example we could not gain efficiency by using
array construction, other than for storing precomputed data like the
input. Using array subscription improves performance.
\end{abstract}
From: michaeln@cs.uq.oz.au (Michael Norris)
Newsgroups: comp.lang.functional
Subject: Definitions
Date: 20 Aug 92 14:41:32 GMT
Reply-To: michaeln@cs.uq.oz.au
Organization: Department of Computer Science, The University of Queensland

A quick question.

Where can I find good definitions of the words relating to
functional programming? I could make up definitions, but I'd
rather use accepted ones and refer to the source than take
the responsibility myself with the risk of defining things
wrongly, which would be distinctly bad form.

Specifically,
	coersion
	combinator
	eager evaluation
	high-order function
	lazy evaluation
	list comprehension
	pattern matching
	polymorphic
	side-effects
	strictly functional

thanks in advance.

-Michael N.	(e-mail: michaeln@cs.uq.oz.au)
From: alti@dcs.ed.ac.uk (Thorsten Altenkirch)
Newsgroups: comp.lang.functional
Subject: Re: Questions from soc.college
Date: 19 Aug 92 18:51:17 GMT
	<1992Aug19.160326.27474@uklirb.informatik.uni-kl.de>
Organization: LFCS, Edinburgh
In-reply-to: eppler@bordeaux.informatik.uni-kl.de's message of 19 Aug 92 16:03:26 GMT

In article <1992Aug19.160326.27474@uklirb.informatik.uni-kl.de> eppler@bordeaux.informatik.uni-kl.de (Reinhard Eppler) writes:

    o most of the concepts needed (at least I need) are present in LISP
    o we need another syntax for LISP
    o list comprehension, pattern matching, soft typing (and ...?) 
      should be added to LISP
    o a pure functional language might be too difficult to use
      (if we had started with pure functional languages, someone would have
      invented global variables to keep the number of parameters small.)
      -> we need multiparadigm languages, e.g. assignments for some cases 
    o by now functional languages are too slow; we need better optimization
      techniques. This also holds for 'pure' OOP.
    o Haskell probably has too much concepts (this is the case with LISP, too)

Why don't you use ML? 

I do not want to start a Haskell vs. ML debate here but I hope that
everybody will agree that ML is much more mature. Sure it does not
contain some concepts like type classes which are worthwhile to
explore but particulary for teaching this may be an advantage. 

A survey which was recently posted here shows that there is a large
number of places where ML is used as an introductory programming
language.  From what I have seen here in Edinburgh it seems to be well
suited for this.

To come back to the original question: I believe that people should
learn C (having hacked in it for a while myself) but not as a first
language. It is bad for your style as is playing an instrument the
wrong way in the beginning. It is hard to get away from bad habbits
you have aquired in the beginning although not impossible.

T.
--
************************************************************
Thorsten Altenkirch		alti@dcs.ed.ac.uk
LFCS, Edinburgh
Scotland
From: sr@mips1.info.uqam.ca (Ratte*Sylvie)
Newsgroups: comp.lang.functional
Subject: FTP site for biblio
Date: 19 Aug 92 23:19:32 GMT
Distribution: comp.lang.functional
Organization: Universite du Quebec a Montreal


 I seem to have lost the name of the site where to get the biblio
on functional languages. Can somebody kindly remind me what it is ?

S. Ratte
From: ajtd@st-andrews.ac.uk (Antony J. T. Davie)
Newsgroups: comp.lang.functional
Subject: bibliography
Date: 12 Aug 92 16:16:11 GMT
Organization: St. Andrews University, Scotland.

I have a large bibliography (over 2,300 entries) of papers on functional
programming on a couple of hypercard stacks which can be picked up by
anonymous ftp from tamdhu.dcs.st-andrews.ac.uk (138.251.192.40) in /pub/staple
The file is called pubs.sit.Hqx and as expected from its name is stuffed and
binhexed.

If there's any interest I could put a plain text version on the same machine.
Newsgroups: comp.lang.functional
From: alanf@cs.monash.edu.au (Alan Grant Finlay)
Subject: Where can I get Nuprl
Summary: ftp
Organization: Computer Science, Monash University, Australia
Date: Fri, 21 Aug 1992 00:20:41 GMT


Does anyone know where I can get Nuprl by ftp (assuming there is
a free version available)?

I have documentation ("Implementing Mathematics with the Nuprl Proof
Development System", 1986) for version 1.0.  Are new versions upward
compatible?

	Thanks, Alan.	(email alanf@bruce.cs.monash.edu.au)
Newsgroups: comp.lang.functional
From: stabl@informatik.uni-muenchen.de (Robert Stabl)
Subject: Re: SML for IBM-PC with MSDOS ?
Reply-To: stabl@informatik.uni-muenchen.de
Organization: Leibniz-Rechenzentrum, Muenchen (Germany)
Date: Wed, 19 Aug 1992 09:27:14 GMT

In article <16oc9cINNc3o@iraul1.ira.uka.de> reetz@i80s11.ira.uka.de (reetz)  
writes:
> I'm looking for an implementation of Standard ML for an IBM-PC or
> compatible with MSDOS. I appreciate your advice!

Take a look at our ftp server ftp.informatik.uni-muenchen.de:/pub/sml/ibmpc.

Regards
 Robert Stabl.

--
              Robert Stabl    email: stabl@informatik.uni-muenchen.de
Computer Science Institute
      University of Munich      Tel: +(49) 89 2180 6316
           Leopoldstr. 11B      FAX: +(49) 89 2180 5246
        D-8000 Muenchen 40
                   Germany
Newsgroups: comp.lang.functional
From: goodrich@lynx.larc.nasa.gov (Mike Goodrich)
Subject: Re: Definitions
Organization: NASA Langley Research Center, Hampton, VA  USA
Date: Thu, 20 Aug 1992 16:26:02 GMT

In article <9910@uqcspe.cs.uq.oz.au>, michaeln@cs.uq.oz.au (Michael Norris) writes:
|> A quick question.
|> 
|> Where can I find good definitions of the words relating to
|> functional programming? I could make up definitions, but I'd
|> rather use accepted ones and refer to the source than take
|> the responsibility myself with the risk of defining things
|> wrongly, which would be distinctly bad form.
|> 
|> Specifically,
|> 	coersion
|> 	combinator
|> 	eager evaluation
|> 	high-order function
|> 	lazy evaluation
|> 	list comprehension
|> 	pattern matching
|> 	polymorphic
|> 	side-effects
|> 	strictly functional
|> 
|> thanks in advance.
|> 
|> -Michael N.	(e-mail: michaeln@cs.uq.oz.au)

I am currently reading "Functional Programming: Practice and Theory"
by Bruce J. MacLennan and highly recommend it.


...mike
From: Barry.Cornelius@newcastle.ac.uk (Barry Cornelius)
Newsgroups: comp.lang.modula2
Subject: Request for corrections to book
Date: 19 Aug 92 13:32:44 GMT
Reply-To: Barry.Cornelius@durham.ac.uk
Organization: University of Durham, Durha, DH1 3LE, UK

I am the author of the book:
    Programming with TopSpeed Modula-2
    Addison-Wesley
    1991
    0-201-41679-4
It is about to be reprinted.  If you have any corrections to this book,
please would you e-mail them to the address below before Tuesday 25th August.
Thanks.
--
Barry Cornelius            Electronic mail: Barry.Cornelius@durham.ac.uk
Post:  Computing Service, University of Durham, Durham, DH1 3LE, England
Phone: Durham (091 or +44 91) 374 4717, Secretary:374 2892, Fax:374 3741