HDTenEightyP/NetNews huggingface dataset:
From: elliot@Wellspring.COM (Elliot H. Mednick)
Newsgroups: comp.lang.verilog
Subject: Memory Addressing in verilog
Distribution: world
Date: Thu, 19 Nov 92 15:44:23 GMT
Organization: Wellspring Solutions, Sutton, MA.
Reply-To: elliot@Wellspring.COM

In article <1992Nov18.181933.10242@bcrka451.bnr.ca> swood@bnr.ca writes:
 > My question is: does verilog do any bounds checking on index values to register
 >                 arrays or do I have to implement such checks myself?

You have to implement the checks yourself.  Note that in RTL coding, you
don't want to do checking unless the hardware you are designing is going to
do range-checking.  In behavioral-level coding, you can do whatever you want.

One technique that you ca use is to have a seperate "integrity-check"
module that continually tests things like index ranges and detects
other illegal conditions.  This module would be a 2nd top-level module
(that is, niether of the top-level module instantiate each other) and
reference variables within the simulation model by hierarchical names
so it would be non-intrusive.  This way, you can have an RTL model,
perhaps for synthesis, but with the range checking not part of the
actual RTL model.  For example:


module integrity;

// monitor 'index'
always @(my_module.index)
  if (my_module.index < 0 || my_module.index > `MAX_INDEX)
     $display ("Index out-of-bounds detected at time %t!", $time);
...
endmodule

--
Elliot H. Mednick                                        P.O. Box 150
Wellspring Solutions                                     Sutton, MA. 01590
elliot@Wellspring.com                                    +1 508 865 7271
Newsgroups: comp.lang.verilog
From: olsenc@carson.u.washington.edu (Clint Olsen)
Subject: Info about OVI and status of Verilog
Organization: University of Washington, Seattle
Date: Fri, 20 Nov 1992 00:22:48 GMT


Hello:

I was wondering if someone could give me some general info about OVI,
the function of the organization, etc.

Also, can someone give me the current status on Verilog and it's competition
with VHDL?  I recall hearing something about Cadence supporting VHDL.

Any information would be appreciated.

Thanks.

-Clint
Newsgroups: comp.lang.verilog
From: leung@DSG.Tandem.COM (Steven Leung)
Subject: Re: Avoiding inertial delay in delay lines
Originator: leung@bittemple
Organization: Tandem Computers
Date: Mon, 16 Nov 1992 16:38:07 GMT


smb@afterlife.ncsc.mil (Steve M. Burinsky) writes:

|> In article <1992Nov12.163116.17205@dsg.tandem.com> leung@DSG.Tandem.COM (Steven Leung) 
>
|> >	a <= #10 b;	/* transport delay */
|> >
|> 
|> I cannot see why a non-blocking assignment should operate any differently
|> than a blocking assignment in terms of how events are scheduled.  Thus,
|> I expected that the above would not work.  However, it does, as does
|> 
|> 	#10 a <= b;

Are you sure? I check my experiments again and pretty sure that putting
the delay in front of the assignment statement will not make the delay
become transport. It behaves exactly the same as #10 a = b;.

BTW, putting the delay after the assignment operator appears to have
some effects on scheduling. Even "a = #10 b;" has some difference from
"#10 a = b;". (Don't know whether this is considered as a bug though.)

Steven
-- 
328. Seek opportunity, not security. ...
        - Life's Little Instruction Book by H. J. Brown, Jr.

Newsgroups: comp.lang.verilog
From: mcintyre@wrksys.enet.dec.com (My name is...)
Subject: Re: 3rd Party Verilog Compilers
Organization: Digital Equipment Corporation
Distribution: usa
Date: Fri, 20 Nov 1992 01:33:12 GMT


In article <1992Nov17.032709.7216@kpc.com>, tla@kpc.com (Tom Anderson) writes...
>In article <49596@shamash.cdc.com> bjdunlop@shamash.cdc.com (Bruce Dunlop) writes:
>>A company called Chronologic Simulation was mentioned as having a fast
>>verilog compiler, in a previous post here.  Can someone give me their
>>phone number?  Also, does anyone have any good/bad experiences with it?
> 
>A previous poster supplied the phone number, but I'll offer some comments.
>Chronologic Simulation just went into production with their VCS (Verilog  
>Compiled Simulator) and KPCI was one of several companies that participated
>in the Beta testing.  Chronologic says that, with VCS, simulation execution 
>time is sped up over Verilog-XL by a factor of 10-20 for typical RTL 
>(synthesizable) models and up to 40 for pure behavioral models.  
> 
>We have tried several different simulations, all at the RTL level, and have
>indeed seen 10-20x speedups over Verilog-XL.  We are now running a model 
>with a 16x speedup, which pulls a nearly intolerable 12 hour simulation
>down to well under an hour.  This fundamentally changes the way we can
>approach the design verification process.  We have also seen VCS memory 
>usage as little as one-tenth that of Verilog-XL.
> 
>VCS does not (yet) contains all the functionality of Verilog-XL, although
>it took us only an hour or two to massage our model to work under VCS.
>The main limitations are that it does not provide an interactive mode nor
>all the PLI routines necessary to link to some third-party models.  But
>given the performance gains we have seen, we are highly motivated to find 
>workarounds to make VCS a part of design verification on future projects.
> 
>						Tom Anderson
Newsgroups: comp.lang.verilog
From: tla@kpc.com (Tom Anderson)
Subject: Re: 3rd Party Verilog Compilers
Summary: Chronologic comments
Keywords: verilog
Organization: Kubota Pacific Computer Inc, Santa Clara, CA
Distribution: usa
Date: Tue, 17 Nov 1992 03:27:09 GMT

In article <49596@shamash.cdc.com> bjdunlop@shamash.cdc.com (Bruce Dunlop) writes:
>A company called Chronologic Simulation was mentioned as having a fast
>verilog compiler, in a previous post here.  Can someone give me their
>phone number?  Also, does anyone have any good/bad experiences with it?

A previous poster supplied the phone number, but I'll offer some comments.
Chronologic Simulation just went into production with their VCS (Verilog  
Compiled Simulator) and KPCI was one of several companies that participated
in the Beta testing.  Chronologic says that, with VCS, simulation execution 
time is sped up over Verilog-XL by a factor of 10-20 for typical RTL 
(synthesizable) models and up to 40 for pure behavioral models.  

We have tried several different simulations, all at the RTL level, and have
indeed seen 10-20x speedups over Verilog-XL.  We are now running a model 
with a 16x speedup, which pulls a nearly intolerable 12 hour simulation
down to well under an hour.  This fundamentally changes the way we can
approach the design verification process.  We have also seen VCS memory 
usage as little as one-tenth that of Verilog-XL.

VCS does not (yet) contains all the functionality of Verilog-XL, although
it took us only an hour or two to massage our model to work under VCS.
The main limitations are that it does not provide an interactive mode nor
all the PLI routines necessary to link to some third-party models.  But
given the performance gains we have seen, we are highly motivated to find 
workarounds to make VCS a part of design verification on future projects.

						Tom Anderson
Newsgroups: comp.lang.sigplan
From: dsembr01@orion.spd.louisville.edu (Darren S. Embry)
Subject: WANTED: Scheme tutorial text file
Date: Fri, 20 Nov 1992 20:53:29 GMT
Organization: University of Louisville


I'm looking for a good tutorial text file somewhere on the Internet on
programming in Scheme.  Thanks for the help . . . 
-- 
---->8------ Darren Embry --- dsembr01@starbase.spd.louisville.edu -----8<----
 o  o   This is the Internet.  This is a .signature.  This is the 1990's.  You
\____/  know what to do.  This sentence is the implied disclaimer.  You know
        where to direct flames.
From: gjr@zurich.ai.mit.edu (Guillermo J. Rozas)
Newsgroups: comp.lang.scheme
Subject: Re: What are good references on learning Scheme
Date: 23 Nov 92 09:46:56
Organization: M.I.T. Artificial Intelligence Lab.
	<1992Nov20.001132.28991@pasteur.Berkeley.EDU>
	<1992Nov22.033413.1020@linus.mitre.org>
Reply-To: gjr@zurich.ai.mit.edu
NNTP-Posting-Host: chamartin.ai.mit.edu
In-reply-to: crawford@boole.mitre.org's message of Sun, 22 Nov 1992 03:34:13 GMT

In article <1992Nov22.033413.1020@linus.mitre.org> crawford@boole.mitre.org (Randy Crawford) writes:

|   Except that SICP doesn't mention call/cc anywhere.  I think that's a significant
|   omission.  And since R3RS _does_ include continuations, I have to conclude that
|   SICP didn't attempt to cover all of even R3RS, much less R4.


SICP predates R3RS by a few years.  It even predates RRRS (R2RS).

The decision to teach about continuations or not in an introductory
class is a major difference of opinion between the "Indiana School"
and the "MIT School".  SICP does not attempt to be a language tutorial
nor is the course on which it is based really a programming class.
There is a difference between teaching programming and teaching
thinking about programs and the decomposition of large systems.  Both
of them are valuable, but they are different.  Of course, you need
concrete programs and concrete programming languages to do the latter,
hence the use of Scheme and the tutorial-like material in SICP.

Note that CALL/CC is not required by the reports :-).
From: DGB4@psuvm.psu.edu
Newsgroups: comp.lang.scheme
Subject: FTP site for Gambit Scheme wanted.
Date: 23 Nov 92 17:37:38 GMT
Organization: Penn State University

Does anybody know the FTP site for Gambit Scheme for the Macintosh?
Perhaps more importantly, does anybody know if Gambit Scheme has been
updated since I obtained a copy of 1.7.1?

Please e-mail me directly with responses.
Thanks,
dgb4@psuvm.psu.edu
Newsgroups: comp.lang.scheme
From: zilla@ccrl.nj.nec.com (John Lewis)
Subject: Re: Why is the exact/inexact distinction built into Scheme?
Organization: C&C Research Labs, NEC USA, Princeton, N.J.
Date: Sat, 21 Nov 92 23:52:03 GMT

r.e. the exact/inexact distinction, I think you want to use (truncate x).
I also find the exact/inexact distinction to be a nuisance, 
along with the whole scheme numerical system, 
despite the beauty of the rest of the language.

(/ 5 3) and (/ 5. 3.) will give answers such as 5/3, 1.666666, and 1
in different dialects.  I end up coding in terms of constructs
such as (tofloat x) and (toint x) which I then attempt to implement 
using the behavior of the particular dialect.
Newsgroups: comp.lang.scheme
From: crawford@boole.mitre.org (Randy Crawford)
Subject: Re: What are good references on learning Scheme
Originator: crawford@boole.mitre.org
Organization: The MITRE Corporation, McLean, VA
Date: Wed, 18 Nov 1992 19:25:03 GMT


In article <BxpyEw.I36@cs.psu.edu>, ward@math.psu.edu (Brian Ward) writes:
> ryan@ux1.cso.uiuc.edu (amy) writes in response to pmathis@utdallas.edu (Paul J. Mathis):
> |>What are some good books on Scheme?  I currently have only PC Scheme's
> |>User's Guide and Reference Manual.  Thanks!
> |
> |ohoh our professor thinks "Structure and Interpretation of Computer
> |Programs" by Abelson and Sussman is the scheme equivalent of the 
> |bible...it's published by MIT Press through McGraw HIll (I think)
> 
> "Essentials of Programming Languages" by Friedman, Wand, and Haynes by the
> same publishers as above isn't really a "scheme book," but it's ok for the
> basics. (It's got a really cool cover, though!) I live and die by r-4rs
> these days, though...

Since there's been so little response, and although I can't discuss more 
than _SIPC_ by Abelson/Sussman and Kent Dybvig's book _The Scheme Programming
Language_, I'll offer my 2 cents.

SIPC is good if you want to spend a _long_ time learning about an older
version of scheme (pre-R3RS?).  Its audience is more appropriately those who 
are new to both programming and algorithms.  It's well over 300 pages long 
and about 8 years old.  It treats the language more as a state of mind than
a bag of tricks.  I own it and respect it for what it is, but I've chosen a
different book to learn scheme.

Dybvig's book is about 200 pages long and 5 years old.  It attempts to teach
only scheme, not programming, not algorithms.  It also improves on SICP for
my purposes by better covering continuations, engines, and scheme extensions.
Alas, it too is a bit dated, covering only the R3RS version of scheme.  But 
I'm confident that I'll learn more of scheme and more quickly by using 
Dybvig's book than I would using SICP.
-- 

| Randy Crawford        crawford@mitre.org        The MITRE Corporation
|                                                 7525 Colshire Dr., MS Z421
| N=1 -> P=NP           703 883-7940              McLean, VA  22102
Newsgroups: comp.lang.scheme
From: thinman@netcom.com (Technically Sweet)
Subject: Re: Why is the exact/inexact distinction built into Scheme?
Organization: International Foundation for Internal Freedom
Date: Thu, 19 Nov 1992 22:53:39 GMT

On a related topic, are there any Schemes which use fixed-point
reals instead of the machine's native floating point gear?
Such a real would, of course, be exact.

-- 

Lance Norskog

Data is not information is not knowledge is not wisdom.
Newsgroups: comp.lang.scheme
From: dak@sq.sq.com (David A Keldsen)
Subject: Re: What are good references on learning Scheme
Organization: SoftQuad Inc., Toronto, Canada
Date: Tue, 24 Nov 92 04:27:15 GMT

dorai@cs.rice.edu (Dorai Sitaram) writes:

>How does one pronounce the abbreviation "SICP"?  I've been
>saying "Sic P" without qualms all along, and only yesterday,
>when someone I recommended the book to started snickering
>did I realize that an alternate pronunciation would be
>desirable.

We call it "ess eye cee pee" or "The Wizard Book" or "The Purple Book"
(both at SoftQuad, Toronto, and at the University of Oregon, Eugene).

>That said, while I agree that SICP chooses to teach thinking
>about programs over teaching programming, I don't think the
>passing over of call/cc in the book can be attributed to
>that choice.  Arguably, if SICP were written today, it would
>contain call/cc or some variant, without such an act
>spelling a compromise of any of its lofty goals.

One might argue that EoPL (_Essentials of Programming Languages_,
Friedman, Wand and Haynes, ISBN 0-262-06145-7 [MIT Press hb], ISBN
0-07-022443-9 [McGraw-Hill]) is a recent and more advanced SICP.  One
would be incorrect ;-) but if you want a *really* good discussion of
call/cc, including how to implement it, I think that's a good place to
look.  It's a significantly more challenging text, and a terrific next
step after SICP.

(I think SICP is showing its age, just a bit...the dialect differences,
the lack of call/cc...but I still fondly remember it as the book which
made CS fun for me again.  I also still recommended it to people when
they ask "why Scheme" or even "what should I read next?").

Regards,
Dak
-- 
David A. 'Dak' Keldsen of SoftQuad, Inc. email: dak@sq.com  phone: 416-239-4801
"You're all in league, you people!" the Duke snarled.  "The whole bunch of
you!  You're nothing but a pack of ringleaders!"
	-- _Wyrd Sisters_ by Terry Pratchett
Newsgroups: comp.lang.scheme
From: oz@ursa.sis.yorku.ca (Ozan Yigit)
Subject: Re: R4RS in postscript?
Organization: York U. Student Information Systems Project
Date: Fri, 20 Nov 1992 01:58:23 GMT


   From: stevet@oakhill.sps.mot.com (Steve Turner)

   Where can I find a postscript verson of R4RS?

The Scheme Repository[1] of course contains a ps version of the
document. Look under the doc directory, for r4rs.ps.Z.

enjoy...	oz
---
[1] The repository is located at nexus.yorku.ca:pub/scheme, for
anonymous-ftp access. For the recent updates, see LATEST in the
same directory. README gives a brief overview of the repository.
---
cin, cout, cerr? crud. | electric: oz@sis.yorku.ca
		-anon  | ph:[416] 736 2100 x 33976
 
Newsgroups: comp.lang.scheme
From: dak@sq.sq.com (David A Keldsen)
Subject: Re: Commercial uses of scheme?
Organization: SoftQuad Inc., Toronto, Canada
Date: Tue, 17 Nov 92 06:38:29 GMT

dan@cae.prds.cdx.mot.com (Dan Breslau) writes:

>I know that Scheme is popular in several applications,
>especially CAD/CAM, both for implementation and as an
>extension language. Can anyone tell me which companies
>(in any industry) are using it, and how (implementation,
>extension language, both, other...)

SoftQuad is using Scheme [*] as both an extension and implementation
language for several of our products.  These include a structured SGML
editor (Author/Editor(tm)), an SGML application builder, and various
text, graphics, and user-interface tools.

-- 
[*] Our extension language is Scheme with optional object-oriented
extensions, based on PSI.  PSI, a Portable Scheme Interpreter, was
originally written by Ozan Yigit of York University; SoftQuad has
extended, ported, and optimized the interpreter (with Ozan's help).
Doug Moen of Nixdorf also helped to make PSI much easier to port.  

One of these days, PSI will be released to Usenet.

Disclaimer:  I am a SoftQuad employee.  Author/Editor is a trademark of
SoftQuad, Inc.  Do not remove cover:  no lawyer-serviceable parts inside.

Regards,
Dak
-- 
David A. 'Dak' Keldsen of SoftQuad, Inc. email: dak@sq.com  phone: 416-239-4801
"I knew you must be edified by the margent ere you had done."
		(_Hamlet, Prince of Denmark,_ Act V, Scene ii, line 156)

Newsgroups: comp.lang.scheme
From: stevet@oakhill.sps.mot.com (Steve Turner)
Subject: R4RS in postscript?
Organization: Motorola Inc., Austin, Texas
Date: Tue, 17 Nov 1992 00:34:19 GMT

Where can I find a postscript verson of R4RS?

-- 
--------------------------------------------------------
 Steve Turner                     Motorola, Inc.
 stevet@fusion.sps.mot.com        RISC Design Automation
 512.891.8728                     Austin, TX 
Newsgroups: comp.lang.scheme
From: birdman@casbah.acns.nwu.edu (Christopher Kush)
Subject: Re: FTP site for Gambit Scheme wanted.
Organization: Northwestern University, Evanston Illinois.
Date: Tue, 24 Nov 1992 04:29:40 GMT

In article <92328.123738DGB4@psuvm.psu.edu> DGB4@psuvm.psu.edu writes:
>Does anybody know the FTP site for Gambit Scheme for the Macintosh?
>Perhaps more importantly, does anybody know if Gambit Scheme has been
>updated since I obtained a copy of 1.7.1?

In a similar vein, does anyone know of a nice commercial implementation of
Scheme for the Macintosh *besides* Lightship?
_________
_/__\_._| christopher s. kush / birdman@nwu.edu / (708) 467 2067
_\@_|_._| computer systems / programming, industrial research laboratory
___/____| 1801 maple avenue, evanston, illinois 60201 - 3135
__/_____| mesg y; cat /core | write root &; mesg n
Newsgroups: comp.lang.scheme
From: josh@viewlogic.com (Josh Marantz)
Subject: Re: Commercial uses of scheme?
Organization: Viewlogic Systems, Inc.
Date: Fri, 20 Nov 1992 01:27:20 GMT

Viewlogic Systems markets an Electronic Design Automation system with
an extension language based on Scheme, but with a C-like syntax,
called Viewscript.

The Cad Framework Initiative, which is a group of EDA vendors,
integrators, and customers, has unofficially settled on Scheme as the
basis for an industry-standard extension lanaguage.  They are now
working out the details of an alternate syntax that will probably be
C-like.  Once this effort is complete, there will probably be a number
of EDA companies with products that have Scheme-based extension
languages.

The merits and pitfalls of this effort, by the way, have been
discussed in this newsgroup in the past.  Nevertheless, progress
is being made.
-- 
Joshua Marantz                          You make my life and times
Viewlogic Systems,                        a book of bluesy Saturdays
josh@viewlogic.com                      And I have to choose...
From: lewis@netcom.com (David Lewis)
Subject: Re: Free Scheme for the Mac?
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Date: Fri, 20 Nov 1992 18:57:57 GMT

hassan@cs.ubc.ca (Moustafa Hassan) writes:

(deletions)

>What I'm primarily looking for is a reliable, free scheme interpreter
>that supports bignums, streams, and is pretty much compatible with 
>Chez scheme or mit-scheme.  If you can help at all, please let me know.
>Thanks in advance.

	Can't offer _free_, but I can highly recommend the student
edition of MacScheme from Lightship Software. $37.50 from MIT Press
when I got mine, and includes manual and disk with code to make it
compatible with that in Ableson and Sussman. It meets your stated
requirements.
-- 
David Lewis	lewis@netcom.com	(408) 439-2374
Newsgroups: comp.lang.scheme
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Subject: slib1c2 Scheme library available
Organization: M.I.T. Artificial Intelligence Lab.
Date: Fri, 20 Nov 1992 23:07:11 GMT

This message announces the availability of Scheme Library release
slib1c2.

New in release slib1c2 are: Several bug fixes and functions for
manipulating the case of strings.  Macro:repl now uses DYNAMIC-WIND
to catch errors and interrupts.  This results in a useable interactive
top level for those implementations which support DYNAMIC-WIND.

From: hanche@ams.sunysb.edu (Harald Hanche-Olsen) comes fixed floating
random distributions.

SLIB is a portable scheme library meant to provide compatibiliy and
utility functions for all standard scheme implementations.

SLIB includes initialization files for ELK 1.5, GAMBIT, MITScheme,
scheme->C, Scheme48, and T3.1.  Scm4a also supports SLIB.

Documentation includes a manifest, installation instructions, and
proposed coding standards for the library.  Documentation on each
library package is supplied.

SLIB can be obtained via ftp (detailed instructions follow) from:
altdorf.ai.mit.edu:archive/scm/slib1c2.tar.Z
nexus.yorku.ca:pub/scheme/new/slib1c2.tar.Z

  ftp altdorf.ai.mit.edu [18.43.0.246] (anonymous)
  cd archive/scm
  bin
  get slib1c2.tar.Z

or
  ftp nexus.yorku.ca (anonymous)
  cd pub/scheme/new
  bin
  get slib1c2.tar.Z

  `slib1c2.tar.Z' is a compressed tar file of a Scheme Library.

Remember to use binary mode when transferring the *.tar.Z files.
Newsgroups: comp.lang.scheme
From: gat@forsight2.jpl.nasa.gov (Erann Gat)
Subject: Re: What are good references on learning Scheme
Organization: Jet Propulsion Laboratory
Date: Tue, 24 Nov 1992 01:12:46 GMT

In article <By6MoB.7qH@rice.edu> dorai@cs.rice.edu (Dorai Sitaram) writes:
>How does one pronounce the abbreviation "SICP"? 

I always pronounce it, "Sussman and Abelson"  ;-)

E.
From: ark@alice.att.com (Andrew Koenig)
Newsgroups: comp.lang.scheme
Subject: Re: What are good references on learning Scheme
Date: 24 Nov 92 02:01:02 GMT
Article-I.D.: alice.24277
Reply-To: ark@alice.UUCP ()
Organization: AT&T Bell Laboratories, Murray Hill NJ

In article <By6MoB.7qH@rice.edu> dorai@cs.rice.edu (Dorai Sitaram) writes:

> How does one pronounce the abbreviation "SICP"?

`The Purple Book', of course.

And Sethi's `Programming Languages: Concepts and Constructs'
is `The Purple Teddy-Bear Book' to distinguish it from SICP.
-- 
				--Andrew Koenig
				  ark@europa.att.com
Newsgroups: comp.lang.scheme
From: birdman@casbah.acns.nwu.edu (Christopher Kush)
Subject: Re: FTP site for Gambit Scheme wanted.
Organization: Northwestern University, Evanston Illinois.
Date: Tue, 24 Nov 1992 04:31:50 GMT

In article <92328.123738DGB4@psuvm.psu.edu> DGB4@psuvm.psu.edu writes:
>Does anybody know the FTP site for Gambit Scheme for the Macintosh?
>Perhaps more importantly, does anybody know if Gambit Scheme has been
>updated since I obtained a copy of 1.7.1?

In a similar vein, does anyone know of a nice commercial implementation of
Scheme for the Macintosh *besides* Lightship?
_________
_/__\_._| christopher s. kush / birdman@nwu.edu / (708) 467 2067
_\@_|_._| computer systems / programming, industrial research laboratory
___/____| 1801 maple avenue, evanston, illinois 60201 - 3135
__/_____| mesg y; cat /core | write root &; mesg n