LabIS AgentLink Member

Návrh a vývoj funkcionálního programovacího jazyka na bázi Transparentní intensionální logiky (TIL).


Základní specikace

TIL is well-suited for the utilization as a content language in multi-agent systems. Its main advantages are:

Semantic nature
Due to the ramified type-hierarchy, constructions are objects sui generis of TIL theory. Thus we do not have to deal with the problems of syntacticism like those of translation, and with inconsistencies stemming from the need of 'disquoting'.

High expressibility
The expressive power of TIL is remarkable. Using TIL it is easy to analyse almost all the semantic features of natural languages, even those that are the traditional hard-nuts of semantics (like anaphora, de dicto vs. de re attitudes and modalities).

Its primary purpose
Unlike mathematical logics, TIL has been intended to be a tool for logical analysis of natural language communication. Primarily it has been designed and used for natural languages, but its utility in other areas is straightforward.

But TIL, due to its notation, is not plausible as a computerised content language. That is why we are going to define a computational variant of TIL, namely the TIL-Script language. The reasons are:

  1. The notation of the language of constructions is not fully standardized.
  2. It is not possible to encode the language of constructions using only ASCII characters. TIL alphabet contains Greek letters, superscripts, subscripts, etc.
  3. TIL does not specify an interface to ontologies. Any content language has to be limited to using concepts of a specific domain. These concepts are defined in ontologies.
  4. We need one standardized type base. The epistemic type base is not the most convenient for multi-agent systems, because it lacks some very common program types like integers, strings, lists and tuples/sequences. True, the lists and tuples can be defined as molecular, functional types, but for the need of programming simplicity we define them as standard basic types.

The TIL-Script language is a computational variant of TIL. Thus in its full power it is partial, hyper-intensional, typed lambda calculus.

  Valid XHTML 1.0 Transitional Valid CSS! Michal Radecky , Michal Kosinar
FEI, VSB-TU Ostrava, 2009