Object language

This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (July 2009)

It has been suggested that this article be split into multiple articles accessible from a disambiguation page. (Discuss)

An object language is a language which is the "object" of study in various fields including logic, linguistics, mathematics and theoretical computer science. The language being used to talk about an object language is called a metalanguage. Object languages may be a formal or natural language.

Types of object language

Formal languages

Mathematical logic and linguistics make use of metalanguages, which are languages for describing the nature of other languages. In mathematical logic, the object language is usually a formal language. The language which a metalanguage is used to describe is the object language. It is called that because that language is the object under discussion using the metalanguage.

For instance, someone who says "In French, you say Bonjour to greet someone" uses English as a metalanguage to describe the object language French.

Computer languages

At their basic level, computers act on what is given to them through a limited set of instructions which are understood by their CPUs. In the earliest computers, that meant programmers sometimes typed 1's and 0's to program. Since this requires considerable programmer training (and patience) to create instructions, later computer languages have gone to great lengths to simplify the programmer's task. (For example, now it's common for people with little training to drag-and-drop icons to create a Web page; all the steps to create the actual instructions which are run by computers are automatically performed, and not visible.)

One common practice for decades is to allow a programmer to use source language (whose use may still require extensive training), and have that language translated into object code which the computer can immediately use. The compiling of one into the other varies depending on what CPU is being given the instructions.

Object language in this context means something akin to "the object of what the programmer is trying to achieve". It should not be confused with object-oriented language, which is a type of computer programming language which changes the programmer's environment into convenient objects which can be used in something similar to a drag-and-drop fashion.

Object language in this context is synonymous with target language. The object language of a translation most often is a machine language, but can be some other kind of language, such as assembly language.

Because the object language of compilation has usually been machine language, the term object file has come to mean a file containing machine instructions, and sometimes the translated program itself is simply called an object.

Expressions in an object language

Symbols

A symbol is an idea, abstraction or concept, tokens of which may be marks or a configuration of marks which form a particular pattern. Although the term "symbol" in common use refers at some times to the idea being symbolized, and at other times to the marks on a piece of paper or chalkboard which are being used to express that idea; in the formal languages studied in mathematics and logic, the term "symbol" refers to the idea, and the marks are considered to be a token instance of the symbol.

Formulas

In the formal languages used in mathematical logic and computer science, a well-formed formula or simply formula is an idea, abstraction or concept which is expressed using the symbols and formation rules (also called the formal grammar) of a particular formal language. To say that a string of symbols is a wff with respect to a given formal grammar is equivalent to saying that belongs to the language generated by .

Formal systems

A formal system is a formal language together with a deductive system which consists of a set of inference rules and/or axioms. A formal system is used to derive one expression from one or more other expressions previously expressed in the system. These expressions are called axioms, in the case of those previously supposed to be true, or theorems, in the case of those derived. A formal system may be formulated and studied for its intrinsic properties, or it may be intended as a description (i.e. a model) of external phenomena.

Theorems

A theorem is a symbol or string of symbols which is derived by using a formal system. The string of symbols is a logical consequence of the axioms and rules of the system.

Formal proofs

A formal proof or derivation is a finite sequence of propositions (called well-formed formulas in the case of a formal language) each of which is an axiom or follows from the preceding sentences in the sequence by a rule of inference. The last sentence in the sequence is a theorem of a formal system. The concept of natural deduction is a generalization of the concept of proof.^[1]

Theories

A theory is a set of sentences in a formal language.

References

This computer science article is a stub. You can help Wikipedia by expanding it. v • d • e