Category:Sidef: Difference between revisions
Content deleted Content added
mNo edit summary |
m added site and modified the description |
||
Line 1: | Line 1: | ||
{{language |
{{language |
||
|exec= |
|exec=interpreted |
||
|strength=weak |
|strength=weak |
||
|express=implicit |
|express=implicit |
||
Line 6: | Line 6: | ||
|parampass=reference |
|parampass=reference |
||
|gc=yes |
|gc=yes |
||
|site=http://github.com/ioanaf/sidef |
|||
|tags=ruby |
|tags=ruby |
||
|LCT=yes}} |
|LCT=yes}} |
||
Line 15: | Line 16: | ||
{{language programming paradigm|generic}} |
{{language programming paradigm|generic}} |
||
Sidef is a simple object-oriented language which is very permissive in letting you doing what you want with it. As a language, it takes the best from other programming languages such as [[derived from::Ruby]], [[derived from::Go]], [[derived from::JavaScript]] and [[derived from::Perl]] |
Sidef is a simple object-oriented language which is very permissive in letting you doing what you want with it. As a language, it takes the best from other programming languages such as [[derived from::Ruby]], [[derived from::Go]], [[derived from::JavaScript]] and [[derived from::Perl]]. |
||
It is a language written in Perl that combines |
|||
* Joy of programming |
|||
* Powerful [[object-oriented]] style |
|||
* Flexibility and extensibility |
|||
* [[Platform]] independence |
|||
* Sidef tutorial: [https://github.com/ioanaf/sidef/wiki https://github.com/ioanaf/sidef/wiki] |
* Sidef tutorial: [https://github.com/ioanaf/sidef/wiki https://github.com/ioanaf/sidef/wiki] |
Revision as of 11:34, 18 December 2013
![Language](http://static.miraheze.org/rosettacodewiki/thumb/2/27/Rcode-button-language-crushed.png/64px-Rcode-button-language-crushed.png)
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Execution method: | Interpreted |
---|---|
Garbage collected: | Yes |
Parameter passing methods: | By reference |
Type strength: | Weak |
Type expression: | Implicit |
Type checking: | Dynamic |
Lang tag(s): | ruby |
See Also: |
Sidef is a simple object-oriented language which is very permissive in letting you doing what you want with it. As a language, it takes the best from other programming languages such as Ruby, Go, JavaScript and Perl.
It is a language written in Perl that combines
- Joy of programming
- Powerful object-oriented style
- Flexibility and extensibility
- Platform independence
- Sidef tutorial: https://github.com/ioanaf/sidef/wiki
- Development page: https://github.com/ioanaf/sidef
Pages in category "Sidef"
The following 200 pages are in this category, out of 1,062 total.
(previous page) (next page)D
- Delegates
- 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
- Determine if a string is squeezable
- Determine if only one instance is running
- Dice game probabilities
- Digit fifth powers
- Digital root
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Disarium numbers
- Discordian date
- Display a linear combination
- Distinct palindromes within decimal numbers
- Distinct power numbers
- Distribution of 0 digits in factorial series
- Diversity prediction theorem
- DNS query
- Dot product
- Double Twin Primes
- Doubly-linked list/Element definition
- Dragon curve
- Draw a clock
- Draw a cuboid
- Draw a sphere
- Duffinian numbers
- Dynamic variable names
E
- Earliest difference between prime gaps
- Egyptian division
- Eisenstein primes
- EKG sequence convergence
- Element-wise operations
- Elementary cellular automaton
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random number generator
- Elliptic curve arithmetic
- Emirp primes
- Empty directory
- Empty program
- Empty string
- Enforced immutability
- Entropy
- Entropy/Narcissist
- Enumerations
- Environment variables
- Equal prime and composite sums
- Equilibrium index
- Erdös-Selfridge categorization of primes
- Erdős-Nicolas numbers
- Erdős-primes
- Esthetic numbers
- Ethiopian multiplication
- Euclid-Mullin sequence
- Euclidean rhythm
- Euler method
- Euler's constant 0.5772...
- Euler's identity
- Euler's sum of powers conjecture
- Evaluate binomial coefficients
- Even numbers which cannot be expressed as the sum of two twin primes
- Even or odd
- Evolutionary algorithm
- Exactly three adjacent 3 in lists
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Executable library
- Execute a system command
- Execute Brain****
- Execute HQ9+
- Exponentiation operator
- Exponentiation order
- Extend your language
- Extensible prime generator
- Extra primes
- Extract file extension
- Extreme floating point values
- Extreme primes
F
- Factor-perfect numbers
- Factorial
- Factorial primes
- Factorions
- Factors of a Mersenne number
- Factors of an integer
- Fairshare between two and more
- Farey sequence
- Fast Fourier transform
- FASTA format
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- Fermat pseudoprimes
- Fibonacci matrix-exponentiation
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- Fibonacci word/fractal
- File extension is in extensions list
- File input/output
- File modification time
- File size
- File size distribution
- Filter
- Find adjacent primes which differ by a square integer
- Find common directory path
- Find duplicate files
- Find first and last set bit of a long integer
- Find first missing positive
- Find largest left truncatable prime in a given base
- Find limit of recursion
- Find palindromic numbers in both binary and ternary bases
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Find the intersection of a line with a plane
- Find the intersection of two lines
- Find the last Sunday of each month
- Find the missing permutation
- Find words whose first and last three letters are equal
- First 9 prime Fibonacci number
- First class environments
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- First-class functions
- First-class functions/Use numbers analogously
- Five weekends
- Fivenum
- FizzBuzz
- Flatten a list
- Flow-control structures
- Floyd's triangle
- Floyd-Warshall algorithm
- Forbidden numbers
- Forest fire
- Fork
- Formatted numeric output
- Fortunate numbers
- Forward difference
- Four bit adder
- Four is magic
- Four sides of square
- Fractal tree
- Fractran
- Free polyominoes enumeration
- French Republican calendar
- Frobenius numbers
- FTP
- Function composition
- Function definition
- Function frequency
- Fusc sequence
G
- Gamma function
- Gapful numbers
- Gauss-Jordan matrix inversion
- Gaussian elimination
- Gaussian primes
- General FizzBuzz
- Generate Chess960 starting position
- Generate lower case ASCII alphabet
- Generate random numbers without repeating a value
- Generator/Exponential
- Generic swap
- Get system command output
- Getting the number of decimal places
- Giuga numbers
- Globally replace text in several files
- Golden ratio/Convergence
- Gray code
- Grayscale image
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Greedy algorithm for Egyptian fractions
- Guess the number
- Guess the number/With feedback
- Guess the number/With feedback (player)
- GUI/Maximum window dimensions
Categories:
- Execution method/Interpreted
- Garbage collection/Yes
- Parameter passing/By reference
- Typing/Weak
- Typing/Expression/Implicit
- Typing/Checking/Dynamic
- Programming Languages
- Programming paradigm/Dynamic
- Programming paradigm/Imperative
- Programming paradigm/Procedural
- Programming paradigm/Reflective
- Programming paradigm/Object-oriented
- Programming paradigm/Generic