MetallographyMetallography is the study of the physical structure and components of metals, by using microscopy. Ceramic and polymeric materials may also be prepared using metallographic techniques, hence the terms ceramography, plastography and, collectively, materialography. The surface of a metallographic specimen is prepared by various methods of grinding, polishing, and etching. After preparation, it is often analyzed using optical or electron microscopy. Using only metallographic techniques, a skilled technician can identify alloys and predict material properties.
Effective demandIn economics, effective demand (ED) in a market is the demand for a product or service which occurs when purchasers are constrained in a different market. It contrasts with notional demand, which is the demand that occurs when purchasers are not constrained in any other market. In the aggregated market for goods in general, demand, notional or effective, is referred to as aggregate demand. The concept of effective supply parallels the concept of effective demand.
Aggregate (composite)Aggregate is the component of a composite material that resists compressive stress and provides bulk to the composite material. For efficient filling, aggregate should be much smaller than the finished item, but have a wide variety of sizes. For example, the particles of stone used to make concrete typically include both sand and gravel. Aggregate composites tend to be much easier to fabricate, and much more predictable in their finished properties, than fiber composites.
Sandwich-structured compositeIn materials science, a sandwich-structured composite is a special class of composite materials that is fabricated by attaching two thin-but-stiff skins to a lightweight but thick core. The core material is normally low strength, but its higher thickness provides the sandwich composite with high bending stiffness with overall low density. Open- and closed-cell-structured foams like polyethersulfone, polyvinylchloride, polyurethane, polyethylene or polystyrene foams, balsa wood, syntactic foams, and honeycombs are commonly used core materials.
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.
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.
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.
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 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.
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.
