Re: LSL boolean combinations involving undefined terms

• Subject: Re: LSL boolean combinations involving undefined terms
• From: leavens@cs.iastate.edu (Gary Leavens)
• Date: 21 Jul 95 14:23:05 GMT
• Keywords: undefined, lazy evaluation
• Newsgroups: comp.specification.larch
• Organization: Iowa State University, Ames, Iowa
• References: <leavens.805997000@bambam.cs.iastate.edu> <leavens.806079418@bambam.cs.iastate.edu> <3uiv5j$n60@newsflash.concordia.ca> <leavens.806271471@ren.cs.iastate.edu>

leavens@cs.iastate.edu (Gary Leavens) writes:

>I think Jim and Patrice, and also Kiyotaka Kuroda at CMU,
>who sent me email about this.  Kiyotaka Kuroda also went to
>the trouble of doing the proof in LP, which bears out the
>assertions of Jim and Patrice.

That should be, "I thank ..."  (:-).

	Gary

--
	229 Atanasoff Hall, Department of Computer Science
	Iowa State Univ., Ames, Iowa 50011-1040 USA / leavens@cs.iastate.edu
	phone: (515)294-1580 fax: (515)294-0258 ftp site: ftp.cs.iastate.edu
	URL: http://www.cs.iastate.edu/~leavens/homepage.html

• LSL boolean combinations involving undefined terms
• From: leavens@cs.iastate.edu (Gary Leavens)
• Re: LSL boolean combinations involving undefined terms
• From: leavens@cs.iastate.edu (Gary Leavens)
• Re: LSL boolean combinations involving undefined terms
• From: chalin@cs.concordia.ca (CHALIN patrice)
• Re: LSL boolean combinations involving undefined terms
• From: leavens@cs.iastate.edu (Gary Leavens)

• Prev: Re: LSL boolean combinations involving undefined terms
• Next: Re: LSL boolean combinations involving undefined terms
• Index: Larch archive index