first class module

<programming> A module that is a first class data object of the programming language, e.g. a record containing functions. In a functional language, it is standard to have first class programs, so program building blocks can have the same status.

Claus Reinke's Virtual Bookshelf.

(2004-01-26)

Try this search on Wikipedia, OneLook, Google

Nearby terms: fireworks mode « Firmware « firmy « first class module » First Fit » first generation » first generation computer

First Fit

<algorithm> A resource allocation scheme (usually for memory). First Fit fits data into memory by scanning from the beginning of available memory to the end, until the first free space which is at least big enough to accept the data is found. This space is then allocated to the data. Any left over becomes a smaller, separate free space.

If the data to be allocated is bigger than the biggest free space, the request cannot be met, and an error is generated.

Compare Best Fit.

(1997-06-02)

Try this search on Wikipedia, OneLook, Google

Nearby terms: Firmware « firmy « first class module « First Fit » first generation » first generation computer » first generation language

first generation

1. <architecture> first generation computer.

2. <language> first generation language.

Try this search on Wikipedia, OneLook, Google

Nearby terms: firmy « first class module « First Fit « first generation » first generation computer » first generation language » first-in first-out

first generation computer

<architecture> A prototype computer based on vacuum tubes and other esoteric technologies. Chronologically, any computer designed before the mid-1950s. Examples include Howard Aiken's Mark 1 (1944), Maunchly and Eckert's ENIAC (1946), and the IAS computer.

(1996-11-22)

Try this search on Wikipedia, OneLook, Google

Nearby terms: first class module « First Fit « first generation « first generation computer » first generation language » first-in first-out » first normal form

first generation language

Raw machine code. When computers were first "programmed" from an input device, rather than by being rewired, they were fed input in the form of numbers, which they then interpreted as commands. This was really low level, and a program fragment might look like "010307 010307". Almost no one programs in machine language anymore, because translators are nearly trivial to write.

(1994-12-01)

Try this search on Wikipedia, OneLook, Google

Nearby terms: First Fit « first generation « first generation computer « first generation language » first-in first-out » first normal form » first-order

first-in first-out

<algorithm> (FIFO, or "queue") A data structure or hardware buffer from which items are taken out in the same order they were put in. Also known as a "shelf" from the analogy with pushing items onto one end of a shelf so that they fall off the other. A FIFO is useful for buffering a stream of data between a sender and receiver which are not synchronised - i.e. not sending and receiving at exactly the same rate. Obviously if the rates differ by too much in one direction for too long then the FIFO will become either full (blocking the sender) or empty (blocking the receiver). A Unix pipe is a common example of a FIFO.

A FIFO might be (but isn't ever?) called a LILO - last-in last-out. The opposite of a FIFO is a LIFO (last-in first-out) or "stack".

(1999-12-06)

Try this search on Wikipedia, OneLook, Google

Nearby terms: first generation « first generation computer « first generation language « first-in first-out » first normal form » first-order » first-order logic

first normal form

database normalisation

Try this search on Wikipedia, OneLook, Google

Nearby terms: first generation computer « first generation language « first-in first-out « first normal form » first-order » first-order logic » First Party DMA

first-order

Not higher-order.

(1995-03-06)

Try this search on Wikipedia, OneLook, Google

Nearby terms: first generation language « first-in first-out « first normal form « first-order » first-order logic » First Party DMA » fish

first-order logic

<language, logic> The language describing the truth of mathematical formulas. Formulas describe properties of terms and have a truth value. The following are atomic formulas:

 True
 False
 p(t1,..tn)	where t1,..,tn are terms and p is a predicate.

 F1 ^ F2	conjunction - true if both F1 and F2 are true,

 F1 V F2	disjunction - true if either or both are true,

 F1 => F2	implication - true if F1 is false or F2 is
		true, F1 is the antecedent, F2 is the
		consequent (sometimes written with a thin
		arrow),

 F1 <= F2	true if F1 is true or F2 is false,

 F1 == F2	true if F1 and F2 are both true or both false
		(normally written with a three line
		equivalence symbol)

 ~F1		negation - true if f1 is false (normally
		written as a dash '-' with a shorter vertical
		line hanging from its right hand end).

 For all v . F	universal quantification - true if F is true
		for all values of v (normally written with an
		inverted A).

 Exists v . F	existential quantification - true if there
		exists some value of v for which F is true.
		(Normally written with a reversed E).

The "order" of a logic specifies what entities "For all" and "Exists" may quantify over. First-order logic can only quantify over sets of atomic propositions. (E.g. For all p . p => p). Second-order logic can quantify over functions on propositions, and higher-order logic can quantify over any type of entity. The sets over which quantifiers operate are usually implicit but can be deduced from well-formedness constraints.

In first-order logic quantifiers always range over ALL the elements of the domain of discourse. By contrast, second-order logic allows one to quantify over subsets.

["The Realm of First-Order Logic", Jon Barwise, Handbook of Mathematical Logic (Barwise, ed., North Holland, NYC, 1977)].

(2005-12-27)

Try this search on Wikipedia, OneLook, Google

Nearby terms: first-in first-out « first normal form « first-order « first-order logic » First Party DMA » fish » FISH queue

First Party DMA

bus mastering

Try this search on Wikipedia, OneLook, Google

Nearby terms: first normal form « first-order « first-order logic « First Party DMA » fish » FISH queue » FITNR

Copyright 2010 Denis Howe