Category:Modula-2: Difference between revisions
Content added Content deleted
(added a brief description of the language) |
(added a link to lists of compilers and books) |
||
| Line 1: | Line 1: | ||
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. Modula-2 is a strongly typed language of the Pascal family and it predecessors are Mesa and Pascal. In Modula-2, Wirth had addressed most of the criticisms of Pascal. The most important concepts introduced were modularity and information hiding but also concurrent programming. |
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. Modula-2 is a strongly typed language of the Pascal family and it predecessors are Mesa and Pascal. In Modula-2, Wirth had addressed most of the criticisms of Pascal. The most important concepts introduced were modularity and information hiding but also concurrent programming. |
||
{{language|Modula-2|Compilers=http://www.modula2.net/resources/compilers.shtml}} |
|||
{{language|Modula-2|Books=http://www.modula2.net/resources/books.shtml}} |
|||
{{language|Modula-2|bnf=http://cui.unige.ch/db-research/Enseignement/analyseinfo/Modula2/BNFindex.html}} |
{{language|Modula-2|bnf=http://cui.unige.ch/db-research/Enseignement/analyseinfo/Modula2/BNFindex.html}} |
||
Revision as of 16:44, 17 February 2010
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. Modula-2 is a strongly typed language of the Pascal family and it predecessors are Mesa and Pascal. In Modula-2, Wirth had addressed most of the criticisms of Pascal. The most important concepts introduced were modularity and information hiding but also concurrent programming.
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|---|
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Modula-2 Implementations (1 P)
- Modula-2 User (17 P)
Pages in category "Modula-2"
The following 200 pages are in this category, out of 237 total.
(previous page) (next page)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 numbers
- 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
- Palindrome detection
- Pangram checker
- Parallel brute force
- Parse EBNF
- Pascal's triangle
- Perfect numbers
- Perfect shuffle
- Perfect totient numbers
- Permutations
- Pernicious numbers
- Polynomial regression
- Primality by trial division
- Primality by Wilson's theorem
- Prime decomposition
- Product of min and max prime factors
- Proper divisors
- Pythagorean quadruples
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
- Show ASCII table
- Sieve of Eratosthenes
- Singly-linked list/Element definition
- Smallest square that begins with n
- Smith numbers
- Snake and ladder