Open AccessBook
Programming in Modula-2
Niklaus Wirth
- 01 Jan 1982
714
TL;DR: It is shown here how different types of computations, based on the number of parameters, can be implemented or modified according to the needs of a particular application.
read more
Abstract: ion 10,83 ADDRESS 126 166 analytic verification 8 assignment compatible 155 backtracking 61 binary search 38 bound type 76 151 buffering 85 130 case label 73 149 chain 77 class of computations 8 compatible 65 148 compilation unit 84 144 168 component type 149 computer 8 constant declaration 35 control variable 36 158 cross reference generator 90 data type 27 debugging 8 defmition module 85 168 deletion 78 dereferencing operator 76 device process 167 discriminator 73 DrawCircle 118 EBNF 12 99 empirical testing 8 environment 83 evaluation 17 export list 97 163 Extended Backus Naur-Formalism 12 factor 18 Files 110 actual parameter 51 algorithm 7 ASCII character set 32 187 assignment 17 155 basetype 67 68 148 bitmap 69 Buffer 85 busy waiting 130 case statement 74 157 CHR 33 162 comment 16 145 compilation 8 compiler 8 computation 7 Concurrent Pascal 128 control character 34 coroutine 132 167 cursor 119 123 de Morgan's law 31 declaration 11 defmition part 84 delimiter 15 145 designator 36 152 device register 136 Draw 120 dynamic allocation 76 EBNFScanner 99 101 enumeration 66 148 EOL 34 EXCL 69 162 expression 17 152 field identifier 70 149 FileSystem 112
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The BUGS project: Evolution, critique and future directions
TL;DR: A balanced critical appraisal of the BUGS software is provided, highlighting how various ideas have led to unprecedented flexibility while at the same time producing negative side effects.
On understanding types, data abstraction, and polymorphism
Luca Cardelli,Peter Wegner +1 more
TL;DR: A λ-calculus-based model for type systems that allows us to explore the interaction among the concepts of type, data abstraction, and polymorphism in a simple setting, unencumbered by complexities of production programming languages is developed.
Testing equivalences for processes
R De Nicola,Matthew Hennessy +1 more
TL;DR: This work shows how to define in a natural way three different equivalences on processes that are applied to a particular language CCS and gives associated complete proof systems and fully abstract models.
1.3K
Why functional programming matters
TL;DR: In this article, the authors show that higher-order functions and lazy evaluation of functional languages can contribute significantly to modularity and that modularity is the key to successful software development.
The past, present and future of cyber-physical systems: a focus on models.
TL;DR: Two projects show that deterministic CPS models with faithful physical realizations are possible and practical and shows that the timing precision of synchronous digital logic can be practically made available at the software level of abstraction.
620