The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 16, 2010
Filed:
Mar. 15, 2005
David C. Mitchell, Orem, UT (US);
Dale K. Mitchell, Orem, UT (US);
Bruce P. Mitchell, Orem, UT (US);
Scott E. Hamilton, Orem, UT (US);
David C. Mitchell, Orem, UT (US);
Dale K. Mitchell, Orem, UT (US);
Bruce P. Mitchell, Orem, UT (US);
Scott E. Hamilton, Orem, UT (US);
Bungee Labs, Inc., Orem, UT (US);
Abstract
A method and system for instructing a computer in a system of a declarative computer programming language. Unlike traditional declarative languages, the programming language may be neither relational nor functional, neither procedural nor imperative. The declarative elements may be defined as a meta-description of logic and data. The basic morphology of this meta-description may be a data construct known as a Lattice. Lattices derive declarative power from their inclusion of 'Attributes' and 'Sites'. Attributes are declarative properties that determine the internal behavior of a Lattice; while Sites are declarative data access points that establish the external relationship a Lattice may have with other Lattices, Lattice Containers, and Lattice Elements. Each of these data constructs are highly adaptable, recursive, and expandable, providing the entire language with a degree of flexibility that facilitates a very high level of abstraction.