🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Thread View: comp.specification
3 messages
3 total messages Started by YUKQC Thu, 07 Mar 1991 04:30
"higher-order" spec\
#340
Author: YUKQC
Date: Thu, 07 Mar 1991 04:30
29 lines
1485 bytes
I am looking for articles that contain
concrete examples of formal specification in "higher-order
formalisms". By "higher-order formalisms", I intend any formal calculus
about higher-order objects of any sort, say, higher-order predicate
calculus, Church's Simple Theory of Types, higher-order type theories,
set theories, etc.

More specifically, what I am really interested in is an article that

(1) illustrates the use of a higher-order formalism by concrete examples
    of specification; or
(2) advances some arguments about the advantages/disadvantages of higher-order
    formalisms in formal specification from various viewpoints, e.g.,
    expressive power, ease of composing specification,
    understandability, integration with program verification/synthesis
    systems, etc.

Of course, I'd be happy to hear your opinion as to whether
"higher-orderedness" is really good or bad, even if you've never published
it! I'll post a summary of replies if I get more than a couple.


Thanks in advance.

Keitaro Yukawa
Dept. of Computer Science
Queens College
City University of New York
Re: "higher-order" spec
#348
Author: Kees Goossens
Date: Tue, 12 Mar 1991 16:38
45 lines
2049 bytes
In article <91065.233041YUKQC@CUNYVM.BITNET> YUKQC@CUNYVM.BITNET writes:
>
>I am looking for articles that contain
>concrete examples of formal specification in "higher-order
>formalisms". By "higher-order formalisms", I intend any formal calculus
>about higher-order objects of any sort, say, higher-order predicate
>calculus, Church's Simple Theory of Types, higher-order type theories,
>set theories, etc.
>
> ...

Hardware verification uses a lot of higher order logic (classical,
constructive, partial terms, polymorphic etc), type theory etc.
There are masses of articles on this topic. The classic is:

@InProceedings(Gordon85a,
	Copy=Y,
	Author="Mike Gordon",
	Title="Why Higher-Order Logic is a Good Formalisation for
	Specifying and Verifying Hardware",
	BookTitle=formasp,
	Editor="G Milne and P A Subrahmanyam",
	Publisher=nh,
	Address="Amsterdam",
	Pages="153--177",
	Year="1985")

A recent one is:

@InProceedings{Joyce91a,
  author = 	"Jeffrey J Joyce",
  title = 	"More Reasons Why Higher-Order Logic is a Good Formalism
		 for Specifying and Verifying Hardware",
  booktitle = 	miami,
  year = 	"1991",
  organization = 	"{ACM} {IFIP WG} 10.2",
  month = 	"January",
}

Kees
--
Kees Goossens                       Keep in Touch with the Dutch:
LFCS, Dept. of Computer Science     JANET: kgg@uk.ac.ed.lfcs
University of Edinburgh, Scotland   UUCP:  ..!mcsun!ukc!lfcs!kgg
Wiskunde is bouwen in de geest.	--- Luitzen Egbertus Jan Brouwer.
Re: "higher-order" spec
#357
Author: Sara Kalvala
Date: Wed, 20 Mar 1991 10:06
40 lines
2098 bytes
In article <7610@skye.cs.ed.ac.uk>, kgg@cs.ed.ac.uk (Kees Goossens) writes:
|> In article <91065.233041YUKQC@CUNYVM.BITNET> YUKQC@CUNYVM.BITNET writes:
|> >
|> >I am looking for articles that contain
|> >concrete examples of formal specification in "higher-order
|> >formalisms". By "higher-order formalisms", I intend any formal calculus
|> >about higher-order objects of any sort, say, higher-order predicate
|> >calculus, Church's Simple Theory of Types, higher-order type theories,
|> >set theories, etc.
|> >
|> > ...
|> 
|> Hardware verification uses a lot of higher order logic (classical,
|> constructive, partial terms, polymorphic etc), type theory etc.
|> There are masses of articles on this topic. The classic is:


More examples of the use of HOL (Higher Order Logic) for specification are
included in the documentation for the HOL system, which contains in the
tutorial section:

	- A sliding window protocol, by Rachel Cardell-Oliver.
	- A simple microprocessor system, Jeff Joyce.
	- Modular arithmetic, by Elsa Gunther.

The documentation is being prepared by SRI Cambridge and DSTO Australia.
LaTeX sources (as well as the sources for the HOL system) are available by
contacting me; the final printed version will be available in a few months
from SRI Cambridge. I don't believe the tutorial section is going to be
changed much.


						- Sara Kalvala
						sk@cl.cam.ac.uk

						University of Cambridge
						Computer Laboratory
						New Museums Site
						Pembroke Street
						Cambridge CB2 3QG, ENGLAND
Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads