Niklaus Wirth. Programming in Modula 2. Springer Verlag, 1983. This article was processed using the L a T E X macro package with LLNCS style  Home/Search   Document Not in Database   Summary   Related Articles   Check

....thread. A viewer displaying the corresponding trap information is opened at a later point in time, when the Oberon thread finally processes the queued OberonAction. 5. 4 Stack Management and Garbage Collection Module Kernel was extended to provide a set of primitives supporting simple coroutines [Wir83], thus providing the basic mechanism for implementing concurrency in the system. Module Threads uses these primitives to implement the desired scheduling policy. TYPE Stack = POINTER TO StackDesc; StackDesc = RECORD status: SHORTINT; inSVC: BOOLEAN; END; PROCEDURE NewStack (VAR stack: Stack; wsp: ....

Niklaus Wirth. Programming in Modula 2. Springer Verlag, 1983. This article was processed using the L a T E X macro package with LLNCS style

....A fourth communication mechanism is provided by persistent variables in sequential composition of action systems. We end this treatment with a short discussion on how to extend an existing modular programming language to provide the features that we have defined here. We choose the Oberon language [23] for this purpose, as it is a very simple language, has certain basic design decisions that are very close to what we need, and does not have any explicit facilities for parallelism. We describe the modularization facilities as a sequence of syntactic and semantic extensions of a simple base ....

N. Wirth. The programming language Oberon. Software - Practice and Experience, 18(7), 1988. This article was processed using the L a T E X macro package with LLNCS style

....usefulness of the linear algorithm given in this paper can be seen from the following fact due to Thorup [15] Fact 1 Control flow graphs for structured programs have ( 6) treewidth, e.g. Goto free Algol [12] and Pascal [16] programs have ( 3) treewidth control flow graphs. All Modula 2 [17] programs have ( 5) treewidth control flow graphs. Goto free C [10] programs have ( 6) treewidth control flow graphs. Without short circuit evaluation, each of the above treewidths drops by one. In the following we give the definition of treewidth and describe previous work with bounded ....

N. Wirth. Programming in modula-2(3rd corr.ed). Springer--verlag, Berlin, New York, 1985. This article was processed using the L A T E X macro package with LLNCS style

....to identify the culprit. 5 Implementation Issues There are several important issues of implementation which require some consideration. Firstly, the format of the assertions themselves must be determined. We currently propose a syntax of the form given in Figure 1, which has the EBNF (leaning on [13]) ProcedureDeclaration PROCEDURE ident [FormalParameters] PreCondition] PreCondition PRE expression: In effect, the identifier PRE is treated as a reserved word. http: www pu.uni tuebingen.de users klaeren jmlc97.ps.gz 8 PROCEDURE ident FormalParameters ; PreConditions ....

....Obviously, in a language like Modula 2 where we have procedures as datatypes and therefore assignable procedure variables, the scenario described so far cannot completely satisfy. Introducing pre and postconditions to procedure types poses two interesting problems: 1. The FormalTypeList [13] used in the declaration of procedure types doesn t assign names to formal parameters but only types. However, the most natural way to express any assertions for procedure types is to use formal parameter names. Having both procedures with and without assertions means that we have to allow a ....

Niklaus Wirth. Programming in Modula-2. Springer, 3rd edition, 1985. This article was processed using the L A T E X macro package with the LLNCS document class. Version of December 19,

....static and dynamic semantics are given in a denotational style. 1 Introduction In languages such as Pascal and Modula 2, program variables are declared to be of a certain type and may then be assigned only values that belong strictly to that type. In the latest of this family of languages, Oberon [RW92, Wir88b] and Oberon 2 [MW91] this restriction has been relaxed for record and pointer types to achieve inheritance. The same approach to the development of an objectoriented Ada9X is suggested in [Sei91] Type extension [Wir88a] is the creation of new record types from existing record types by the ....

N. Wirth. The programming language Oberon. Software Practice and Experience, July 1988. This article was processed using the L a T E X macro package with LLNCS style

No context found.

N. Wirth. Algorithms & Data Structures. Prentice-Hall, 1975. This article was processed using the L A T E X macro package with LLNCS style

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC