Category:Seed7: Difference between revisions
Content added Content deleted
m (Changed over to language header) |
(Add link to GitHub) |
||
| (9 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{language|Seed7 |
|||
| ⚫ | {{language| |
||
| ⚫ | |||
|checking=static |
|||
|strength=strong |
|||
|exec=both |
|||
|parampass=both |
|||
|LCT=yes}} |
|||
| ⚫ | {{language programming paradigm|object-oriented}}'''Seed7''' is a general-purpose programming language designed by Thomas Mertes. It is a higher level language compared to [[Ada]], [[C]] / [[C++]] and [[Java]]. The Seed7 interpreter, and the example programs are [[Open source|open-source]] software. An open-source Seed7 [[compiler]] is also available. |
||
In Seed7 new statements and operators can be declared easily. Functions with type results and type parameters are more elegant than the usual template or generics concept. [[Object-oriented_programming|Object orientation]] is used when it brings advantages and not in places when other solutions are more obvious. Although Seed7 contains several concepts of other programming languages it cannot be seen as direct descendant of another programming language. |
In Seed7 new statements and operators can be declared easily. Functions with type results and type parameters are more elegant than the usual template or generics concept. [[Object-oriented_programming|Object orientation]] is used when it brings advantages and not in places when other solutions are more obvious. Although Seed7 contains several concepts of other programming languages it cannot be seen as direct descendant of another programming language. |
||
== |
==See also== |
||
* [[wp:Seed7|Seed7 on Wikipedia]] |
|||
| ⚫ | |||
* [http://seed7.sourceforge.net/ Seed7 Homepage] |
|||
* [https://github.com/ThomasMertes/seed7 Seed7 at GitHub] |
|||
* [https://sourceforge.net/projects/seed7/files Download Seed7] |
|||
Latest revision as of 19:44, 26 November 2020
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Interpreted or compiled |
|---|---|
| Parameter passing methods: | By reference, By value |
| Type strength: | Strong |
| Type checking: | Static |
| See Also: |
Seed7 is a general-purpose programming language designed by Thomas Mertes. It is a higher level language compared to Ada, C / C++ and Java. The Seed7 interpreter, and the example programs are open-source software. An open-source Seed7 compiler is also available.
In Seed7 new statements and operators can be declared easily. Functions with type results and type parameters are more elegant than the usual template or generics concept. Object orientation is used when it brings advantages and not in places when other solutions are more obvious. Although Seed7 contains several concepts of other programming languages it cannot be seen as direct descendant of another programming language.
See also
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Seed7 Implementations (empty)
- Seed7 User (5 P)
Pages in category "Seed7"
The following 200 pages are in this category, out of 475 total.
(previous page) (next page)2
A
- A+B
- ABC problem
- Abstract type
- Abundant, deficient and perfect number classifications
- Ackermann function
- Additive primes
- Air mass
- AKS test for primes
- Align columns
- Almost prime
- Amb
- Anadromes
- Anagrams
- Angle difference between two bearings
- Anonymous recursion
- Anti-primes
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arithmetic-geometric mean
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Associative array/Creation
- Associative array/Iteration
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
B
- Babbage problem
- Balanced brackets
- Base58Check encoding
- Base64 decode data
- Base64 encode data
- Bernoulli numbers
- Best shuffle
- Binary digits
- Binary search
- Binary strings
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap
- Bitmap/Read a PPM file
- Bitmap/Write a PPM file
- Bitwise IO
- Bitwise operations
- Boolean values
- Box the compass
- Brace expansion
- Brownian tree
- Bulls and cows
- Burrows–Wheeler transform
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calendar - for "REAL" programmers
- Call a function
- Carmichael 3 strong pseudoprimes
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Character codes
- Check Machin-like formulas
- Check that file exists
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Circles of given radius through two points
- Closest-pair problem
- Collections
- Combinations
- Comma quibbling
- Command-line arguments
- Comments
- Compare a list of strings
- Compile-time calculation
- Compound data type
- Conditional structures
- Convert decimal number to rational
- Copy a string
- Copy stdin to stdout
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- CRC-32
- Create a file
- Create a file on magnetic tape
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- CSV to HTML translation
D
E
- Echo server
- Empty directory
- Empty program
- Empty string
- Enforced immutability
- Entropy
- Enumerations
- Environment variables
- Equilibrium index
- Ethiopian multiplication
- Euler's sum of powers conjecture
- Evaluate binomial coefficients
- Even or odd
- Evolutionary algorithm
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Execute a system command
- Execute Brain****
- Execute HQ9+
- Execute SNUSP
- Exponentiation operator
- Exponentiation order
- Extend your language
- Extensible prime generator
- Extreme floating point values
F
- Factorial
- Factors of a Mersenne number
- Factors of an integer
- FASTA format
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- File input/output
- File modification time
- File size
- Filter
- Find common directory path
- Find first and last set bit of a long integer
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find the last Sunday of each month
- Find the missing permutation
- Find words with alternating vowels and consonants
- Five weekends
- FizzBuzz
- Floyd's triangle
- Formatted numeric output
- Forward difference
- Fractal tree
- Fractran
- FTP
- Function definition
G
- Gamma function
- Generate Chess960 starting position
- Generate lower case ASCII alphabet
- Generic swap
- Globally replace text in several files
- Gray code
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Greyscale bars/Display
- Guess the number
- Guess the number/With feedback
- Guess the number/With feedback (player)
H
- Hailstone sequence
- Hamming numbers
- Happy numbers
- Harshad or Niven series
- Hash from two arrays
- Haversine formula
- Hello world/Graphical
- Hello world/Line printer
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Hello world/Web server
- Hickerson series of almost integers
- Hilbert curve
- Hofstadter Q sequence
- Holidays related to Easter
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection