HDTenEightyP/NetNews huggingface dataset:
From: nicted@toz.buffalo.ny.us (Nicole Tedesco)
Newsgroups: comp.lang.c++
Subject: Looking For CLOS on IBM-PC
Date: 6 Apr 92 03:30:22 GMT
Article-I.D.: toz.B0HsiB3w165w
Organization: The Tower of Zot - (716)838-0220

Does anyone have information about CLOS to run on an IBM-PC?  MS-DOS is
OK.  Windows OK.  OS/2 OK.  Mail me with information.

Thank you VERY much, in advance!

Take care y'all!
- Nicole Tedesco

---------------------------------------------------------------------
nicted@toz.buffalo.ny.us (Nicole Tedesco)
-- Change this!
Newsgroups: comp.lang.c++
From: eric@tfs.com (Eric Smith)
Newsgroups: comp.lang.c++
Subject: Re: Borland C++ 3.0 Linker error - Fatal Table Limit Exceeded
Date: 8 Apr 92 14:50:36 GMT
Organization: TFS

In article <1992Apr07.182510.16961@microsoft.com> jimad@microsoft.com (Jim ADCOCK) writes:
>choice of compiler than either Borland or Microsoft.  Take some time
>to learn the different products, libraries, debuggers, etc, lest you make

I have found that those C++ compilers that are limited to 640K are not
very useful for real work.  I don't know if Microsoft has that limit,
but in the past I stopped using an earlier version of Borland because
it became a problem.

Right now the only commercial DOS C++ compiler I am aware of that comes
with a 32-bit DOS extender is Zortech version 3.  I have found no
practical limits to the amount of memory you can use with Zortech
version 3.  I hope the other brands catch up with it soon, if they haven't
already.  If anyone knows of any that have, I would like to hear about it.

Zortech doesn't support templates, which is one of the most important
features of C++.

Also, in addition to the 640K limit, there is a 16MB limit imposed
by MS Windows.  I can overcome that with Zortech by not using MS
Windows, but 16MB is plenty for a lot of real work.

As a general rule, to make the best use of C++ you need a lot of memory,
and C++ compilers that limit their memory addressing are useful mainly
for learning C++ before you start doing real work with it.  Since the
street price of memory is now below $30 per MB, it's not very smart to
limit yourself to a small amount.
From: RHM1@psuvm.psu.edu
Newsgroups: comp.lang.c++
Subject: RE: C++ as a 1st language
Date: 17 Apr 92 01:54:19 GMT
Organization: Penn State University

A listserv group dealing with the use of C++ in the first course is
in its infancy.  So far discussion has involved top-down (high-level
classes first) versus a bottom-up (variables, assignment, I/O, etc. first)
approaches.  There has been some consensus that the class can and should
be introduced early, but inheritance is not important for at least 10 weeks.
I am aware of only a few schools that have used C++ in the first
programming course, but there are many schools shifting to C++ this fall
(or considering it).  From CMS on BITNET You can add yourself to this group
with this CMS command:

  TELL LISTSERV AT PSUVM SUBSCRIBE CS1OBJ-L yourFirstName yourLastName

If you can't do interactive messages, send mail to

  listserv@psuvm.psu.edu

with "SUBSCRIBE CS1OBJ-L yourFirstName yourLastName" part in the
BODY of the mail, NOT in the headers as the subject.   You should receive
verification.  If you have trouble subscribing, send me a personal note.

Rick Mercer
rhm1@psuvm.psu.edu
Penn State Berks
Newsgroups: comp.lang.c++
Subject: TC++, Pure Virtual Function Call error
From: brian@npri6.npri.com (Brian Kim)
Date: 14 Apr 92 13:02:36 GMT
Organization: NPRI, Alexandria VA
Keywords: pure virtual tc bc

Has any running Turbo C++ (my came with Turbo Vision) run into this
problem?

I define my class by deriving from SORTARRAY.  I then add some objects
into the array via the "add()".  Then I iterate and print each object
out.  That all works great.  But, when my program ends, the error
message

	"Abnormal program termination
	 Pure virtual function called"

is displayed.  Unfortunately, I can't find this error message in any
of the books that came with this product.  What perplexes me about
this problem is that my program ran fine.  Since my program is small
at this stage, I have concerns this will have an impact in a larger
program.

If anybody has dealt with, have insight, or a workaround, please
email me or post a reply.  Thank you in advance.

- brian
-- 
Brian Kim at NPRI Inc, Alexandria, VA USA
Ma Bell (703)683-9090  (UUCP:  brian@npri.com or ...uunet!uupsi!npri!brian
Newsgroups: comp.lang.c++
From: VALLHON@ricevm1.rice.edu (VALLHONRAT, S V)
Subject: Object-Oriented Design Course Offered
Organization: Rice University, Houston, TX
Date: Thu, 9 Apr 1992 15:52:17 GMT

Rice University's Office of Continuing Studies is offering a three day course
on Object-Oriented Analysis, Modeling, and Design from June 1 - 3, 1992 in
Houston, Texas.  The fee for this course is $595.  For more information call
(713) 527-4803 or (713) 520-6022.
From: bright@nazgul.UUCP (Walter Bright)
Newsgroups: comp.lang.c++
Subject: Tom Swan's "Learning C++"
Date: 14 Apr 92 01:05:27 GMT
Reply-To: bright@nazgul.UUCP (Walter Bright)
Organization: Zortech, Seattle

In article <57298@cup.portal.com> ts@cup.portal.com (Tim W Smith) writes:
/Actually, you can put of choosing until *after* you learn C++!  There is
/a book, "Learning C++," by Tom Swan, that was given a quite favorable
/review in "C Gazette."
/I looked over the book briefly in a bookstore, and it mentions that the
/compiler is a limited version of the full Zortech compiler.  It doesn't
/seem to say how it is limited, though.

It is limited in how big the symbol table will go, the compiler does
not run in protected mode, so it doesn't have access to lots of memory.
Also, the optimizer is not included. Otherwise, it can handle the full
language that the commercial version could.
It is also based on an older version of the compiler, ZTC++ 2.18.
From: swsmith@wrdis01.af.mil (Scott Smith)
Newsgroups: comp.lang.c++
Subject: Re: A Book for C++
Date: 6 Apr 92 12:48:58 GMT
Organization: 1926CCSG Robins AFB


        The phone number for Addison-Wesley Publishing is
1-800-447-2226. They publish the ARM and it can be ordered by calling
this number. The price is about $42. Hope this helps.
Scotty
From: b39y@vax5.cit.cornell.edu
Newsgroups: comp.lang.c++
Subject: Borland's CLASSLIB code and samples
Date: 14 Apr 92 13:42:04 EDT
Distribution: comp
Organization: Cornell University

Hi -

Is anyone aware of a source for sample code using the CLASSLIB classes included
with BC++ 2.0?  I'm particularly interested in a working example of a
DoubleList, but just about anything would be appreciated.  These can be code
FTP sites, books which use the BC++ 2.0 code as a base to develop routines,
personal code which you don't mind sharing, or anything else.

I'm anxious for suggestions; thanks for your help.

Dave Rodger
b39y@vax5.cit.cornell.edu
dave@cont-ed.mail.cornell.edu
From: magras@pacific.cps.msu.edu (Mr. Jean-Claude Magras)
Newsgroups: comp.lang.c++
Subject: closing a socket object
Date: 11 Apr 92 00:43:35 GMT
Organization: Anarchy Committee
Originator: magras@pacific.cps.msu.edu


Hello everyone!

I want to know what include files/funciotn name should be used besides
socket.h and types.h for closing a connection opened by invoking the
object's constrctor? Any known perils for doing socket work under c++?

Thanks in advance

J.C. Magras

 magras@cps.msu.edu. | 517 337 2267 | 1736 Burcham Dr., E. Lansing, MI 48823
Newsgroups: comp.lang.c++,sci.math,sci.math.stat,sci.math.num-analysis
From: rantonov@isis.cs.du.edu (Roumen Antonov)
Subject: Q: What is La++ class library?
Keywords: La++ C++ library martix algebra
Organization: Nyx, Public Access Unix at U. of Denver Math/CS dept.
Date: Sat, 11 Apr 92 18:38:06 GMT


Hello!
I just read a paper *A Distributed computing environment for control
system analysis and design* by S.Hara, G.Yamamoto, M. Oshima and
R.Kondo (Japan) in the Proceedings of 1992 IEEE Symposium on Computer
Aided Control System Design.
In that paper they refer to a C++ class library La++. The only source
for additional information quoted in the bibliography is *La++ User's 
Guide* (1990) by R.Kondo (no publisher mentioned).
La++ seems to be a class library for doing matrix calculations and some
other control system related operations, something in a way similar to
R.Davies' newmat.
Does any of you have more information about La++ or practical
experience in using it. How can I get it ? 
Do you know any other articles which refer to this library?
If you can help -- please email me!
Any information will be highly appreciated.
Thanks in advance!
R.


**********************************************************************
*              Roumen Antonov (eeantono@uk.ac.swan.pyr)              *
*====================================================================*   
*    Department of Electrical &                                      *
*     Electronic Engineering,        Voice: +44 792 205678(ext.4715) * 
*  University College of Swansea     FAX:   +44 792 295613           *
*     Swansea, United Kingdom                                        *
**********************************************************************
From: mwizard@rigel.cs.pdx.edu (Craig R. Nelson)
Newsgroups: comp.lang.c++
Subject: Re: how to implement a[i] =
Date: 6 Apr 92 01:49:19 GMT
Article-I.D.: pdxgate.5256

cyberman@toz.buffalo.ny.us (Cyberman) writes:

>WRW>I am kind of new for learning C++.  One thing confusing me recently is
>WRW>that it seems there is no easier way to do the following class assignment.

>WRW>   a[i] = b[j] + c[k] ;

>WRW>where a , b , c are in the same class.

>WRW>I have see some of implementations to do it. But they are quite complicate
>WRW>for a user. Can anyone provide a easy answer for this problem or it just
>WRW>the language is.

>The only way to do that is difine those operators for the CLASS
>in the class.

Not quit all of them.  

class ObjectDef;

class AnArray {
	...Data Members holding ObjectDef derived instances...

	virtual ObjectDef& operator []( int index ); 
};

inline ObjectDef& AnArray::operator[]( int index )
{
  ...Stuff to get your ObjectDef&...
  return theObject;
}

inline ObjectDef& operator +( ObjectDef& one, ObjectDef& two )
{
  ...Stuff to create a new object...
  ...Then perform the addition...
  return theResultObject.
}

You should as well define a CLASS operator for the = operation to delete
the object currently in the array where the new object is to be stored,
iff there is one there already.

Some of them do belong in the class, but some of them don't have to be.

Cheers!


=============================================================
|  Craig Nelson , OO Programmer    mwizard@eecs.cs.pdx.edu  | 
|  CC Software, Inc.		   Beaverton Oregon  97005  |
=============================================================
From: prastowo@qucis.queensu.ca (Bambang Nurcahyo Prastowo)
Newsgroups: comp.lang.functional
Subject: graph algorithms request
Date: 8 Apr 92 22:02:54 GMT
Organization: Computing & Information Science, Queen's University at Kingston


A while ago I read a couple of postings on writing graph algorithms
in functional programming languages. I would appreciate it if someone
can send me the whole discussion on the topic.

Bambang Prastowo
From: simonpj@dcs.glasgow.ac.uk (Simon L Peyton Jones)
Newsgroups: comp.lang.functional,mail.haskell
Subject: The Spineless Tagless G-machine: detailed paper
Date: 15 Apr 92 11:53:21 GMT
Organization: Glasgow University Computing Science Dept.
X-Mailer: mail-news 2.0.5


The following paper (aka "The Monster") is available by FTP from

	ftp.dcs.glasgow.ac.uk:
		pub/glasgow-fp/papers/spineless-tagless-gmachine.dvi

In the same directory you'll find various other papers from our
group.  Their titles are summarised in the file PAPER_LIST.

Simon PJ, University of Glasgow.


	Implementing lazy functional languages on stock hardware:
		the Spineless Tagless G-machine
			Version 2.4

		Simon L Peyton Jones, University of Glasgow

The Spineless Tagless G-machine is an abstract machine designed to support
non-strict higher-order functional languages.  This presentation of the
machine falls into three parts.  Firstly, we give a general discussion of
the design issues involved in implementing non-strict functional languages,
which is intended to set the STG machine in a wider context.

Next, we present the {\em STG language}, an austere but
recognisably-functional language, which as well as a {\em denotational}
meaning has a well-defined {\em operational} semantics.  The STG language is
the ``abstract machine code'' for the Spineless Tagless G-machine.

Lastly, we discuss the mapping of the STG language onto stock hardware.  The
success of an abstract machine model depends largely on how efficient this
mapping can be made, though this topic is often relegated to a short
section.  Instead, we give a detailed discussion of the design issues and
the choices we have made.  Our principal target is the C language, treating
the C compiler as a portable assembler.  

This is a very long and detailed paper (82 pages), and it gives away all
our trade secrets!  It is to appear in the Journal of Functional Programing.
From: kend@data.rain.com (Ken Dickey)
Newsgroups: comp.lang.functional
Subject: Re: Programm transformation & Extended Compilation
Date: 14 Apr 92 16:33:03 GMT
Organization: Microtek DSD, Hillsboro, OR
CC: wg@cs.tu-berlin.de

wg@opal.cs.tu-berlin.de (Wolfgang Grieskamp) writes:

>This is (once again, others did earlier) a query about program
>transformation, this time in the context of their application in
>extended compilation ...

------

"Compilation by Program Transformation", Richard Kelsey, Yale PhD
Thesis: YALEU/CSD/RR #702, May 1989. -- Pascal, BASIC, and Scheme
front ends into CPS.

{a report on the above}
Kelsey & Hudak: "Realistic Compilation by Program Transformation",
Sixteenth ACM Symposium on Principles of Programming Languages, 1989.

{uses several of the techniques and has a good bib}
Friedman, Wand, Haynes: _Essentials of Programming Languages_, 1991
ISBN: 0-262-06145-7 (MIT Press) (hb)
      0-07-022443-9 (McGraw Hill)

M. Wand, "From Interpreter to Compiler: A Representational
Derivation", in Programs as Data Objects, Springer-Verlag Lecture
Notes #217, 1986.


Note also: {partial evaluation papers}

D. Weise, R. Conybeare, E. Ruf, S. Seligman: "Automatic Online Partial
Evaluation", in Springer-Verlag Lecture Notes in Computer Science
#523, Functional Programming Languages and Computer Architectures.

Andrew Berlin: "Partial Evaluation Applied to Numerical Computation",
in Proceedings of the 1990 ACM Conference on Lisp and Functional
Programming, June 27-29, 1990, [ACM #552900; ISBN 0-89791-368-X].

{various papers}
SIGPLAN NOTICES v26, #9, September 1991: "Proceedings of the Symposium
on Partial Evaluation and Semantics-Based Program Manipulation"
From: wg@opal.cs.tu-berlin.de (Wolfgang Grieskamp)
Newsgroups: comp.lang.functional
Subject: Programm transformation & Extended Compilation
Date: 13 Apr 92 00:42:16 GMT
Reply-To: wg@cs.tu-berlin.de
Followup-To: comp.lang.functional
Organization: Technical University of Berlin



Hello,

This is (once again, others did earlier) a query about program
transformation, this time in the context of their application in
extended compilation (as Feather [1] defines: compilation with
programmer advice). Does anyone applies the techniques as f.i.
described in the Partsch Book "Specification and Transformation of
Programs" [2] for fully or nearly-full automated compilation?

* Function composition
* Function combination
* Partial evaluation & mixed computation
* Differencing
* Recursion simplification

I'am in particular interested in calculi which allow to express and
drive transformation process and applicatability condition check 
in a single integrated framework, like f.i. the RAINBOW II component
of the KIDS transformation system shall be (I'am not sure if it does,
I have no reference for it, but it is mentioned in [3]).

Papers, Projects, Desasters? I will be glad to summarize.

Thank You in advance
Wolfgang Grieskamp


[1]	M.S.Feather. A Survey and Classification of Program
	Transformation Approaches and Techniques. In: Programm
	Specification and Transformation, L.G.L.T. Meertens (Editor), 
	North Holland, 1987.

[2]	H.Partsch. Specification and Transformation of Programs.
	Springer, 1990.
	
[3]	KIDS: A Semiautomatic Program Development System. IEEE
	Transactions on Software Engineering, Vol. 16, No. 9,
	September 1990.


--
Wolfgang Grieskamp  wg@cs.tu-berlin.de tub!tubopal!wg  wg%opal@DB0TUI11.BITNET
Newsgroups: comp.lang.functional
From: davis@csrg2.ee.iastate.edu (Jim Davis)
Subject: Help! I can't FTP to Glasgow
Organization: Iowa State University, Ames IA
Date: Wed, 15 Apr 1992 18:48:11 GMT

Simon Peyton Jones posted a note about accessing what looks to be a very
interesting paper via FTP from ftp.dcs.glasgow.ac.uk.  For some reason, we
can't reach that address from here.  Is there a US site that archives 
Glasgow's pub/glasgow-fp  files?  Or do I need to use a different address?
Any information would be helpful.

Thanks!

Jim Davis
davis@iastate.edu


Organization: Sophomore, Math/Computer Science, Carnegie Mellon, Pittsburgh, PA
Newsgroups: comp.lang.functional
Date: Sat, 11 Apr 1992 00:46:02 -0400 
From: "Josh N. Pritikin" <jpab+@andrew.cmu.edu>
Subject: SML/NJ m88K port question

Will SML/NJ be ported to the m88k processor anytime soon? Is someone
already working on it?

( Josh Pritikin joshp+@cmu.edu
( It might be hot in Pittsburgh, but at least it's humid.
Newsgroups: comp.lang.functional
From: prastowo@qucis.queensu.ca (Bambang Nurcahyo Prastowo)
Subject: Re: graph algorithms request
Organization: Computing & Information Science, Queen's University at Kingston
Date: Thu, 16 Apr 1992 19:43:27 GMT

I got 3 replies to my request. All of them are the summary to
Torsten Roessel's request posted on 11 Jun 91, exactly the one
I was looking for.
Accidently, I stripped off the header of the replies so that
I could not find out who send them to me. I apology for that.

I'll forward the summary to those who sent me requests to what
I got.

Thank you.
Bambang Prastowo
From: uho@informatik.uni-kiel.dbp.de (Ulrich Hoffmann)
Newsgroups: comp.lang.functional
Subject: Combining term rewriting and FP?
Date: 6 Apr 92 17:31:37 GMT
Organization: Dept. of Computer Science, University of Kiel, FRG

Hi,

I'm looking for any references, remarks or experience reports
about integrating a term rewriting system, in which the
Church-Rosser-property does not hold in general, into
a functional environment.

Please respond by email to:

     ak@informatik.uni-kiel.dbp.de

Thanks in advance,
                    Alf Kimms.


----------------------------------------------------------------------
Christian-Albrechts-Universitaet Kiel, Institut fuer Informatik
Preusserstr. 1 - 9                   , D - 2300 Kiel 1
EMail: ak@informatik.uni-kiel.dbp.de
----------------------------------------------------------------------
Newsgroups: comp.lang.functional
From: knabe@CS.CMU.EDU (Frederick Knabe)
Subject: Re: Standard ML concurrency primitives
Date: Thu, 16 Apr 92 16:19:42 GMT
Organization: School of Computer Science, Carnegie Mellon University
	<3631@caslon.cs.arizona.edu>
Originator: knabe@ARCTIC.FOX.CS.CMU.EDU

Greg Morrisett at Carnegie Mellon has developed a whole threads package for
SML/NJ. This is described in the CMU tech report CMU-CS-90-186. You may also
contact Greg directly at jgmorris@cs.cmu.edu. I have used this package
extensively; it provides multiple lightweight threads with preemptive
scheduling, as well as various synchronization and exclusion primitives.

If you have a SG Iris, you can even run the threads in parallel (real
concurrency). 

Fritz Knabe
From: saunders@cs.arizona.edu (Richard T. Saunders)
Newsgroups: comp.lang.functional
Subject: Standard ML concurrency primitives
Date: 15 Apr 92 20:39:30 GMT
Organization: U of Arizona CS Dept, Tucson

Hi,
I am looking for references to papers/implementation that introduce
concurrency primitives explicitly into the language Standard ML (or
any version of ML---I am most familiar with SML of NJ).  Note that
I am not looking for a concurrent SML (one that takes normal SML and
parallelizes it), but rather an SML with new primitives into the
language to manage concurrency.

Do any such beasts exist in theory/in practice?  I believe I have
seen such references in the past in this newsgroup.

Thanks for any pointers/help in advance.


saunders@caslon.cs.arizona.edu | "This is NOT Mel Torme!" - Top Secret
Newsgroups: comp.lang.functional
From: dw@minster.york.ac.uk
Newsgroups: comp.lang.functional
Subject: Technical report available
Date: 14 Apr 92 15:21:56 GMT
Organization: Department of Computer Science, University of York, England


The following technical report is now available.


		Heap Profiling of Lazy Functional Programs

		     Colin Runciman and David Wakeling 

		             University of York

                 Technical Report Number 172 (April 1992)

			        Abstract 

	We describe the design, implementation and use of a new 
	kind of profiling tool that yields valuable information 
	about the memory use of lazy functional programs. The 
	tool has two parts: a modified functional language 
	implementation which generates profiling information 
	during the execution of programs, and a separate program 
	which converts this information to graphical form. With 
	the aid of profile graphs, one can make alterations to a 
	functional program which dramatically reduce its space 
	consumption. We demonstrate this in the case of a genuine 
	example --- the first to which the tool has been applied 
	--- for which the results are strikingly successful.


The material described in this paper was first presented informally at the 1992
Dagstuhl Seminar on Functional Languages: Compiler Technonogy and Parallelism. 
Since then, so many people have expressed interest in this work that we have 
decided to make the technical report available by either: 

    (1) using anonymous ftp to minster.york.ac.uk [144.32.128.41].
        Log in as "anonymous", password is your e-mail address.
        The file that you want is 

			reports/YCS-92-172.ps.Z

	Be sure to transfer it in binary mode.

    (2) writing to the York Departmental Librarian

		Ian Patrick,
		Department of Computer Science,
	    	University of York,
		Heslington,
		York,
		Y01 5DD,
		United Kingdom

	and asking for technical report YCS 172. 

The paper is 28 pages long. We hope you'll like it.

Cheers,

David Wakeling

-------------------------------------------------------------------------------
David Wakeling                  | "Far better it is to dare mighty things, to
Department of Computer Science  |  win glorious triumphs, even though checkered
University of York              |  by failure, than to take rank with those
York Y01 5DD                    |  poor spirits who neither enjoy much nor
England                         |  suffer much, because they live in the gray
                                |  twilight that knows not victory or defeat."
dw@minster.york.ac.uk           |  -- Theodore Roosevelt
-------------------------------------------------------------------------------
Newsgroups: comp.lang.functional
From: ark@alice.att.com (Andrew Koenig)
Newsgroups: comp.lang.functional
Subject: Re: Standard ML concurrency primitives
Date: 16 Apr 92 13:16:29 GMT
Article-I.D.: alice.22597
Reply-To: ark@alice.UUCP ()
Organization: AT&T Bell Laboratories, Liberty Corner NJ

In article <3631@caslon.cs.arizona.edu> saunders@cs.arizona.edu (Richard T. Saunders) writes:

> I am looking for references to papers/implementation that introduce
> concurrency primitives explicitly into the language Standard ML (or
> any version of ML---I am most familiar with SML of NJ).

Check the proceedings of the January 1992 ACM Principles of Programming
Languages conference.
-- 
				--Andrew Koenig
				  ark@europa.att.com
Newsgroups: comp.lang.modula2