Category:Sidef: Difference between revisions
Content added Content deleted
(Created page with "{{stub}}{{language}}") |
No edit summary |
||
| Line 1: | Line 1: | ||
{{language |
|||
|exec=bytecode |
|||
|strength=weak |
|||
|express=implicit |
|||
|checking=dynamic |
|||
|parampass=reference |
|||
|gc=no |
|||
|tags=perl |
|||
|LCT=yes}} |
|||
{{language programming paradigm|Dynamic}} |
|||
{{language programming paradigm|imperative}} |
|||
{{language programming paradigm|procedural}} |
|||
{{language programming paradigm|reflective}} |
|||
{{language programming paradigm|object-oriented}} |
|||
{{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]]. It is written in pure Perl and does not require any external modules, other than some of the Perl's CORE modules. |
|||
Sidef tutorial: [https://github.com/ioanaf/sidef/wiki https://github.com/ioanaf/sidef/wiki] |
|||
Development page: [https://github.com/ioanaf/sidef https://github.com/ioanaf/sidef] |
|||
Revision as of 19:00, 17 December 2013
This programming language may be used to instruct a computer to perform a task.
| Execution method: | Compiled (bytecode) |
|---|---|
| Garbage collected: | No |
| Parameter passing methods: | By reference |
| Type strength: | Weak |
| Type expression: | Implicit |
| Type checking: | Dynamic |
| Lang tag(s): | perl |
| 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 written in pure Perl and does not require any external modules, other than some of the Perl's CORE modules.
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,054 total.
(previous page) (next page)A
- A* search algorithm
- A+B
- ABC problem
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Achilles numbers
- Ackermann function
- Add a variable to a class instance at runtime
- Additive primes
- Address of a variable
- AKS test for primes
- Align columns
- Almkvist-Giullera formula for pi
- Almost prime
- Amicable pairs
- Anadromes
- Anagrams
- Anagrams/Deranged anagrams
- Anaprimes
- Angle difference between two bearings
- Animate a pendulum
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Append numbers at same position in strings
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Apéry's constant
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arithmetic coding/As a generalized change of radix
- Arithmetic evaluation
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Ascending primes
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Attractive numbers
- Audio alarm
- Audio frequency generator
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
- AVL tree
B
- Babbage problem
- Balanced brackets
- Barnsley fern
- Base 16 numbers needing a to f
- Base58Check encoding
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Bilinear interpolation
- Binary digits
- Binary search
- Bitmap/Bresenham's line algorithm
- Bitmap/Write a PPM file
- Bitwise operations
- Blum integer
- Boolean values
- Boustrophedon transform
- Box the compass
- Brace expansion
- Brazilian numbers
- Break OO privacy
- Brilliant numbers
- Brownian tree
- Bulls and cows
- Bulls and cows/Player
- Burrows–Wheeler transform
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calendar - for "REAL" programmers
- Calkin-Wilf sequence
- Call a function
- Call an object method
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Centroid of a set of N-dimensional points
- Change e letters to i in words
- Changeable words
- Chaos game
- Character codes
- Chebyshev coefficients
- Check Machin-like formulas
- Check that file exists
- Checksumcolor
- Chernick's Carmichael numbers
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Cipolla's algorithm
- Circles of given radius through two points
- Circular primes
- Classes
- Closest-pair problem
- Closures/Value capture
- Collect and sort square numbers in ascending order from three lists
- Collections
- Color quantization
- Color wheel
- Colour bars/Display
- Colour pinstripe/Display
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Compare a list of strings
- Compare sorting algorithms' performance
- Compile-time 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
- Concurrent computing
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction convergents
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Coprime triplets
- Coprimes
- Copy a string
- CORDIC
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- Cramer's rule
- Create a file
- Create a two-dimensional 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
- Currency
- Currying
- Curzon numbers
- Cycle detection
- Cyclops numbers
- Cyclotomic polynomial
Categories:
- Execution method/Compiled/Bytecode
- Garbage collection/No
- 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