Related articles |
---|
The quest for the optimal calling convention; a model for specifying m jsykari@gamma.hut.fi (Antti Sykari) (2003-01-12) |
Re: The quest for the optimal calling convention; a model for specif fjh@cs.mu.OZ.AU (2003-01-17) |
Re: The quest for the optimal calling convention; a model for specifyi jsykari@kosh.hut.fi (Antti Sykari) (2003-01-25) |
Re: The quest for the optimal calling convention; a model for specifyi strohm@airmail.net (John R. Strohm) (2003-01-26) |
Re: The quest for the optimal calling convention; a model for specifyi rodney.bates@wichita.edu (Rodney M. Bates) (2003-01-27) |
Re: The quest for the optimal calling convention; a model for specif strohm@airmail.net (John R. Strohm) (2003-01-29) |
Re: The quest for the optimal calling convention; a model for spe jvorbrueggen@mediasec.de (Jan C.=?iso-8859-1?Q?Vorbr=FCggen?=) (2003-02-05) |
Re: The quest for the optimal calling convention; a model for spe rodney.bates@wichita.edu (Rodney M. Bates) (2003-02-05) |
From: | Jan C.=?iso-8859-1?Q?Vorbr=FCggen?= <jvorbrueggen@mediasec.de> |
Newsgroups: | comp.compilers |
Date: | 5 Feb 2003 23:54:21 -0500 |
Organization: | MediaSec Technologies GmbH |
References: | 03-01-065 03-01-070 03-01-126 03-01-164 03-01-169 03-01-172 |
Keywords: | design |
Posted-Date: | 05 Feb 2003 23:54:21 EST |
> The Gypsy language at UT Austin in the late 1970s (Ambler, Good, et
> al) was designed specifically to be formally verifiable. They did it
> the easy way, and outlawed aliasing and non-local references
> altogether. Every variable was local to some task, and tasks could
> only send messages through message buffers (FIFO queues protected by
> semaphores). The message buffers were built-in to the language, with
> semantics carefully defined.
Sounds very much like occam, then.
Jan
Return to the
comp.compilers page.
Search the
comp.compilers archives again.