Plange


analytic type

an analytic value that is a type

analytic value

a value defined as the solution(s) of a system of constraints, in contrast to a natural value

algorithm

a self-contained set of operations to be performed

collection

a value that stores zero or more other values. It facilitates inspection by providing unique elements as requested (unless too few elements are stored) and by providing cardinality.

compiler

a program that converts source code into a machine code or intermediate representation for execution on a target platform.

constraint

a value that indicates a logical relationship among two or more other values, including arithmetic, predicate logic, and an extensible collection of other analysis and calculi

function

a value that when invoked applies an algorithm (the implementation) to zero or more given values and optionally returns a value as a result

function type

a type that describes functions (not to be confused with type function)

functional equivalent

a function that can be substituted for another, and produce the same results given the same input, even though the implementation may be different. Formally, a function with identical pre- and post-conditions.

iterator

a value used to enumerate the elements of a collection

metaobject

a value that models a language feature

native program

a program encoded in the manner recognized by the hardware of the computer

natural value

a value with a singular, known representation, in contrast to an analytic value.

operation

a primitive action that reads, writes, or transforms (or some combination thereof) data utilizing the available hardware and software infrastructure

parser

a program that identifies the syntactic structure of a piece of text, using provided grammar rules

platform

the hardware, firmware, software, and data that make up the basic operational components of a computer, and more specifically the formal properties of its implementation and behavior (e.g. memory model, instruction set, calling convention, or application binary interface)

program

formally, a representation of one or more algorithms that may be linearized (made sequential) and executed by a Turing machine, but colloquially any collection of software and data

programming language

a formal logic, defined by a set of grammar rules and logical semantics, for constructing programs

return (intransitive)

to exit the current function, returning control to the caller, possibly supplying a value as a result

return (transitive)

to exit the current function, supplying the object (of the sentence) as a result, e.g. "return 5"

requirement

an assertion that, from some given starting state and some given action, some given ending state is derived

runtime

the software that supports the execution of a program for a specific language

software

any collection of well-defined algorithms, typically interrelated and with the intent of fulfilling some specification

specification

an (ideally) exhaustive description of the structure and behavior of hardware and/or software, typically in the form of written natural language and accompanying images, to be referenced in the construction of such wares

standard library

the collection of basic software building-blocks included with a programming language

type

a value describing the structure and behavior of another value

type function

a function that returns a type (not to be confused with function type)

value

a unique element of the universal set

copyright © Brent Lewis 2017