Modula-3 Prime Checker - Modula3 Typing CST Test
Loading…
Modula-3 Prime Checker — Modula3 Code
Checks if numbers are prime.
MODULE PrimeCheck;
IMPORT IO;
VAR nums: ARRAY [0..2] OF INTEGER := [7,10,13];
VAR n, i: INTEGER;
VAR isPrime: BOOLEAN;
BEGIN
FOR n IN nums DO
isPrime := TRUE;
FOR i := 2 TO n-1 DO
IF n MOD i = 0 THEN isPrime := FALSE END;
END;
IO.PutInt(n,0);
IF isPrime THEN IO.PutLn(" is Prime") ELSE IO.PutLn(" is Not Prime") END;
END;
END PrimeCheck.Modula3 Language Guide
Modula-3 is a high-level, statically typed programming language designed for safe systems programming, modularity, and object-oriented programming. It emphasizes simplicity, safety, and readability while providing features suitable for building large, robust software systems.
Primary Use Cases
- ▸Safe systems programming
- ▸Concurrent applications
- ▸Compiler development
- ▸Networked and distributed systems
- ▸Educational projects on modular programming
Notable Features
- ▸Strong static typing with safety guarantees
- ▸Module system for large-scale software organization
- ▸Garbage collection for memory safety
- ▸Exception handling and concurrency primitives
- ▸Support for objects, generics, and interfaces
Origin & Creator
Modula-3 was developed in the late 1980s by the DEC Systems Research Center and Olivetti Research Center, building on ideas from Modula-2 and Pascal, with contributions from several academic and industry researchers.
Industrial Note
Modula-3 is used primarily in academic research, legacy systems, and projects requiring safe and concurrent programming in a modular architecture.