Allotropes of ironAt atmospheric pressure, three allotropic forms of iron exist, depending on temperature: alpha iron (α-Fe, ferrite), gamma iron (γ-Fe, austenite), and delta iron (δ-Fe). At very high pressure, a fourth form exists, epsilon iron (ε-Fe, hexaferrum). Some controversial experimental evidence suggests the existence of a fifth high-pressure form that is stable at very high pressures and temperatures. The phases of iron at atmospheric pressure are important because of the differences in solubility of carbon, forming different types of steel.
Ductile ironDuctile iron, also known as ductile cast iron, nodular cast iron, spheroidal graphite iron, spheroidal graphite cast iron and SG iron, is a type of graphite-rich cast iron discovered in 1943 by Keith Millis. While most varieties of cast iron are weak in tension and brittle, ductile iron has much more impact and fatigue resistance, due to its nodular graphite inclusions. On October 25, 1949, Keith Dwight Millis, Albert Paul Gagnebin and Norman Boden Pilling received US patent 2,485,760 on a cast ferrous alloy for ductile iron production via magnesium treatment.
Human iron metabolismHuman iron metabolism is the set of chemical reactions that maintain human homeostasis of iron at the systemic and cellular level. Iron is both necessary to the body and potentially toxic. Controlling iron levels in the body is a critically important part of many aspects of human health and disease. Hematologists have been especially interested in systemic iron metabolism, because iron is essential for red blood cells, where most of the human body's iron is contained.
IronIron is a chemical element with the symbol Fe () and atomic number 26. It is a metal that belongs to the first transition series and group 8 of the periodic table. It is, by mass, the most common element on Earth, just ahead of oxygen (32.1% and 30.1%, respectively), forming much of Earth's outer and inner core. It is the fourth most common element in the Earth's crust, being mainly deposited by meteorites in its metallic state, with its ores also being found there.
Iron deficiencyIron deficiency, or sideropenia, is the state in which a body lacks enough iron to supply its needs. Iron is present in all cells in the human body and has several vital functions, such as carrying oxygen to the tissues from the lungs as a key component of the hemoglobin protein, acting as a transport medium for electrons within the cells in the form of cytochromes, and facilitating oxygen enzyme reactions in various tissues. Too little iron can interfere with these vital functions and lead to morbidity and death.
Iron meteoriteIron meteorites, also called siderites or ferrous meteorites, are a type of meteorite that consist overwhelmingly of an iron–nickel alloy known as meteoric iron that usually consists of two mineral phases: kamacite and taenite. Most iron meteorites originate from cores of planetesimals, with the exception of the IIE iron meteorite group The iron found in iron meteorites was one of the earliest sources of usable iron available to humans, due to the malleability and ductility of the meteoric iron, before the development of smelting that signaled the beginning of the Iron Age.
Type systemIn computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating point, string) to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term.
Type theoryIn mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general, type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics. Two influential type theories that were proposed as foundations are Alonzo Church's typed λ-calculus and Per Martin-Löf's intuitionistic type theory. Most computerized proof-writing systems use a type theory for their foundation, a common one is Thierry Coquand's Calculus of Inductive Constructions.
Banded iron formationBanded iron formations (BIFs; also called banded ironstone formations) are distinctive units of sedimentary rock consisting of alternating layers of iron oxides and iron-poor chert. They can be up to several hundred meters in thickness and extend laterally for several hundred kilometers. Almost all of these formations are of Precambrian age and are thought to record the oxygenation of the Earth's oceans. Some of the Earth's oldest rock formations, which formed about (Ma), are associated with banded iron formations.
Data typeIn computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.
Type safetyIn computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is sometimes alternatively considered to be a property of facilities of a computer language; that is, some facilities are type-safe and their usage will not result in type errors, while other facilities in the same language may be type-unsafe and a program using them may encounter type errors.
GameplayGameplay is the specific way in which players interact with a game, and in particular with video games. Gameplay is the pattern defined through the game rules, connection between player and the game, challenges and overcoming them, plot and player's connection with it. Video game gameplay is distinct from graphics and audio elements. In card games, the equivalent term is play. Arising alongside video game development in the 1980s, the term gameplay was used solely within the context of video games, though now its popularity has begun to see use in the description of other, more traditional, game forms.
Type inferenceType inference refers to the automatic detection of the type of an expression in a formal language. These include programming languages and mathematical type systems, but also natural languages in some branches of computer science and linguistics. Types in a most general view can be associated to a designated use suggesting and restricting the activities possible for an object of that type. Many nouns in language specify such uses. For instance, the word leash indicates a different use than the word line.
Emergent gameplayEmergent gameplay refers to complex situations in video games, board games, or table top role-playing games that emerge from the interaction of relatively simple game mechanics. Designers have attempted to encourage emergent play by providing tools to players such as placing web browsers within the game engine (such as in Eve Online, The Matrix Online), providing XML integration tools and programming languages (Second Life), fixing exchange rates (Entropia Universe), and allowing a player to spawn any object they desire to solve a puzzle (Scribblenauts).
Type conversionIn computer science, type conversion, type casting, type coercion, and type juggling are different ways of changing an expression from one data type to another. An example would be the conversion of an integer value into a floating point value or its textual representation as a string, and vice versa. Type conversions can take advantage of certain features of type hierarchies or data representations.
Dependent typeIn computer science and logic, a dependent type is a type whose definition depends on a value. It is an overlapping feature of type theory and type systems. In intuitionistic type theory, dependent types are used to encode logic's quantifiers like "for all" and "there exists". In functional programming languages like Agda, ATS, Coq, F*, Epigram, and Idris, dependent types help reduce bugs by enabling the programmer to assign types that further restrain the set of possible implementations.
DefinitionA definition is a statement of the meaning of a term (a word, phrase, or other set of symbols). Definitions can be classified into two large categories: intensional definitions (which try to give the sense of a term), and extensional definitions (which try to list the objects that a term describes). Another important category of definitions is the class of ostensive definitions, which convey the meaning of a term by pointing out examples. A term may have many different senses and multiple meanings, and thus require multiple definitions.
Intuitionistic type theoryIntuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory) is a type theory and an alternative foundation of mathematics. Intuitionistic type theory was created by Per Martin-Löf, a Swedish mathematician and philosopher, who first published it in 1972. There are multiple versions of the type theory: Martin-Löf proposed both intensional and extensional variants of the theory and early impredicative versions, shown to be inconsistent by Girard's paradox, gave way to predicative versions.
Sandbox gameA sandbox game is a video game with a gameplay element that provides players a great degree of creativity to interact with, usually without any predetermined goal, or alternatively with a goal that the players set for themselves. Such games may lack any objective, and are sometimes referred to as non-games or software toys. More often, sandbox games result from these creative elements being incorporated into other genres and allowing for emergent gameplay.
Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
