|
Qalb (programming Language)
__NOTOC__ قلب (), transliterated ''Qalb'', ''Qlb'' and ''Alb'', is a functional programming language allowing a programmer to write programs completely in Arabic. Its name means "heart" in Arabic and is a recursive acronym for ''Qlb: a programming language'' (, '). It was developed in 2012 by Ramsey Nasser, a computer scientist at the Eyebeam Art + Technology Center in New York City, as both an artistic endeavor and as a response to the Anglophone bias in the vast majority of programming languages, which express their fundamental concepts using English words. The syntax is like that of Lisp or Scheme, consisting of parenthesized lists. Keywords are in Arabic (specifically, Lebanese Arabic) and program text is laid out right-to-left, like all Arabic text. The language provides a minimal set of primitives for defining functions, conditionals, looping, list manipulation, and basic arithmetic expressions. It is Turing-complete, and the Fibonacci sequence and Conway's Game of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Programming
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that map values to other values, rather than a sequence of imperative statements which update the running state of the program. In functional programming, functions are treated as first-class citizens, meaning that they can be bound to names (including local identifiers), passed as arguments, and returned from other functions, just as any other data type can. This allows programs to be written in a declarative and composable style, where small functions are combined in a modular manner. Functional programming is sometimes treated as synonymous with purely functional programming, a subset of functional programming which treats all functions as deterministic mathematical functions, or pure functions. When a pure function is call ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subroutine
In computer programming, a function or subroutine is a sequence of program instructions that performs a specific task, packaged as a unit. This unit can then be used in programs wherever that particular task should be performed. Functions may be defined within programs, or separately in libraries that can be used by many programs. In different programming languages, a function may be called a routine, subprogram, subroutine, method, or procedure. Technically, these terms all have different definitions, and the nomenclature varies from language to language. The generic umbrella term ''callable unit'' is sometimes used. A function is often coded so that it can be started several times and from several places during one execution of the program, including from other functions, and then branch back ('' return'') to the next instruction after the ''call'', once the function's task is done. The idea of a subroutine was initially conceived by John Mauchly during his work on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Languages
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that map values to other values, rather than a sequence of imperative statements which update the running state of the program. In functional programming, functions are treated as first-class citizens, meaning that they can be bound to names (including local identifiers), passed as arguments, and returned from other functions, just as any other data type can. This allows programs to be written in a declarative and composable style, where small functions are combined in a modular manner. Functional programming is sometimes treated as synonymous with purely functional programming, a subset of functional programming which treats all functions as deterministic mathematical functions, or pure functions. When a pure function is called w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Software Fork
In software engineering, a project fork happens when developers take a copy of source code from one software package and start independent development on it, creating a distinct and separate piece of software. The term often implies not merely a development branch, but also a split in the developer community; as such, it is a form of schism. Grounds for forking are varying user preferences and stagnated or discontinued development of the original software. Free and open-source software is that which, by definition, may be forked from the original development team without prior permission, and without violating copyright law. However, licensed forks of proprietary software (''e.g.'' Unix) also happen. Etymology The word "fork" has been used to mean "to divide in branches, go separate ways" as early as the 14th century. In the software environment, the word evokes the fork system call, which causes a running process to split itself into two (almost) identical copies that (typi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Read–eval–print Loop
A read–eval–print loop (REPL), also termed an interactive toplevel or language shell, is a simple interactive computer programming environment that takes single user inputs, executes them, and returns the result to the user; a program written in a REPL environment is executed piecewise. The term usually refers to programming interfaces similar to the classic Lisp machine interactive environment. Common examples include command-line shells and similar environments for programming languages, and the technique is very characteristic of scripting languages. History The first Read-Eval-Print loop, ''cycle'', was invented in 1964 by L. Peter Deutsch and Edmund Berkeley for an implementation of Lisp on the PDP-1. Overview In a REPL, the user enters one or more expressions (rather than an entire compilation unit) and the REPL evaluates them and displays the results. The name ''read–eval–print loop'' comes from the names of the Lisp primitive functions which implement th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arabic Calligraphy
Arabic calligraphy is the artistic practice of handwriting and calligraphy based on the Arabic alphabet. It is known in Arabic as ''khatt'' ( ar, خط), derived from the word 'line', 'design', or 'construction'. Kufic is the oldest form of the Arabic script. From an artistic point of view, Arabic calligraphy has been known and appreciated for its diversity and great potential for development. In fact, it has been linked in the Arabic culture to various fields such as religion, art, architecture, education and craftsmanship, which in return have played an important role in its advancement. Although most Islamic calligraphy is in Arabic and most Arabic calligraphy is Islamic, the two are not identical. Coptic or other Christian manuscripts in Arabic, for example, have made use of calligraphy. Likewise, there is Islamic calligraphy in Persian or the historic Ottoman language. Arabic alphabet The Arabic alphabet is known to be used by one of the most widely used language ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tatweel
Kashida or Kasheeda ( fa, کشیده; "extended", "stretched", "lengthened") is a type of justification in the Arabic language and in some descendant cursive scripts. In contrast to white-space justification, which increases the length of a line of text by expanding spaces between words or individual letters, kasheeda creates justification by elongating characters at certain points. Kasheeda justification can be combined with white-space justification. The analog in European (Latin-based) typography (expanding or contracting letters to improve spacing) is sometimes called ''expansion'', and falls within microtypography. Kasheeda is considerably easier and more flexible, however, because Arabic-Persian scripts feature prominent horizontal strokes, whose lengths are accordingly flexible. For example, ' and ' with and without kasheeda may look like the following: Kasheeda can also refer to a character that represents this elongation (ـ) – also known as tatweel or taṭwīl ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Conway's Game Of Life
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine. Rules The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square ''cells'', each of which is in one of two possible states, ''live'' or ''dead'' (or ''populated'' and ''unpopulated'', respectively). Every cell interacts with its eight ''neighbours'', which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur: # Any live cell with fewer than two live neighbours dies, as if by underpopulation. # Any live cell with two or three live ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fibonacci Sequence
In mathematics, the Fibonacci numbers, commonly denoted , form a sequence, the Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes (as did Fibonacci) from 1 and 2. Starting from 0 and 1, the first few values in the sequence are: :0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144. The Fibonacci numbers were first described in Indian mathematics, as early as 200 BC in work by Pingala on enumerating possible patterns of Sanskrit poetry formed from syllables of two lengths. They are named after the Italian mathematician Leonardo of Pisa, later known as Fibonacci, who introduced the sequence to Western European mathematics in his 1202 book '' Liber Abaci''. Fibonacci numbers appear unexpectedly often in mathematics, so much so that there is an entire journal dedicated to their study, the '' Fibonacci Quarterly''. Applications of Fibonacci numbers inclu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing-complete
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician and computer scientist Alan Turing). This means that this system is able to recognize or decide other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete. A related concept is that of Turing equivalence two computers P and Q are called equivalent if P can simulate Q and Q can simulate P. The Church–Turing thesis conjectures that any function whose values can be computed by an algorithm can be computed by a Turing machine, and therefore that if any real-world computer can simulate a Turing machine, it is Turing equivalent to a Turing machine. A universal Turi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expression (programming)
In computer science, an expression is a syntactic entity in a programming language that may be evaluated to determine its value. It is a combination of one or more constants, variables, functions, and operators that the programming language interprets (according to its particular rules of precedence and of association) and computes to produce ("to return", in a stateful environment) another value. This process, for mathematical expressions, is called ''evaluation''. In simple settings, the resulting value is usually one of various primitive types, such as numerical, string, boolean, complex data type or other types. Expression is often contrasted with statement—a syntactic entity that has no value (an instruction). Examples For example, 2 + 3 is both an arithmetic and programming expression, which evaluates to 5. A variable is an expression because it denotes a value in memory, so y + 6 is also an expression. An example of a relational expression is 4 ≠ 4, which eva ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Loop (programming)
In computer science, control flow (or flow of control) is the order in which individual statements, instructions or function calls of an imperative program are executed or evaluated. The emphasis on explicit control flow distinguishes an ''imperative programming'' language from a ''declarative programming'' language. Within an imperative programming language, a ''control flow statement'' is a statement that results in a choice being made as to which of two or more paths to follow. For non-strict functional languages, functions and language constructs exist to achieve the same result, but they are usually not termed control flow statements. A set of statements is in turn generally structured as a block, which in addition to grouping, also defines a lexical scope. Interrupts and signals are low-level mechanisms that can alter the flow of control in a way similar to a subroutine, but usually occur as a response to some external stimulus or event (that can occur asynchronously), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
