Category:Arturo
(Redirected from 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 independentlydeveloped, 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 n1
else > 1
]
loop 1..19 [x]>
print ["Factorial of" x "=" factorial x]
Implementation[edit]
The main compiler is implemented in Nim/C as a Bytecode interpreter / Stackbased VM and should run in most architectures.
The main goals are: expressiveness, brevity, performance and portability. (With that exact order)
License[edit]
Arturo is released under the MIT/X11 License.
Todo[edit]
Pages in category "Arturo"
The following 200 pages are in this category, out of 779 total.
(previous page) (next page)A
 A+B
 ABC problem
 ABC words
 Abundant odd numbers
 Abundant, deficient and perfect number classifications
 Ackermann function
 Add a variable to a class instance at runtime
 Additive primes
 Address of a variable
 Align columns
 Almost prime
 Alternade words
 Amicable pairs
 Anagrams
 Anagrams/Deranged anagrams
 Angle difference between two bearings
 Anonymous recursion
 Antiprimes
 Append numbers at same position in strings
 Apply a callback to an array
 Arbitraryprecision integers (included)
 Arithmetic numbers
 Arithmeticgeometric mean
 Arithmetic/Complex
 Arithmetic/Integer
 Arithmetic/Rational
 Array concatenation
 Array length
 Arrays
 Ascending primes
 Assertions
 Associative array/Creation
 Associative array/Iteration
 Associative array/Merging
 Attractive numbers
 Averages/Arithmetic mean
 Averages/Median
 Averages/Mode
 Averages/Pythagorean means
 Averages/Root mean square
B
 Babbage problem
 Bacon cipher
 Balanced brackets
 Base 16 numbers needing a to f
 Base64 decode data
 Bell numbers
 Benford's law
 Best shuffle
 Binary digits
 Binary search
 Binary strings
 Binomial transform
 Bioinformatics/base count
 Bioinformatics/Sequence mutation
 Bioinformatics/Subsequence
 Bitwise operations
 Boolean values
 Brazilian numbers
 Brilliant numbers
 Bulls and cows
C
 Caesar cipher
 Calculating the value of e
 CalkinWilf sequence
 Call a foreignlanguage function
 Call a function
 Call a function in a shared library
 Calmo numbers
 CalmoSoft primes
 Camel case and snake case
 Cantor set
 Carmichael 3 strong pseudoprimes
 Cartesian product of two or more lists
 Casesensitivity of identifiers
 Casting out nines
 Catalan numbers
 Catalan numbers/Pascal's triangle
 Catamorphism
 Change e letters to i in words
 Changeable words
 Character codes
 Check that file exists
 Cheryl's birthday
 Chinese remainder theorem
 Cholesky decomposition
 Chowla numbers
 Circles of given radius through two points
 Circular primes
 Classes
 Closures/Value capture
 Code Golf: Code Golf
 Collect and sort square numbers in ascending order from three lists
 Collections
 Combinations
 Combinations and permutations
 Combinations with repetitions
 Comma quibbling
 Commandline arguments
 Comments
 Common list elements
 Common sorted list
 Compare a list of strings
 Compare length of two strings
 Compiletime calculation
 Composite numbers k with no single digit factors whose factors are all substrings of k
 Compound data type
 Concatenate two primes is also prime
 Conditional structures
 Conjugate a Latin verb
 Continued fraction
 Convert seconds to compound duration
 Convex hull
 Coprime triplets
 Coprimes
 Copy a string
 Count how many vowels and consonants occur in a string
 Count in factors
 Count in octal
 Count occurrences of a substring
 Count the coins
 Cousin primes
 CRC32
 Create a file
 Create a file on magnetic tape
 Create a twodimensional array at runtime
 Create an HTML table
 CSV data manipulation
 CSV to HTML translation
 Cuban primes
 Cubic special primes
 Cullen and Woodall numbers
 Cumulative standard deviation
 Currying
 Curzon numbers
 CUSIP
 Cyclops numbers
D
 Damm algorithm
 Date format
 Date manipulation
 Day of the week
 Days between dates
 Deceptive numbers
 Deepcopy
 Delete a file
 Deming's funnel
 Department numbers
 Descending primes
 Detect division by zero
 Determinant and permanent
 Determine if a string has all the same characters
 Determine if a string has all unique characters
 Determine if a string is collapsible
 Determine if a string is numeric
 Digit fifth powers
 Digital root
 Dijkstra's algorithm
 Disarium numbers
 Display a linear combination
 Distinct power numbers
 Distribution of 0 digits in factorial series
 Documentation
 Dot product
 Double Twin Primes
 Draw a cuboid
 Duffinian numbers
 Dynamic variable names
E
 Egyptian division
 Emirp primes
 Empty directory
 Empty program
 Empty string
 Entropy
 Enumerations
 Environment variables
 Equilibrium index
 ErdősNicolas numbers
 Erdősprimes
 Esthetic numbers
 Ethiopian multiplication
 Euler method
 Euler's sum of powers conjecture
 Evaluate binomial coefficients
 Even or odd
 Evolutionary algorithm
 Execute a system command
 Execute Brain****
 Execute HQ9+
 Exponentiation operator
 Exponentiation order
 Extend your language
 Extra primes
Categories:
 Pages with syntax highlighting errors
 Execution method/Interpreted
 Garbage collection/Yes
 Typing/Strong
 Typing/Expression/Implicit
 Typing/Checking/Dynamic
 Programming Languages
 Programming paradigm/Concatenative
 Programming paradigm/Declarative
 Programming paradigm/Dynamic
 Programming paradigm/Functional
 Programming paradigm/Imperative
 Programming paradigm/Reflective