This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Lang tag(s): | modula2 |
|---|---|
| See Also: |
If you know Modula-2, please write code for some of the tasks not implemented in Modula-2.
Modula-2 was designed by Niklaus Wirth at ETH Zurich as a systems implementation language for the operating system of the Lilith workstation, a project inspired by the Alto which Wirth had used during his sabbatical year at Xerox PARC in 1976. Modula-2 is a strongly typed language of the Pascal family and its predecessors are Mesa and Pascal. In Modula-2, Wirth had addressed most of the criticisms against Pascal. The most important concepts introduced were modularity and information hiding but also system access and concurrent programming. There are two main variants of Modula-2, the language described in Wirth's book "Programming in Modula-2" also known as PIM or classical Modula-2 and the revised and extended version produced by the ISO standards committee, known as ISO Modula-2.
Contents
Modula-2 FAQ[edit]
Modula-2 Compilers[edit]
Modula-2 Books & Tutorials[edit]
List of Modula-2 Books & Tutorials and
Modula-2 Grammars[edit]
Modula-2 Open Source Projects[edit]
Modula-2 on IRC[edit]
Subcategories
This category has the following 3 subcategories, out of 3 total.
Pages in category "Modula-2"
The following 210 pages are in this category, out of 210 total.
2
A
- A+B
- ABC words
- Abundant, deficient and perfect number classifications
- Ackermann function
- Additive primes
- Address of a variable
- Almost prime
- Angle difference between two bearings
- Anti-primes
- Arithmetic-geometric mean
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Arrays
- Attractive numbers
- Averages/Arithmetic mean
- Averages/Pythagorean means
B
C
- Caesar cipher
- Calculating the value of e
- Call a foreign-language function
- Cantor set
- Card shuffles
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Catamorphism
- Character codes
- Chinese remainder theorem
- Chinese zodiac
- Circles of given radius through two points
- Combinations
- Command-line arguments
- Comments
- Compound data type
- Conditional structures
- Continued fraction/Arithmetic/Construct from rational number
- Convex hull
- Count how many vowels and consonants occur in a string
- Count in octal
- Create an HTML table
- CUSIP
- Cycle detection
D
E
F
- Factorial
- Faulhaber's formula
- Feigenbaum constant calculation
- Fibonacci sequence
- Find limit of recursion
- Find prime n such that reversed n is also prime
- Find squares n where n+1 is prime
- Find the intersection of a line with a plane
- Find the intersection of two lines
- Find words which contains all the vowels
- Fivenum
- FizzBuzz
- Floyd's triangle
- Floyd-Warshall algorithm
- Function definition
G
H
I
L
- Largest proper divisor of n
- Leap year
- Least common multiple
- Leonardo numbers
- Levenshtein distance
- Logical operations
- Long year
- Longest common prefix
- Longest common substring
- Longest substrings without repeating characters
- Look-and-say sequence
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Infinite
- Loops/While
M
N
P
Q
R
S
- Sailors, coconuts and a monkey problem
- Sattolo cycle
- Self-describing numbers
- Sequence: smallest number with exactly n divisors
- Shoelace formula for polygonal area
- Short-circuit evaluation
- Sieve of Eratosthenes
- Singly-linked list/Element definition
- Smith numbers
- Snake and Ladder
- Sort three variables
- Sorting algorithms/Bubble sort
- Sorting algorithms/Merge sort
- Sorting algorithms/Quicksort
- Special Divisors
- Split a character string based on change of character
- Square but not cube
- Stern-Brocot sequence
- Strange numbers
- Subleq
- Subset sum problem
- Sum digits of an integer
- Sum of a series
- Sum to 100
- System time
