Category:Oforth
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Garbage collected: | Yes |
|---|---|
| See Also: |
|
Oforth is for Object + Forth : while based on Forth philosophy (data stack, one pass compilation, ...), it implements a full object metamodel.
Features include :
- Dynamic language (which does not mean a slow language).
- Oforth comes with an interpreter : you can try things interactively.
- Object metamodel : everything is an object.
- Automatic garbage collection.
- Support of functional programming style and closures using blocks.
- While mutability is allowed, immutability is the default behavior, and sometimes required.
- Support of parallelism using ligth-weight tasks and communication using channels.
- Very concise language : "the more code you write, the more bugs you have"
Pages in category "Oforth"
The following 200 pages are in this category, out of 308 total.
(previous page) (next page)2
A
- A+B
- ABC problem
- Abstract type
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Address of a variable
- AKS test for primes
- Align columns
- Aliquot sequence classifications
- Almost prime
- Amicable pairs
- Anagrams
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Arena storage pool
- Arithmetic-geometric mean
- Arithmetic/Complex
- Arithmetic/Integer
- Array concatenation
- Array length
- Arrays
- Assertions
- Averages/Arithmetic mean
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
C
- Caesar cipher
- Call a function
- Call an object method
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Character codes
- Checkpoint synchronization
- Circles of given radius through two points
- Classes
- Closures/Value capture
- Collections
- Comma quibbling
- Command-line arguments
- Comments
- Compare a list of strings
- Compile-time calculation
- Compound data type
- Concurrent computing
- Conditional structures
- Copy a string
- Count occurrences of a substring
- Cumulative standard deviation
- Currying
D
E
- Emirp primes
- Empty program
- Empty string
- Enforced immutability
- Entropy
- Enumerations
- Environment variables
- Equilibrium index
- Ethiopian multiplication
- Euler method
- Euler's sum of powers conjecture
- Evaluate binomial coefficients
- Even or odd
- Events
- Evolutionary algorithm
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Execute a system command
- Exponentiation operator
- Extract file extension
- Extreme floating point values
F
- Factorial
- Factors of an integer
- Fibonacci sequence
- Fibonacci word
- File input/output
- File modification time
- File size
- Filter
- Find limit of recursion
- Find the last Sunday of each month
- First-class functions
- First-class functions/Use numbers analogously
- Five weekends
- FizzBuzz
- Flatten a list
- Flow-control structures
- Forward difference
- Function composition
- Function definition
- Function prototype
G
H
- Hailstone sequence
- Happy numbers
- Harshad or Niven series
- Haversine formula
- Hello world/Line printer
- Hello world/Newbie
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Higher-order functions
- Hofstadter Figure-Figure sequences
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
I
K
L
- Largest int from concatenated ints
- Last Friday of each month
- Leap year
- Least common multiple
- Left factorials
- Linear congruential generator
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long multiplication
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/N plus one half
- Loops/While
- Ludic numbers
- Luhn test of credit card numbers