Nature emulation oriented programming method

• US 20030084427A1
• Filed: 10/30/2001
• Published: 05/01/2003
• Est. Priority Date: 10/30/2001
• Status: Abandoned Application

• Current Assignee: Bryan Hunt
• Original Assignee: Bryan Hunt
• Inventors: Hunt, Bryan
• Application Number:
  US10/013,054
• Publication Number:
  US 20030084427A1
• Time in Patent Office: Days
• US Class Current: 717/116
• CPC Class Codes: G06F 9/465 Distributed object oriented systems remote method invocation [RMI] G06F9/548

Abstract

Nature Emulation Oriented Programming (NEOP) uses five categories: Objects, Processors, Critters, Interfaces, and Sets. An object in NEOP differs from an object oriented programming object in that it does not have properties, only private variables. The properties can be considered an interface. Therefore an OOP Object can be considered a NEOP Object plus a NEOP interface. NEOP is patterned after nature. The method includes identifying attributes and scopes of said attributes, functions and scopes of said functions and notifications, for each of machine, critter and interface elements and then determining inherited, needed groupings, and appropriate set relationships between the elements. Finally, at least one startup interface is made, meeting the programming objective.

Claims

1. A programming method comprising the steps of:

a) selecting a program objective;

b) creating portions of a program as elements including any of;

objects, interfaces, machines, and critters;

c) for each said object element;

c2) identifying attributes and scopes of said attributes;

c2) identifying functions and scopes of said functions;

c3) identifying notifications;

c4) identifying associated said sub-objects;

c5) identifying associated said elements;

d) for each said machine element;

d1) identifying inputs and outputs;

d2) identifying data processing methods;

d3) identifying notifications;

d4) identifying operational variables and operational methods;

d5) identifying associated said elements;

e) for each said critter element;

e1) identifying actions including work associations and control targets;

e2) identifying frequency of acts relative to a critter domain;

e3) identifying associated said elements;

f) for each of the said interfaces elements;

f1) identifying allowable roles;

f2) identifying available methods;

f3) identifying interface events;

f4) identifying associated said elements;

g) determining and naming common methods, properties and interface events between the elements;

h) determining inherited relationships between the elements;

i) determining needed groupings of the elements;

j) determining appropriate sets of the groupings; and

k) determining at least one startup interface meeting the programming objective.

2. The method of claim 1 wherein step (c5) is completed using steps (d), (e) and (f).

3. The method of claim 1 wherein step (d5) is completed using steps (c), (e) and (f).

4. The method of claim 1 wherein step (e3) is completed using steps (c), (d) and (f).

5. The method of claim 1 wherein step (f4) is completed using step (c), (e) and (d).