generic from FOLDOC

Generic Array Logic

<hardware, integrated circuit> (GAL) A newer kind of Programmable Array Logic based on EEPROM storage cells, been pioneered by Lattice. GALs can be erased and reprogrammed and usually replace a whole set of different PALs (hence the name).

(1995-12-09)

Try this search on Wikipedia, OneLook, Google

Nearby terms: General Recursion Theorem « generate « generation « Generic Array Logic » Generic Expert System Tool » generic identifier » genericity

Generic Expert System Tool

<artificial intelligence> (GEST) An expert system shell for Symbolics Lisp machine, with frames, forward chaining, backward chaining and fuzzy logic; written by John Gilmore(?) at GA Tech.

Latest version: 4.0, as of 1995-04-16.

ftp://ftp.gatech.edu/pub/ai/gest.tar.Z.

(1995-04-16)

Try this search on Wikipedia, OneLook, Google

Nearby terms: generate « generation « Generic Array Logic « Generic Expert System Tool » generic identifier » genericity » generic markup

generic identifier

<language, text> A string constituting the name of a element in an SGML document.

(2001-01-31)

Try this search on Wikipedia, OneLook, Google

Nearby terms: generation « Generic Array Logic « Generic Expert System Tool « generic identifier » genericity » generic markup » generic programming

genericity

<programming> The possibility for a language to provided parameterised modules or types. E.g. List(of:Integer) or List(of:People).

(1996-05-19)

Try this search on Wikipedia, OneLook, Google

Nearby terms: Generic Array Logic « Generic Expert System Tool « generic identifier « genericity » generic markup » generic programming » Generic Routing Encapsulation

generic markup

<text> In computerised document preparation, a method of adding information to the text indicating the logical components of a document, such as paragraphs, headers or footnotes. SGML is an example of such a system. Specific instructions for layout of the text on the page do not appear in the markup.

(1996-05-19)

Try this search on Wikipedia, OneLook, Google

Nearby terms: Generic Expert System Tool « generic identifier « genericity « generic markup » generic programming » Generic Routing Encapsulation » Generic Security Service Application Programming Interface

generic programming

<programming> A programming technique which aims to make programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic programs are often quite rich in structure. For example they may be other programs, types or type constructors or even programming paradigms.

(1997-11-22)

Try this search on Wikipedia, OneLook, Google

Nearby terms: generic identifier « genericity « generic markup « generic programming » Generic Routing Encapsulation » Generic Security Service Application Programming Interface » generic thunk

Generic Routing Encapsulation

<networking, protocol> (GRE) A protocol which allows an arbitrary network protocol A to be transmitted over any other arbitrary network protocol B, by encapsulating the packets of A within GRE packets, which in turn are contained within packets of B.

Defined in RFC 1701 and RFC 1702 (GRE over IP).

(1998-07-19)

Try this search on Wikipedia, OneLook, Google

Nearby terms: genericity « generic markup « generic programming « Generic Routing Encapsulation » Generic Security Service Application Programming Interface » generic thunk » generic type variable

Generic Security Service Application Programming Interface

<security, programming> (GSS-API) An application level interface (API) to system security services. It provides a generic interface to services which may be provided by a variety of different security mechanisms. Vanilla GSS-API supports security contexts between two entities (known as "principals").

GSS-API is a draft internet standard which is being developed in the Common Authentication Technology Working Group (cat-wg) of the Internet Engineering Task Force (IETF).

Initial specifications for GSS-API appeared in RFC 1508 and RFC 1509. Subsequent revisions appeared in several draft standards documents.

http://dstc.qut.edu.au/~barton/work/project.html.

(1996-05-19)

Try this search on Wikipedia, OneLook, Google

Nearby terms: generic markup « generic programming « Generic Routing Encapsulation « Generic Security Service Application Programming Interface » generic thunk » generic type variable » Genesia

generic thunk

<programming> A software mechanism that allows a 16-bit Windows application to load and call a Win32 DLL under Windows NT and Windows 95.

generic type variable

<programming> (Also known as a "schematic type variable"). Different occurrences of a generic type variable in a type expression may be instantiated to different types. Thus, in the expression

	let id x = x in
	(id True, id 1)

id's type is (for all a: a -> a). The universal quantifier "for all a:" means that a is a generic type variable. For the two uses of id, a is instantiated to Bool and Int. Compare this with

	let id x = x in
	let f g = (g True, g 1) in
	f id

This looks similar but f has no legal Hindley-Milner type. If we say

	f :: (a -> b) -> (b, b)

this would permit g's type to be any instance of (a -> b) rather than requiring it to be at least as general as (a -> b). Furthermore, it constrains both instances of g to have the same result type whereas they do not. The type variables a and b in the above are implicitly quantified at the top level:

	f :: for all a: for all b: (a -> b) -> (b, b)

so instantiating them (removing the quantifiers) can only be done once, at the top level. To correctly describe the type of f requires that they be locally quantified:

	f :: ((for all a: a) -> (for all b: b)) -> (c, d)

which means that each time g is applied, a and b may be instantiated differently. f's actual argument must have a type at least as general as ((for all a: a) -> (for all b: b)), and may not be some less general instance of this type. Type variables c and d are still implicitly quantified at the top level and, now that g's result type is a generic type variable, any types chosen for c and d are guaranteed to be instances of it.

This type for f does not express the fact that b only needs to be at least as general as the types c and d. For example, if c and d were both Bool then any function of type (for all a: a -> Bool) would be a suitable argument to f but it would not match the above type for f.

Try this search on Wikipedia, OneLook, Google

Nearby terms: Generic Routing Encapsulation « Generic Security Service Application Programming Interface « generic thunk « generic type variable » Genesia » genetic algorithm » genetic algorithms