Category:Arturo
Arturo
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using Arturo.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Execution method: | Interpreted |
---|---|
Garbage collected: | Yes |
Type strength: | Strong |
Type expression: | Implicit |
Type checking: | Dynamic |
Lang tag(s): | arturo |
See Also: |
|
Arturo is an independently-developed, modern programming language, vaguely related to various other ones - including but not limited to Logo, Rebol, Forth, Ruby, Haskell, D, SmallTalk, Tcl and Lisp.
The language has been designed following some very simple and straightforward principles:
- Code is just a list of words and symbols
- Words and symbols within a block are interpreted - when needed - according to the context
- No reserved words or keywords - look for them as hard as you can; there are absolutely none
factorial: function [n][
if? n > 0 -> n * factorial n-1
else -> 1
]
loop 1..19 [x]->
print ["Factorial of" x "=" factorial x]
Implementation
The main compiler is implemented in Nim/C as a Bytecode interpreter / Stack-based VM and should run in most architectures.
The main goals are: expressiveness, brevity, performance and portability. (With that exact order)
License
Arturo is released under the MIT/X11 License.
Todo
Pages in category "Arturo"
The following 200 pages are in this category, out of 779 total.
(previous page) (next page)M
- Magic 8-ball
- Magic constant
- Magic squares of odd order
- Make directory path
- Mandelbrot set
- Map range
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Maximum triangle path sum
- Mayan numerals
- McNuggets problem
- MD5
- Meissel–Mertens constant
- Memory allocation
- Menu
- Mersenne primes
- Mertens function
- Metaprogramming
- Metronome
- Mian-Chowla sequence
- Middle three digits
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum primes
- Modular exponentiation
- Modular inverse
- Modulinos
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Mosaic matrix
- Motzkin numbers
- Move-to-front algorithm
- Multifactorial
- Multiplication tables
- Multisplit
- Munchausen numbers
- Mutual recursion
- Möbius function
N
- N'th
- N-grams
- N-queens problem
- Named parameters
- Naming conventions
- Narcissist
- Narcissistic decimal number
- Native shebang
- Neighbour primes
- Nested function
- Next highest int from digits
- Next special primes
- Nice primes
- Nim game
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nth root
- Null object
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers which are the cube roots of the product of their proper divisors
- Numbers whose binary and ternary digit sums are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
O
- O'Halloran numbers
- Odd and square numbers
- Odd squarefree semiprimes
- Odd words
- One of n lines in a file
- One-dimensional cellular automata
- Operator precedence
- Optional parameters
- Order by pair comparisons
- Order disjoint list items
- Order two numerical lists
- Ordered words
- Ormiston pairs
- Own digits power sum
P
- Palindrome detection
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Pangram checker
- Parameterized SQL statement
- Parse command-line arguments
- Pascal's triangle
- Password generator
- Pell's equation
- Penta-power prime seeds
- Perfect numbers
- Perfect shuffle
- Perfect totient numbers
- Perlin noise
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Permutations/Derangements
- Permuted multiples
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Piprimes
- Playing cards
- Polymorphism
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Power set
- Practical numbers
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primes: n*2^m+1
- Primorial numbers
- Priority queue
- Probabilistic choice
- Problem of Apollonius
- Product of divisors
- Product of min and max prime factors
- Program termination
- Proper divisors
- Pseudo-random numbers/Middle-square method
- Pythagorean triples
R
- Rainbow
- Random Latin squares
- Random number generator (included)
- Random numbers
- Range expansion
- Range extraction
- Rate counter
- Read a configuration file
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Recaman's sequence
- Regular expressions
- Remove duplicate elements
- Remove lines from a file
- Remove vowels from a string
- Rename a file
- Rep-string
- Repeat
- Repeat a string
- Repunit primes
- Return multiple values
- Reverse a string
- Reverse the gender of a string
- Reverse words in a string
- Rhonda numbers
- Riordan numbers
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a function
- Roots of unity
- Rot-13
- RPG attributes generator
- Run-length encoding
- Runtime evaluation
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- S-expressions
- Safe and Sophie Germain primes
- Safe primes and unsafe primes
- Sattolo cycle
- Search a list
- Search a list of records
- SEDOLs
- Selectively replace multiple instances of a character within a string
- Self-describing numbers
- Semiprime
- Semordnilap
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence of primorial primes
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set
- Set right-adjacent bits