DomainTools.com |
 |
||
|
|
||
English Wikipedia references for Chalmers.se 41-60 of 254
<< | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | >>
| Language: | ||||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
| Articles: | 254 |
24 |
24 |
15 |
17 |
11 |
7 |
16 |
4 |
10 |
212 |
13 |
| Procedural programming Talk:Procedural_programming | |
| Two-level grammar two-level grammar is a formal grammar that is used to generate another formal grammar, such as one with an infinite rule set . This is how a Van Wijngaarden grammar was used to specify Algol68 . A context free grammar that defines the rules for a second grammar can yield an effectively infinite set of rules for the derived grammar. Two-level_grammar | |
| Quinary Quinary (base-) is a numeral system with five as the base. This originates from the five fingers on either hand.In the quinary place system, five numerals from 0 to 4, are used to represent any real number. According to this method, five is written as 10, twenty-five is written as 100 and sixty is written as 220. Quinary | |
| Paradox (theorem prover) Paradox is an automated theorem proving system developed by Koen Lindström Claessen and Niklas Sörensson at the Chalmers University of Technology. The software is written in the Haskell programming language and is released under the terms of the GNU General Public License. Paradox_(theorem_prover) | |
| Stack machine computer science, a stack machine is a model of computation in which the computer's memory takes the form of one or more stacks. The term also refers to an actual computer implementing or simulating the idealized stack machine.In addition, a stack machine can also refer to a real or simulated machine with a "0-operand" instruction set. In such a machine, most instructions implicitly operate on values at the top of the stack and replace those values with the result. Stack_machine | |
| Non-blocking synchronization computer science, non-blocking synchronization ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress; wait-free if there is also guaranteed per-thread progress.Literature up to the turn of the century used "non-blocking" synonymously with lock-free. Non-blocking_synchronization | |
| Omega (TeX) Omega_(TeX) | |
| Post-glacial rebound Post-glacial rebound (sometimes called continental rebound, isostatic rebound, isostatic adjustment or post-ice-age isostatic recovery) is the rise of land masses that were depressed by the huge weight of ice sheets during the last glacial period, through a process known as isostatic depression. It affects northern Europe (especially Scotland, Fennoscandia and northern Denmark), Siberia, Canada, and the Great Lakes of Canada and the United States. Post-glacial_rebound | |
| Vertical loop Vertical_loop | |
| Bofors 37 mm Bofors 37 mm gun was an anti-tank gun designed by Swedish manufacturer Bofors in the early 1930s. Licensed copies were produced in a number of countries. The gun was used by some European armies during World War II, mainly at the early stage of the war. Bofors_37_mm | |
| Articles for deletion/C6 Wikipedia:Articles_for_deletion/C6 | |
| Fission product Fission products are the atomic fragments left after a large nucleus fissions. Typically, a large nucleus like Uranium fissions by splitting into two smaller nuclei, along with a few neutrons and a large release of energy in the form of heat (kinetic energy of the nuclei), gamma rays and neutrinos. The two smaller nuclei are the "fission products". Fission_product | |
| Setoid Setoid | |
| Jesus/Archive 7 Talk:Jesus/Archive_7 | |
| Boden Fortress Boden Fortress () is a modern fortress consisting of several major and minor forts and fortifications surrounding the city of Boden, Norrbotten, in northern Sweden. Although the main forts were finished in 1908, many of the supporting fortifications were not completed until the start of the First World War. Boden_Fortress | |
| List of Swedish regiments list of Swedish regiments and other military units (divisions, brigades, battalions, companies) that have existed since the 16th century. Most formations have changed names several times during their existence. Listed here are commonly used names.Regiments were the highest organized organic units in the Swedish Army from the time of Gustavus Adolphus on to the Second World War. List_of_Swedish_regiments | |
| Hälsinge regemente Hälsinge regemente (Hälsingland Regiment), designations I 14, I 14/Fo 49 and I 14/Fo 21, was a Swedish Army infantry regiment that traced its origins back to the 16th century. It was disbanded in 1997. The regiment's soldiers were originally recruited from the provinces of Hälsingland and Gästrikland, and it was later garrisoned in Gästrikland. Hälsinge_regemente | |
| Västerbottens regemente Västerbottens regemente (Västerbotten Regiment), designations I 19, I XIX, I 20 and I 20/Fo 61, was a Swedish Army infantry regiment that traced its origins back to the 16th century. It was disbanded in 2000. The regiment's soldiers were originally recruited from the province of Västerbotten, and it was later garrisoned there. Västerbottens_regemente | |
| Chalmers Students' Union Chalmers_Students'_Union | |
| Fudgets In computing, Fudgets is a graphical user interface toolkit for the functional programming language Haskell and the X Window System. Fudgets makes it easy to create client-server applications that communicate via the Internet.Most of the work on Fudgets was done in 1991-1996 by Thomas Hallgren and Magnus Carlsson. Fudgets |
<< | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | >>
