HDTenEightyP/NetNews huggingface dataset:
From: g89s9112@giraffe.ru.ac.za (MR D STURZEBECHER)
Subject: initialization HELP structure of classes
Organization: Rhodes University, Grahamstown, South Africa
Distribution: global
Date: Mon, 7 Sep 1992 10:07:32 GMT

Hi,
I got a problem I do not understand. I am new to C++, but have programmed
C for quite a while.

The problem is the following. I did declare two classes

class digital ...
class analog ...

both which work fine. Now I needed arrays of those, so I declared

digital dout[nr_dig];
digital din [nr_dig];
analog  aout[nr_ana];
analog  ain;

which worked fine. Now I did want to group them, so that I got only one
object to drag around so I declared

typedef struct A_DATA
	  {
	    char    header[maxx];	// header  string
	    digital dout[nr_dig];	// digital outputs (class digital)
	    digital din [nr_dig];	// digital inputs  (class digital)
	    analog  aout[nr_ana];	// analog  outputs (class digital)
	    analog  ain;		// analog  input   (class digital)
	  }DATA;

still everything going well. Now in main I tried to initalize the thing

void main(void)
{
  // declare/initialize the data
  DATA data = {
		"PPORT DEMO",
		{
		  digital('1',"digital out 1 ","ON","OFF",0),
		  digital('2',"digital out 2 ","ON","OFF",0),
		  digital('3',"digital out 3 ","ON","OFF",0),
		  digital('4',"digital out 4 ","ON","OFF",0),
		  digital('5',"digital out 5 ","ON","OFF",0),
		  digital('6',"digital out 6 ","ON","OFF",0),
		  digital('7',"digital out 7 ","ON","OFF",0),
		  digital('8',"digital out 8 ","ON","OFF",0)
		},
		{
		  digital('a',"digital in  1 ","ON","OFF",0),
		  digital('b',"digital in  2 ","ON","OFF",0),
		  digital('c',"digital in  3 ","ON","OFF",0),
		  digital('d',"digital in  4 ","ON","OFF",0),
		  digital('e',"digital in  5 ","ON","OFF",0),
		  digital('f',"digital in  6 ","ON","OFF",0),
		  digital('g',"digital in  7 ","ON","OFF",0),
		  digital('h',"digital in  8 ","ON","OFF",0)
		},
		{
		  analog('n',"analog  out 1"),
		  analog('m',"analog  out 2")
		},
		analog ain('i',"analog  in  1")
	      };

.....
}

PROBLEM !!

the compiler gives the following error message

ERROR : Objects of type 'A_DATA' cannot be initialized with {  }

WHY ??

what else can I try ??

Anybody ?

Cheers, Dirk



----------------------------------------------------------------------------
Dirk Sturzebecher
g89s9112@beta.ru.ac.za
Newsgroups: comp.lang.c++
From: bjs@etn.ericsson.se (Bj|rn S{ter|y 1342)
Subject: Deleting NIHCL Objects
Keywords: virtual destructors 
Reply-To: bjs@etn.ericsson.se (Bj|rn S{ter|y 1342)
Organization: Ericsson Telecom A/S
Date: Wed, 9 Sep 92 11:04:55 GMT

i have implemented a set making use of the NIHCL Set class,
and several objects derived from the NIHCL class Object which
are added to the set using the add(Object *) method.

i soon found out that deleting the set though ~Set destructor
did not delete the objects in the set. i therefore tried to
iterate through the set deleting the objects in the set through
the individual Object pointers. this did however not release the
memory allocated by the derived objects, because the ~Object
destructor is not virtual.

most everything else about NIHCL seems very well designed, and i
can accept the fact that deleting the Set not automatically deletes
the individual objects, but the non virtual ~Object "feature" surprised
me.

i am hesitant to modify the NIHCL source code to make the ~Object 
virtual, due to any possible error that it might cause for other
parts of the library.

has anybody else seen/considered this "feature"? 
is it there for a good reason that i don't see?
is it possible to "fix" (i.e. by just making the ~Object virtual)?

regards,
bjorn.

---------------------------------
- Bjorn.Sateroy@etn.ericsson.se -
- Ericsson Telecom AS, Norway   -
---------------------------------
Newsgroups: comp.lang.functional
Subject: Re: need `ML for Working Programmer'
From: dresler@cabell.vcu.edu (Dan Resler)
Date: Wed, 9 Sep 1992 14:04:29 GMT
Organization: Virginia Commonwealth University

nickh@CS.CMU.EDU (Nick Haines) writes:

>In article <1992Sep3.163635.6941@cabell.vcu.edu> dresler@cabell.vcu.edu (Dan Resler) writes:

>   I have just been told by a representative of Cambridge University
>   Press that the _entire_ printing of `ML for the Working Programmer'
>   has been "frozen" indefinitely (i.e. they're not shipping and they
>   don't know why or when they'll ship again). Does anyone know why or for 
>   how long they'll be unavailable? I was planning on using it for one of
>   my texts this term; can anyone suggest a bookstore that might have
>   a few copies and be willing to ship? Thanks.

>Well, I read this and contacted a friend in the STM group of CUP in
>Cambridge, puzzled; like several people on this newsgroup, I had some
>involvement in the production of Paulson, and had heard nothing. This
>is the reply:

>> Paulson frozen? Nope. The paperback (with corrections) exists
>> and is selling like hot cakes. However you probably can't get
>> it yet in the US of A, and probably won't until next year sometime.
>> Our marketing in NY tells me that the demand in the US is
>> for hardcover not paperback books, so we're selling the second
>> printing in hardcover there.

>So there you go. From the horse's mouth, as it were. You shouldn't
>have any trouble getting hold of the hardcover (or the paperback if
>you're in the UK). If you do have any difficulties, contact me and I
>can make further enquiries (with the CUP people in NY, for instance).

>Nick Haines nickh@cs.cmu.edu

It was the CUP people in New York (Neena, to be specific) who gave
me this info. Three times. And since many have contacted me saying
this just can't be, I decided to try the top-down approach and
contact someone higher up at CUP.

Bingo. Paulson isn't frozen. They've run out of copies and are
currently waiting for the second-printing to arrive from the UK.
According to the person I talked to, the rep was "misinterpreting the 
information on her screen".

My contact was Peter John Leone (1-800-221-4512) who can be
contacted via email at mktg_cam@acf1.nyu.edu (I haven't tried this
address yet).
-- 
Dan Resler                             
Dept. of Mathematical Sciences        email: dresler@cabell.vcu.edu
Virginia Commonwealth University
Richmond, Virginia, USA 23284-2014
Newsgroups: comp.lang.functional
From: waugh@probitas.cs.utas.edu.au (Sam Waugh)
Subject: Re: Random number generator for Haskell (wanted)
Keywords: Random numbers, code, Haskelln
Organization: University of Tasmania, Australia.
Date: Tue, 8 Sep 1992 02:04:58 GMT

Thanks to everyone who posted and mailed regarding a random number generator
in Haskell (hbc being the most common reference).

I appreciate the time that people have taken in giving references and/or
their own random number generators.

Thanks again,

Sam Waugh

Department of Computer Science
Universty of Tasmania
Australia
email: waugh@cs.utas.edu.au
From: eglarsen@diku.dk (Jakob Eg Larsen)
Newsgroups: comp.lang.functional
Subject: Miranda for PC's ?
Date: 7 Sep 92 14:43:15 GMT
Organization: Department of Computer Science, U of Copenhagen


Hi,

is Miranda (version 2.009) available for PC's ?

Regards,
Jakob Larsen
From: iwm@doc.ic.ac.uk (Ian W Moor)
Newsgroups: comp.lang.functional
Subject: Re: Miranda for Commodore Amiga?
Date: 9 Sep 92 15:38:36 GMT
Reply-To: iwm@doc.ic.ac.uk (Ian W Moor)
Organization: Department Of Computing, Imperial College, London UK
NNTP-Posting-Host: swan.doc.ic.ac.uk


In article <1992Sep8.102258.27927@odin.diku.dk>, harpoon@diku.dk (Morten
Krog) writes:
|> Is Miranda (or a Miranda like language) available for the Commodore Amiga?
There is an implementation of Gofer for the Amiga for anonymous ftp from  
gatekeeper.dec.com. Gofer is similar to Haskell, so you could say
`Miranda-like'

   Ian W. Moor

iwm@doc.ic.ac.uk   Department of Computing, Imperial College.            
                   180 Queensgate London SW7 UK.               
"Experts from BNFL have advised the Russians to rename Chernobyl as Sellograd
 and open a tourist centre"
From: greg@cs.hw.ac.uk (Greg Michaelson)
Newsgroups: comp.lang.functional
Subject: PAL paper/manuals wanted
Date: 7 Sep 92 11:06:59 GMT
Organization: Dept of Computing and Electrical Engineering, Heriot-Watt University, Scotland

Does anybody have paper copies of any papers or manuals relating to Evan's
PAL, please? I will happily pay for copying and postage. I do not want
references, which I have aplenty...!

Greg Michaelson, Dept of Computing & Electrical Engineering, Heriot-Watt Uni,
                 Riccarton, Scotland, EH14 4AS
Xref: sparky comp.lang.functional:1090 alt.lang.ml:62 comp.lang.lisp:2407 comp.lang.scheme:2178 comp.lang.misc:3022 sci.math:11258 sci.logic:1381
From: ajtd@honey.st-and.ac.uk (Tony Davie)
Newsgroups: comp.lang.functional,alt.lang.ml,comp.lang.lisp,comp.lang.scheme,comp.lang.misc,sci.math,sci.logic
Subject: functional bibliography
Date: 11 Sep 92 08:25:11 GMT
Organization: St.Andrews University

Further to my previous message:

>Enough people expressed interest in a text-only copy of my functional
>bibliography that I have made one and placed it at /pub/staple/pubs.txt
>on our anonymous ftp machine tamdhu@dcs.st-and.ac.uk

A number of correspondents have told me that they can't access this address.
That's not surprising as it should say tamdhu.dcs.st-andrews.ac.uk .
If there is difficulty even with this, try using number 138.251.192.40
instead.

Sorry

Tony Davie
Newsgroups: comp.lang.functional
From: lambert@spectrum.cs.unsw.oz.au (Tim Lambert)
Subject: Re: Random number generator for Haskell (wanted)
Organization: CS&E, Uni of NSW, Australia
Date: 7 Sep 92 19:26:24

>>>>> On Mon, 7 Sep 1992 00:53:03 GMT, waugh@probitas.cs.utas.edu.au (Sam Waugh) said:

> I was wondering if anybody has implemented a random number generator
> in Haskell?  I am trying to use Haskell for some neural network
> applications and definitely need a good random function.  Otherwise

Here is one I wrote in Miranda (you didn't say if you wanted uniform
or normal variates, so I give you both.)

Tim

>|| random.m

random is given a positive integer seed and returns an infinite list
of uniform random numbers between 0 and 1.  We use a linear
congruential generator (see "Art of Computer Programming Vol 2")

> random :: num -> [num]
> random = map (/modulus) . iterate f
>          where f x = (x*multiplier) mod modulus
> multiplier = 69069
> modulus = 2^32

normal_random is given a seed and returns an infinite list of random
normal variates with mean 0 and variance 1.  (Box Muller method see
"Art of Computer Programming Vol 2")

> normal_random :: num -> [num]
> normal_random = box_muller.(map f).random
>		  where f x = 2*x - 1

box_muller takes a stream of uniform random numbers on [-1,1] and
returns a stream of normally distributed random numbers.

> box_muller :: [num] -> [num]
> box_muller (x1:x2:xs) = x1*m:x2*m:rest, if r <= 1
>		        = rest, otherwise
>			  where r = x1^2 + x2^2
>			        m = sqrt(-2*log r/r)
>			        rest = box_muller xs
Xref: sparky comp.lang.functional:1073 comp.lang.misc:2960
From: ajtd@honey.st-and.ac.uk (Tony Davie)
Newsgroups: comp.lang.functional,comp.lang.misc
Subject: functional programming bibliography
Date: 7 Sep 92 16:01:45 GMT
Organization: St.Andrews University

Hello,
Enough people expressed interest in a text-only copy of my functional
bibliography that I have made one and placed it at /pub/staple/pubs.txt
on our anonymous ftp machine tamdhu@dcs.st-and.ac.uk

It's in a kind of bastard refer format and uses %T for a title, %A for authors
%I for a unique index entry, %S for the source (which may be a reference to
another index --- that's the penalty for not using hypercard!), %K for
keywords and %C for comments.

I would be glad to receive errors, omissions and new entries.
Newsgroups: comp.lang.functional
From: scottm@intime.intime.COM (Scott Michel)
Subject: Test post.
Organization: IntelliMED Corporation, Santa Monica, CA
Date: Wed, 9 Sep 1992 01:05:54 GMT

This is a test post. barmar: You should see this now. Was a problem at
UCLA and our news feeder's NNTP parameters........

-scottm
From: augustss@cs.chalmers.se (Lennart Augustsson)
Newsgroups: comp.lang.functional
Subject: Re: Random number generator for Haskell (wanted)
Keywords: Random numbers, code, Haskelln
Date: 7 Sep 92 19:39:30 GMT
Organization: Chalmers University of Technology

In article <bruce.715827183@probitas> waugh@probitas.cs.utas.edu.au (Sam Waugh) writes:
>Hi.
>
>I was wondering if anybody has implemented a random number generator
>in Haskell?  I am trying to use Haskell for some neural network
>applications and definitely need a good random function.  Otherwise
>its back to Pascal and C (sob, sob).
Yes it's been done.  It comes with hbc.  And here it is!!

{-
   This module implements a (good) random number generator.

   The June 1988 (v31 #6) issue of the Communications of the ACM has an
   article by Pierre L'Ecuyer called, "Efficient and Portable Combined
   Random Number Generators".  Here is the Portable Combined Generator of
   L'Ecuyer for 32-bit computers.  It has a period of roughly 2.30584e18.

   Transliterator: Lennart Augustsson
-}

module Random(randomInts, randomDoubles) where
-- Use seeds s1 in 1..2147483562 and s2 in 1..2147483398 to generate
-- an infinite list of random Ints.
randomInts :: Int -> Int -> [Int]
randomInts s1 s2 =
    if 1 <= s1 && s1 <= 2147483562 then
	if 1 <= s2 && s2 <= 2147483398 then
	    rands s1 s2
	else
	    error "randomInts: Bad second seed."
    else
	error "randomInts: Bad first seed."

rands :: Int -> Int -> [Int]
rands s1 s2 =
    let
	k    = s1 `div` 53668
	s1'  = 40014 * (s1 - k * 53668) - k * 12211
	s1'' = if s1' < 0 then s1' + 2147483563 else s1'
    
	k'   = s2 `div` 52774
	s2'  = 40692 * (s2 - k' * 52774) - k' * 3791
	s2'' = if s2' < 0 then s2' + 2147483399 else s2'

	z    = s1'' - s2''
{-
	z'   = if z < 1 then z + 2147483562 else z

    in  z' : rands s1'' s2''
-}
-- Use this instead; it is a little stricter and generates much better code
    in  if z < 1 then z + 2147483562 : rands s1'' s2'' 
                 else z : rands s1'' s2''

-- For those of you who don't have fromInt
-- fromInt = fromInteger . toInteger

-- Same values for s1 and s2 as above, generates an infinite
-- list of Doubles uniformly distibuted in (0,1).
randomDoubles :: Int -> Int -> [Double]
randomDoubles s1 s2 = map (\x -> fromInt x * 4.6566130638969828e-10) (randomInts s1 s2)
-- 

	-- Lennart Augustsson
[This signature is intentionally left blank.]
From: harpoon@diku.dk (Morten Krog)
Newsgroups: comp.lang.functional
Subject: Miranda for Commodore Amiga?
Date: 8 Sep 92 10:22:58 GMT
Organization: Department of Computer Science, U of Copenhagen

Hi!

Is Miranda (or a Miranda like language) available for the Commodore Amiga?

Morten Krog,
harpoon@diku.dk
Newsgroups: comp.lang.functional
From: andrewmu@castle.ed.ac.uk (Andrew Murdoch)
Newsgroups: comp.lang.functional
Subject: Is there a small ML for Unix?
Date: 8 Sep 92 17:11:52 GMT
Distribution: comp
Organization: Edinburgh University

I'm looking for a small (<500k) ML. It doesn't have to have modules
and it would be nice if it was easy to compile. Is there such a thing?

Thanks in advance,
                  Andrew.
-- 
^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^
  Andrew A. Murdoch                                 andrewmu@castle.ed.ac.uk
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Newsgroups: comp.lang.functional
From: aspect@sun1g.informatik.Uni-Bremen.DE (Joern von Holten)
Subject: New platforms wanted ...
Organization: Universitaet Bremen
Date: Wed, 9 Sep 1992 15:49:03 GMT

To all interested folks having some time,
  we are searching for some interested people who like to
compile our system on new platforms. The system is a 
compiler of a strict pure functional language generating
C including a debugger and a make tool. The system is
designed to be usable and portable and not walkable,
so don't expect hours of hacking. Currently we have 
generated the system on
  SUN 3/xx           SUN 4/xx
  MacIntosch (A/UX)  NeXT
  IBM RS 6000        IBM PC (OS2/2.0)
Maybe someone tries it on Atari or Amiga.
The system is PD (most of it) and can be downloaded
via annonymous ftp from wowbagger.pclabor.uni-Bremen.de
(134.102.228.9, pub/languages/ASpecT).
Have a look at the README there.

hope to hear from you, Joern.
From: nickh@CS.CMU.EDU (Nick Haines)
Newsgroups: comp.lang.functional
Subject: Re: need `ML for Working Programmer'
Date: 8 Sep 92 15:22:18 GMT
Article-I.D.: VOILA.NICKH.92Sep8102218
Organization: School of Computer Science, Carnegie Mellon University
Originator: nickh@VOILA.VENARI.CS.CMU.EDU

In article <1992Sep3.163635.6941@cabell.vcu.edu> dresler@cabell.vcu.edu (Dan Resler) writes:

   I have just been told by a representative of Cambridge University
   Press that the _entire_ printing of `ML for the Working Programmer'
   has been "frozen" indefinitely (i.e. they're not shipping and they
   don't know why or when they'll ship again). Does anyone know why or for 
   how long they'll be unavailable? I was planning on using it for one of
   my texts this term; can anyone suggest a bookstore that might have
   a few copies and be willing to ship? Thanks.

Well, I read this and contacted a friend in the STM group of CUP in
Cambridge, puzzled; like several people on this newsgroup, I had some
involvement in the production of Paulson, and had heard nothing. This
is the reply:

> Paulson frozen? Nope. The paperback (with corrections) exists
> and is selling like hot cakes. However you probably can't get
> it yet in the US of A, and probably won't until next year sometime.
> Our marketing in NY tells me that the demand in the US is
> for hardcover not paperback books, so we're selling the second
> printing in hardcover there.

So there you go. From the horse's mouth, as it were. You shouldn't
have any trouble getting hold of the hardcover (or the paperback if
you're in the UK). If you do have any difficulties, contact me and I
can make further enquiries (with the CUP people in NY, for instance).

Nick Haines nickh@cs.cmu.edu
From: msmith@dcs.glasgow.ac.uk (Matthew Smith)
Newsgroups: comp.lang.functional
Subject: Re: transcendental functions in Gofer
Date: 6 Sep 92 22:00:59 GMT
Organization: Computing Sci, Glasgow Univ, Scotland

In article <aet.714816424@munagin> aet@mullian.ee.mu.OZ.AU (bert thompson) writes:

>
>has anyone implemented any functions in Gofer to do any of the following on Floats:
>
>sqrt exp log sin atan erf

>many thanks!
>
>	bert.


I have implemented some of these functions.
I have tested on a sun4.
I started with Gofer version 2.23 and created version 2.23.1 with
modifications to the following files:

.     builtin.c
      added primitive functions and appropriate definitions and table entries
      called a mymath.h to define maths functions

.     main.c
      changed version number

.     Makefile
      to include the maths library

The prelude has also beed appended with the appropriate definitions.
Supported extras are:

.     sin
      cos
      tan
      asn
      acs
      atn

.     erf
      erfc

.     exp
      log

.     sqrt
      cbrt


These functions seem to work, but no proper testing has been
carried out.

Ahh... where do we get it from.....

Using anonymous ftp from ftp.dcs.glasgow.ac.uk
the file
  pub/haskell/gofer/msmith/gofer2.23.1/src.tar.Z
has the new source


If you don't already have the vanilla source for 2.23, it is in
  pub/haskell/gofer/msmith/gofer2.23/src.tar.Z



(For those at Glasgow dcs, the files are in
    ~msmith/pub/gofer2.23/src and ~msmith/pub/gofer2.23.1
)


--Matthew Smith
(msmith@dcs.glasgow.ac.uk)
From: mleone+@cs.cmu.edu (Mark Leone)
Newsgroups: comp.lang.functional
Subject: Re: ibmpc versions of sml and caml wanted
Date: 8 Sep 92 13:49:34 GMT
Article-I.D.: cs.Bu9IEn.D78.2
Organization: School of Computer Science, Carnegie Mellon

In article <4155@seti.UUCP> Xavier.Leroy@inria.fr (Xavier Leroy) writes:
>Concerning SML on a PC, I have heard about three implementations:
>
>* Micro-ML, [...]
>
>* A port of Edinburgh ML 0.35. [...]
>
>* A port of the New Jersey compiler to the 80386 PC under Windows,
>developed by Yngvi Guttesen at the Technical University of Denmark.  A
>report on this appeared in the last ML workshop, but I don't know if
>the system is distributed yet. Seems to require a high-end PC (32M).

I'm not sure if Guttesen is supporting his Windows port.  I suspect he
is not.  I've been unable to contact him.

I have ported the SML/NJ runtime system (versions 0.66 & 0.82) to
Mach386 and BSD/386, and I've rewritten quite a bit of Guttessen's
code generator.  This code will probably be incorporated into the
standard SML/NJ distribution "real soon now".  If you want to try a
"pre-alpha" release, let me know.  It may take a bit of work to get it
running on non-BSD Unix variants.

I've run it on a 25 MHz laptop PC with only 12M of memory, and the
performance is tolerable on medium-sized programs.  It does much
better on a fast 486 with lots of memory.

--
Mark Leone  <mleone@cs.cmu.edu>
School of Computer Science, Carnegie Mellon University
Pittsburgh, PA 15213  USA
Xref: sparky comp.lang.functional:1091 comp.lang.misc:3034 comp.sys.mac.apps:14472 comp.sys.mac.programmer:15369 comp.os.msdos.apps:4714 comp.os.msdos.programmer:9285
From: waugh@probitas.cs.utas.edu.au (Sam Waugh)
Subject: Random number generator for Haskell (wanted)
Keywords: Random numbers, code, Haskell
Organization: University of Tasmania, Australia.
Date: Mon, 7 Sep 1992 00:53:03 GMT

Hi.

I was wondering if anybody has implemented a random number generator
in Haskell?  I am trying to use Haskell for some neural network
applications and definitely need a good random function.  Otherwise
its back to Pascal and C (sob, sob).

Thanks for any help.

Sam Waugh

Department of Computer Science
University of Tasmania
Australia.
email: waugh@cs.utas.edu.au
Newsgroups: comp.lang.functional
From: grosu@Informatik.TU-Muenchen.DE (Radu Grosu)
Subject: grap algorithms
Keywords: graphs, fixpoint
Originator: grosu@sunbroy24.informatik.tu-muenchen.de
Organization: Technische Universitaet Muenchen, Germany
Date: Mon, 7 Sep 1992 15:11:28 GMT


Here is my summary of responses on graph problems formulated as the fixed point
of a set of recursive equations. 

It seems that only one paper treated this issue. 

Below you find the responses I received. Thanks to anyone who replied.


Radu Grosu
Institut fuer Informatik
Technische Universitaet Muenchen
Arcisstrasse 21
D-8000 Muenchen 2
Germany


------------------------------------------------------------
   From:   martin.erwig@feruni-hagen.de (Martin Erwig)
------------------------------------------------------------

Have a look at:

  Kashiwagi, Y., Wise,D.S.: Graph Algorithms in a Lazy
  Functional Programming Language, Proc. 4th Int. Symp. on Lucid
  and Intensional Programming, 1991, 35--46.



-------------------------------------------------------------
   From:	jq@minster.york.ac.uk
-------------------------------------------------------------

Have you tried:

Graph Algorithms in a lazy functional programming language
Yugo Kashiwagi
David S. Wise
April 1991
Technical report no 330
Computer Science department Indiana Universiy
Bloomington Indiana 47405-4101

John
From: ojuarez@mtecv2.mty.itesm.mx (Octavio Juarez Espinosa)
Newsgroups: comp.lang.functional
Subject: FTP FP Backus
Summary: FTP sites
Keywords: FTP FP
Date: 7 Sep 92 15:19:34 GMT
Organization: I.T.E.S.M. Campus Monterrey



Hi,

I'll appreciate if send me ftp address for FP backus.

Thanks in advance.

Sincerely,

Octavio Juarez Espinosa

-- 
Octavio Juarez Espinosa
Gabriel Valerio 1134 
Saltillo, Coahuila    CP 25000
Mexico  email ojuarez@mtecv2.mty.itesm.mx