HDTenEightyP/NetNews huggingface dataset:
Newsgroups: comp.lang.verilog


	Hi,

	We're looking for a PD netlist translator that can map a hierarchical
    structural Verilog netlist into TEGAS. Any pointer is much appreciated.

----
Hai  Vo-Ba                              (303)229-3874
ESL  MS55              			hai@hpeshai.fc.hp.com
Hewlett Packard Co.
3404 E. Harmony Rd.
Fort Collins, Colorado 80525-9599
Newsgroups: comp.lang.verilog
From: eli@netcom.com (Interpretive Systems)
Subject: Re: Summary of designing ASIC using Verilog
Date: Wed, 12 Aug 92 22:49:50 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Keywords: Verilog, Cadence, ASIC

In article <1992Aug12.180805.13962@informatik.uni-hamburg.de> fan@tech9.informatik.uni-hamburg.de (Xiaoming Fan) writes:
>bout three weeks ago I posted the message asking about designing ASIC using
>Verilog. So far I  did not receive  many responses.  Any new information or
>comments would also be appreciated.
>3. From: marchior@dxcern.cern.ch (Alessandro Marchioro)
>
> 1- Verilog book: look for 
>     E. Sternheim et al.
>     Hardware Modeling with Verilog HDL
>                    Automata Publishing Company
>                    POBox 50335             !!!!!! Wrong (old)
>                    Palo Alto  CA 94303     !!!!!! Wrong (old)
>                    fax: (415) 855 9545     !!!!!! Wrong (old)

The new address for Automata Publishing Co. is

10487 Westacres Dr.
Cupertino, CA 95014
Tel (408) 255-0705
FAX (408) 253-7916


Newsgroups: comp.lang.verilog
From: schop@veritools.com (Robert Schopmeyer)
Newsgroups: comp.lang.verilog
Subject: new verilog tools
Date: 18 Aug 92 16:46:13 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest)
Return-Path: <rschop!veritools.com!schop>
To: veritool@netcom.com
Status: R


			NEW VERILOG TOOLS FOR VERILOG DESIGNERS 
			___________________________________
8/17/92
	VERITOOLS INC. has several new software products for designers
	using Verilog which make Verilog easier to use and allow the user
	of Verilog to be more productive. 

	Undertow I, the wave display program for Verilog Value Change 
		    Dump Files, engineers using this program have been 
		    getting 5 times the productivity over previous
		    ways of debugging simulations

	Typetool I, an easy to use graphical front-end for Verilog
	
	VLTool, a graphical front-end for Verilog with a design parser

	Vflat I, the Verilog netlist flattener

	These products are available for use on Sun-Sparc workstations and 
	are obtainable with ftp anonymous.  Undertow I is also available for use
	on the HP 700 workstations. Please contact Veritools Inc. directly
	for this version.

	Other products available from Veritools Inc. are:

	Nettool, a tool to automatically determine the status of all of the 
	available workstations on your network and allow the user to log
	into the most appropriate one

	veriLINT, a program to lint your Verilog code for user selectable 
	constructs for both simulation and synthesis 

	Verilog to VHDL converter, converts Verilog code to VHDL code

	interParse, a parser for Verilog, primarily used for syntax checking

	openHDLtoolkit, a software application that reads and parses a Verilog
	HDL description, verifies the syntactic and semantic correctness
	of the description, generates an intermediate representation and 
	provides a comprehensive suite of access routines for manipulating
	this data

 	Veriformal,  a formal verification tool that Boolean compares two
  	representations of a design and determines if they are equivalent or not

	If you would like to retrieve the Veritools' software products using
	ftp anonymous please follow these basic instructions:

		1.  ftp netcom.netcom.com or ftp 192.100.81.100 
	    		 login as anonymous
	   	 	use password as indicated 
		2.  cd pub/veritools
		3.  get veritools_tar.Z
		4.  get README
		5.  close

	If you need any information about these products 
	contact Veritools Inc. at:

		email:  rschop!veritools.com!inquiry@netcom.com
		phone: 415 941-6870
		fax: 415 941-7965
	Verilog is a registered trademark of Open Verilog International.
Newsgroups: comp.lang.verilog
From: kuttanna@eemips.tamu.edu (Belliappa Kuttanna)
Subject: Simulating processor architectures
Organization: Texas A&M University
Date: Wed, 12 Aug 1992 20:24:38 GMT

 Having developed a behavioral model of a processor, I want to measure 
 its performance using some of the standard C benchmarks. In order to 
 do this, a flow which starts with a C program & ends up producing
 a text file containing the instructions in either binary
 or hex formats, is required. Obviously, I need a compiler which uses  
 the instruction set identical to the one used in the model.
 I have used the DLX instruction set (Hennessy - Patterson) since 
 the gnu CC compiler can generate code using this instruction set.
 However, I do not know how to generate the Verilog input from the
 a.out or the assembly code file, without having to develop some 
 software specifically for this purpose.

 If anyone has tried to use Verilog along these lines, PLEASE let me
 know how to proceed. Even if you have not, any ideas/comments on how
 to get around this problem are welcome. If you think that this flow
 will not work, please let me know.
 In addition, is there any other format in which the input file can be
 specified ? 

 Any help in this regard will be greatly appreciated.

 Belliappa Kuttanna              kuttanna@ee.tamu.edu
 Dept. of Electrical Engg.
 Texas A&M University.

 
Newsgroups: comp.lang.verilog
From: veritool@netcom.com (Veritools)
Subject: new verilog tools
Date: Tue, 18 Aug 92 17:29:07 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 

From rschop!veritools.com!schop Tue Aug 18 09:52:00 1992
Return-Path: <rschop!veritools.com!schop>
Received: from netcomsv.netcom.com by netcom.netcom.com (4.1/SMI-4.1)
	id AA22377; Tue, 18 Aug 92 09:51:59 PDT
Received: from rschop.UUCP by netcomsv.netcom.com with UUCP (4.1/SMI-4.1)
	id AA06395; Tue, 18 Aug 92 09:51:48 PDT
Received: by veritools.com (4.1/SMI-4.1)
	id AA01070; Tue, 18 Aug 92 09:46:13 PDT
Date: Tue, 18 Aug 92 09:46:13 PDT
From: schop@veritools.com (Robert Schopmeyer)
Message-Id: <9208181646.AA01070@veritools.com>
To: veritool@netcom.com
Status: R

			NEW VERILOG TOOLS FOR VERILOG DESIGNERS 
			___________________________________
8/17/92
	VERITOOLS INC. has several new software products for designers
	using Verilog which make Verilog easier to use and allow the user
	of Verilog to be more productive. 

	Undertow I, the wave display program for Verilog Value Change 
		    Dump Files, engineers using this program have been 
		    getting 5 times the productivity over previous
		    ways of debugging simulations

	Typetool I, an easy to use graphical front-end for Verilog
	
	VLTool, a graphical front-end for Verilog with a design parser

	Vflat I, the Verilog netlist flattener

	These products are available for use on Sun-Sparc workstations and 
	are obtainable with ftp anonymous.  Undertow I is also available for use
	on the HP 700 workstations. Please contact Veritools Inc. directly
	for this version.

	Other products available from Veritools Inc. are:

	Nettool, a tool to automatically determine the status of all of the 
	available workstations on your network and allow the user to log
	into the most appropriate one

	veriLINT, a program to lint your Verilog code for user selectable 
	constructs for both simulation and synthesis 

	Verilog to VHDL converter, converts Verilog code to VHDL code

	interParse, a parser for Verilog, primarily used for syntax checking

	openHDLtoolkit, a software application that reads and parses a Verilog
	HDL description, verifies the syntactic and semantic correctness
	of the description, generates an intermediate representation and 
	provides a comprehensive suite of access routines for manipulating
	this data

 	Veriformal,  a formal verification tool that Boolean compares two
  	representations of a design and determines if they are equivalent or not

	If you would like to retrieve the Veritools' software products using
	ftp anonymous please follow these basic instructions:

		1.  ftp netcom.netcom.com or ftp 192.100.81.100 
	    		 login as anonymous
	   	 	use password as indicated 
		2.  cd pub/veritools
		3.  get veritools_tar.Z
		4.  get README
		5.  close

	If you need any information about these products 
	contact Veritools Inc. at:

		email:  rschop!veritools.com!inquiry@netcom.com
		phone: 415 941-6870
		fax: 415 941-7965
	Verilog is a registered trademark of Open Verilog International.
From: extchbu@kk293.ericsson.se (Christian Burisch TT/RKE)
Subject: M to Verilog translator
Reply-To: extchbu@kk.ericsson.se
Organization: Ericsson
Date: Mon, 17 Aug 1992 11:36:03 GMT


Hi,

Is there an M -> Verilog translator available?
M is the modelling language of Mentor LSIM, 
Verilog is a digital simulator from Cadence.
No support is necessary, any "hack" would be welcome.
Please email to me or post.

Thanks in advance,

Christian
From: jaffer@zurich.ai.mit.edu (Aubrey Jaffer)
Newsgroups: comp.lang.scheme
Subject: Re: random rant on random files
Date: 20 Aug 92 15:55:11 GMT
Organization: M.I.T. Artificial Intelligence Lab.

In article <1992Aug17.100735.7594@physiol.su.OZ.AU> john@physiol.su.OZ.AU (John Mackin) writes:

   In article <9208130624.1.11214@cup.portal.com>,
	   vanMeule@cup.portal.COM writes:

   > I feel a little upset at Scheme for lack of direct support in 
   > most Schemes for random files.

   Without in any way endorsing the original poster's desire to make
   Scheme into the new COBOL :):), I too was surprised and disappointed
   that R4RS Scheme doesn't have a seek function to apply to ports.  I
   have an application where I need to read a (large) file line-wise
   backwards, and the only Scheme I can code it in at the moment is
   Scheme->C where I have access to libc.

scm4a10 offers:

  (file-position <port>)				procedure

Returns the current position of the character in <port> which will
next be read or written.  If <port> is not open to a file the result
is unspecified.

  (file-set-position <port> <integer>)			procedure

Sets the current position in <port> which will next be read or
written.  If <port> is not open to a file the action of
file-set-position is unspecified.  The result of file-set-position is
unspecified.
Newsgroups: comp.lang.scheme
From: Jerome Chan <yjc@po.cwru.edu>
Subject: Why won't this work?
X-Xxmessage-Id: <A6BBE96BC301F063@b61539.student.cwru.edu>
X-Xxdate: Sat, 22 Aug 92 17:54:03 GMT
Organization: The Tofu Society of Singapore
X-Useragent: Nuntius v1.1.1d9
Date: Sat, 22 Aug 92 16:51:16 GMT

  I'm trying to learn Scheme on my own but I've run into several
problems. I'm using "The Scheme Programming language" by R Kent Dybvig
and the Gambit Scheme Interpreter version 1.8 for the Macintosh.

( let ([x 2])
      (+ x 3))

barfs. Can someone help?

---
 The Evil Tofu ("I thought I knew the Mac ...")

"Sure or Not? Got or Not one? Aiyah! Why like that one! Terriblur lah!
Horrijible lah! Kisau one! Alamak! Gone Case Aleady!"
From: tmb@arolla.idiap.ch (Thomas M. Breuel)
Newsgroups: comp.lang.scheme
Subject: Re: random rant on random files
Date: 20 Aug 92 22:13:14 GMT
	<TMB.92Aug18171257@arolla.idiap.ch> <704@data.rain.com>
Reply-To: tmb@idiap.ch
Organization: IDIAP (Institut Dalle Molle d'Intelligence Artificielle
	Perceptive)
In-reply-to: kend@data.rain.com's message of 19 Aug 92 16:56:19 GMT

In article <704@data.rain.com> kend@data.rain.com (Ken Dickey) writes:

   tmb@arolla.idiap.ch (Thomas M. Breuel) writes:

   >What is wrong with binary streams?

   Nothing.  But Scheme is not a store description language (like C/C++),
   and does not have a binary interface defined.  I have no problems with
   making a "location pointer" and reading memory with a port interface.  
   I prefer not to have to reset such a pointer at every random i/o.

   It is trivial to build a port interface on top of stores.

It is also trivial to build a store interface on top of binary
streams. One question is what the language should provide. I'd prefer
to see it provide binary streams, not stores, since I feel that binary
streams are more general.

				Thomas.
From: bh@anarres.CS.Berkeley.EDU (Brian Harvey)
Newsgroups: comp.lang.scheme
Subject: Re: Re^2: random rant on random files
Date: 18 Aug 1992 15:41:20 GMT
Organization: University of California at Berkeley
NNTP-Posting-Host: anarres.cs.berkeley.edu


Okay, so what do I do if I want to write a new file from scratch?
I don't want to create a store, buffer it in a temp file on disk,
and then finally copy it to the filename I really meant.  (That's
what I was trying to ask about copying.)

The part about unsigned-integers-only seems a little user-unfriendly
to me.  To make this work in a way that would be both convenient and
Schemely, it seems to me (thinking about it off the top of my head)
that we'd need -- dare I say it -- first-class types!  Then you could
say (datum->store <datum> <type> <store-addr>) and
(store->datum <type> <store-addr>).  You'd want the first-class type
mechanism to include user-defined ADTs as well as the primitive types.

I mean, how does someone write a bignum into a store?  This seems
way too hairy for a simple-minded programmer like me; I'd rather
do the I/O in C!  (Which I hate, if that wasn't obvious.)

Alternatively, maybe every primitive type has to have an unambiguous
binary representation the same as it has a print form, and instead of
explicitly mentioning types you just leave that argument out and
Scheme figures it out.  That would mean, though, tagging everything
in the store with its type.

I'm feeling a little disorganized about this message, but it's because
I'm really struggling to make sense of the whole idea.  I mean, files
just feel very different from memory to me.  I know that at some level
of abstraction they're the same, but they perform quite differently.
I don't understand [I'm not being sarcastic] the principle of language
design whereby symbols and strings are treated separately but files
and memory are treated the same.
Newsgroups: comp.lang.scheme
From: thinman@netcom.com (Technically Sweet)
Subject: Binary representation
Date: Thu, 20 Aug 92 17:59:20 GMT
Organization: International Foundation for Internal Freedom

tmb@arolla.idiap.ch (Thomas M. Breuel) writes:

>It is also trivial to build a store interface on top of binary
>streams. One question is what the language should provide. I'd prefer
>to see it provide binary streams, not stores, since I feel that binary
>streams are more general.

The ASN.1 for binary stream representation of trees gives
most of what is needed.  It's the inter-layer encoder (sort of)
for the OSI suite, and thus has that meaningless aura of 
standards legitimacy which helps in promoting something
new as a standard.  "Look!  It builds on previous standards!"

ASN.1 represents trees according to a pre-specified tree grammar.
A simple "reference leaf" would suffice to encode arbitrary di-graphs.
I think all of the other basic types of Scheme are already
supported directly; there's a compact encoding for small numbers.

All in all, adopting an ASN.1 representation for Scheme gives
a handy binary stream format for files, persistent Scheme systems,
and network I/O.


-- 

Lance Norskog

Data is not information is not knowledge is not wisdom.
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.scheme
Subject: Re: R^4RS Authors Comments on Dylan
Date: 14 Aug 1992 08:28:12 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
NNTP-Posting-Host: gandalf.think.com

In article <9208132109.AA16509@peanut.crl.dec.com> jmiller@crl.DEC.COM writes:
>o Dylan's position on the order of argument evaluation (left-to-right
>  for arguments, but unordered with respect to the operator) seems
>  particularly strange, since it has the drawbacks of the Scheme
>  (unordered) decision without its performance advantages.

This is similar or identical to the order in Common Lisp, which is that
arguments are evaluated left-to-right, while the function may be evaluated
either before or after all of them (but not in the middle).

In the case of CL, the rationale was that the arguments should be evaluated
left-to-right for historical compatibility.  The function can be evaluated
at the end so that the implementation doesn't have to save the value away
before evaluating the arguments; since it isn't actually used until the end
of argument evaluation, it can be more efficient to evaluate it right then.

-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
Newsgroups: comp.lang.scheme
From: xltang@neumann.uwaterloo.ca (xltang)
Subject: Overloading in Scheme
Originator: xltang@neumann.uwaterloo.ca
Organization: University of Waterloo
Date: Wed, 12 Aug 1992 21:09:21 GMT

I am interested in finding out what is overloading in Scheme and how the 
resolution is done at run-time. I have not found any references describing
the area. I would like any answer to the questions or any references suggested.

Thanks.


Newsgroups: comp.lang.scheme
From: torbenm@diku.dk (Torben AEgidius Mogensen)
Newsgroups: comp.lang.scheme
Subject: Re: How to define mult function of Church Numerals by lambda calculus?
Keywords: Church Numberals/Lambda calculus
Date: 12 Aug 92 14:01:14 GMT
Organization: Department of Computer Science, U of Copenhagen

Jesse writes:

>The Church Numerals are defined:
>0'=lambda f.lambda x.x
>1'=lambda f.lambda x.f x
>2'=lambda f.lambda x.f (f x)
>......

>n'=lambda f.lambda x.f^n x

>Thus adding two Church Numerals:

>add=lambda m.lambda n.lambda f.lambda x.m f (n f x)

>m,n are Church Numerals

>My problem is: how to define mult, which multiplies two Church Numerals m,n.

mult = lambda m. lambda n. lambda f. m (n f)

pow = lambda m. lambda n . m n

where pow m n = n^m.

	Torben Mogensen (torbenm@diku.dk)
Newsgroups: comp.lang.scheme
From: Jesse
Subject: Correction of [Summary of Church Numeral]
Summary: Church Numeral
Originator: cyen@ponder.csci.unt.edu
Keywords: Church Numeral
Organization: Computer Science Dept .of UNT
Date: Sat, 15 Aug 1992 09:54:29 GMT

Days ago I said when m=zero the mult and expt functions will go wrong.
Maybe because of the evaluation order of ML , these functions cannot be
tested right.

The lambda expression of these two functions are absolutely right.

mult=\m.\n.\f.\x. m (n f) x
expt=\m.\n.\f.\x. m n f x

Besides the substraction function of two Church Numerals is:

sub=\m.\n.n pre m

whereas pre=\n.\f.\x.snd (n (prefn f) (pair x x))
        prefn=\f.\p.pair (f (fst p))(fst p)
        pair=\x.\y.\f.f x y
        fst=\p.p true
        snd=\p.p false
        true=\x.\y.x
        false=\x.\y.y

Sorry for the mistake I made in the last post, please post if you know
any interesting stuff on Church Numeral.

Jesse
From: zuken@netcom.com (Zuken)
Newsgroups: comp.lang.scheme
Subject: R5RS proposed records (query)
Keywords: R5Rs records
Date: 21 Aug 92 23:25:29 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest)

If any one has a copy of the R5Rs proposed record package could you please
mail me a copy.


					zcai@zuken.com
					or
					jos@zuken.com
From: bh@anarres.CS.Berkeley.EDU (Brian Harvey)
Newsgroups: comp.lang.scheme
Subject: Re: R^4RS Authors Comments on Dylan
Date: 14 Aug 1992 13:59:59 GMT
Organization: University of California at Berkeley
NNTP-Posting-Host: anarres.cs.berkeley.edu

jmiller@crl.DEC.COM writes:
>o Dylan's use of generic functions, derived directly from CLOS, fit
>  into the language in a particularly elegant manner.  If the Scheme
>  community does decide to adopt a modest object system, we should
>  study Dylan's subset of CLOS to make an informed choice between this
>  approach and the more traditional object-dispatch mechanism.

As a teacher, I incline toward object-dispatch.  I know that the
generic function idea makes it easier to talk about an operation
that applies to more than one object (although not easier enough,
because of the combinatorial explosion of the number of possible
types of all the operands), but I think that for a learner the
whole idea of objects (smart data) is lost.  It's only in a very
attenuated sense that Dylan has objects at all, compared to how
I've learned to think about objects.  It just has data with
manifest type.

I know that the metaphor of asking an object to do something
doesn't make any difference in terms of the ability of the
language to get work done.  But I think it does make a difference
for the person learning the language; it gives rise to a very
different mental model.

I can see arguments on the other side, and maybe it's premature to
argue when there isn't even agreement on putting any kind of object
system in Scheme.  But I want to try to get educational concerns
into the picture, so that the eventual decision isn't made entirely
in terms of what's easy to implement efficiently and so on.
From: carroll@hercules.cis.udel.edu (Mark C. Carroll)
Subject: Re: random rant on random files
Organization: University of Delaware, Newark
Date: Mon, 17 Aug 1992 18:09:04 GMT

In article <16ocv6INNl87@agate.berkeley.edu> bh@anarres.CS.Berkeley.EDU (Brian Harvey) writes:
>I don't find this "store" idea obvious at all.  Does it live in memory
>or on the disk?  If on the disk, does that mean there is a redundant
>disk-to-disk copy when I finally use store->file?  If in memory, how
>do you handle gigabyte stores?
>

I think that the point of it is to _deliberate_ fuzz the issue of
where the store is located. It doesn't matter! All that matters is the
behavior of a store when you use it - the rest is implementation
details.

Given a system like a store, what's great about it is that it can
provide read/write access to _anything_: a store can be in memory, on
a disk, a combination... it can be anything at all that behaves the
correct way, and the implementation of stores is responsible for
providing an appropriate low-level implementation.

(For an example of how well ideas like this can work, take a look at
the Modula-3 I/O streams system. It provides perfectly flexible,
general access to _anything_ that can be read or written.)

>I'm not necessarily objecting to the idea.  I just need to see more
>discussion than was posted about why this is thought preferable to
>just adding seek, binary-read, and binary-write to the port mechanism.

It's preferable because it doesn't rely on the filesystem, and it
isn't specific to disks. A store can be used to read/write a section
of memory, or a file on disk, or a screen display, or... 

	<MC>

-- 
|| Mark Craig Carroll: <MC>     || "There is no such thing as a problem 
|| Univ of Delaware, Dept of CIS||  without a gift for you in its hands. You
|| Grad Student/Labstaff Hacker ||  seek problems because you need their 
|| carroll@udel.edu             ||  gifts" - _Illusions_, by Richard Bach
Newsgroups: comp.lang.scheme
From: john@physiol.su.OZ.AU (John Mackin)
Subject: Re: random rant on random files
Organization: Department of Physiology, University of Sydney, Australia
Date: Mon, 17 Aug 1992 10:07:35 GMT

In article <9208130624.1.11214@cup.portal.com>,
	vanMeule@cup.portal.COM writes:

> I feel a little upset at Scheme for lack of direct support in 
> most Schemes for random files.

Without in any way endorsing the original poster's desire to make
Scheme into the new COBOL :):), I too was surprised and disappointed
that R4RS Scheme doesn't have a seek function to apply to ports.  I
have an application where I need to read a (large) file line-wise
backwards, and the only Scheme I can code it in at the moment is
Scheme->C where I have access to libc.  That's great, but hardly
portable.  Does anyone know whether this is being considered for
the future of Scheme?  On a more general note, is there any way
(perhaps a mailing list to subscribe to, or something) that people
in general can find out what _is_ being thought about for R5RS?

-- 
John Mackin <john@physiol.su.oz.au>
`No Franz Lisp executable file should EVER be stripped.'
	- Franz Lisp manual, VAX UNIX