Components of Theory of Programming Languages

Many regular programming have components developed from this field. For example:
Performance:  Inspired by the idea of λ-abstraction and everywhere in modern programming language. Modern programming languages include the concept methods in their semantics. Performances that to be seen as individualistic programs that can interact with the main program. Consequently, they can be operated as a unit and large procedures can be built up from smaller ones. This is an impressive way to manage complex software systems.
Iterations: Primitive iteration (for loops) and general recursion (while loops) was introduced Recursion theory, but the universal modern high-level language. Recursion theory about the basic concept of what subsets of natural number or other known countable domain can be specify, and how effectively complex so defined set. The basic concept is recursive and recursively calculable sets, but the world of the range studied in recursion theory continues these sets. The concepts associated with setting, definability by Diophantine acts by Turing machine and recursion.
Kinds: Developed in the context of pure calculus such as λ-calculus and combinational logic but further research and programming everywhere today. A security typed language provides overall display groups of data security not only in certain areas, but during the period of calculation. To the duration that a system can be described if a program or a set of communication programs written in a security typed language, the architectural nature of the kind of system increases this protection the whole system.