object oriented programming

Class Definition Related


div.entry h2.title, div.entry h1.title
{ padding-bottom: 22px; background-color: #4e9258 ; font-family: serif; font-size:150%;}

Object-oriented programming (OOP) is a programming paradigm
that uses "objects" – data structures consisting of data fields and
methods together with their interactions – to design applications
and computer programs

Reference/Source: http://en.wikipedia.org/wiki/Object-oriented_programming


Code Exposition


p.first{ color: blue; }
p.second{ color: red; }
<html>
<body>
<p>This is a normal paragraph.</p>

<p class="first">This is a paragraph that uses the p.first CSS code ! </p>
<p class="second">This is a paragraph that uses the p.second CSS code!</p>
...

Reference/Source:
http://www.tizag.com/cssT/class.php

Related Research

Actually, every OOP language should be concurrent in nature.
As previously stated, OOP attempts to model objects found in
the real world, and in the real world many of these objects con-
currently exist and communicate with one another. In the 'ideal'
environment (sort of a virtual machine), every object would have
its own processor as well as its own memory space, allowing
maximum concurrency at all times. Inherently concurrent obje-
cts could even have multiple processors assigned to them.

CONCURRENCY IN CONVENTIONAL OOP LANGUAGES
C-Based Languages. C++ [Str86, WP88] and Objective-C
[Cox86] do not include any constructs for handling concur-
rency. However, since they are extensions of C [KR78], they
can do anything that C can do. Although C itself does not
support concurrency, any extension to C could most likely
be implemented in a C-based OOP language. Additionally,
any scheme in which C is allowed to make a call to the
operating system to start (spawn) a new process could also
be accomplished from a C-based OOP language. Eiffel
[Mey88] does not include any form of concurrency, but they
are reportedly making an effort in this direction.

Lisp-Based Languages. Similar to C-based languages, CLOS
[BDG88, Kee89, Moo89] (an extension of Common Lisp
[Ste84]), does not include any  constructs for handling concurrency
and, unfortunately, Common Lisp does not support concurrency
in any form either. However, as Lisp is a form of functional
programming (which is based on the lambda calculus), some
form of concurrency is possible. In pure functional programming,
a program may be expressed as a single function call, with the
arguments to the function themselves being function calls; the
arguments to these functions can in turn be function calls, etc.
Since the value returned by a pure function is determined solely
by the arguments passed to it, implementations can be devised
which allow for all of the arguments

which are function calls to be executed in parallel. The arguments
of these function calls which are themselves functions can then be
executed in parallel, and so on. This is sometimes referred to as
divide and conquer in that a program is divided up into concurrent
subprograms (the arguments which are function  calls) which can
then be conquered (solved) by again using the divide and conquer
 scheme [Pey87].

Reference/Source:
CONCURRENCY & OBJECT-ORIENTED PROGRAMMING
Michael L. Nelson, Major, USAF
Department of Computer Science
Naval Postgraduate School
Monterey, CA 93943
 

Leave a Reply

Your email address will not be published. Required fields are marked *