US5355496A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for process expression and resolution including a generally and inherently concurrent computer language
Assignee: Theseus Research Inc
•
Filing: 1992-02-14
•
Granted: 1994-10-11
•
Expires: 2012-02-14
Abstract
Abstract A method and system for process expression and resolution is described. A first language structure comprising a possibility expression having at least one definition which is inherently and generally concurrent is provided. Further, a second language structure comprising an actuality expression including a fully formed input data name to be resolved is provided. Furthermore, a third language structure comprising an active expression initially having at least one invocation, the invocation comprising an association with a particular definition and the fully formed input data name of the actuality expression is provided. Subsequently, the process of resolving invocations begins in the active expression with fully formed input data names in relation to their associated definition to produce at least one or both of the following: (1) an invocation with a fully formed input data name and (2) a result data name.
Inventors
- 👤 Karl M. Fant
- 👤 Scott A. Brandt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 17:28
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/30; G06F8/31
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
134 words
A method of process expression and resolution, comprising the steps of: (a) providing a first language structure comprising a possibility expression having at least one definition which is inherently and generally concurrent; (b) providing a second language structure comprising an actuality expression including a fully formed input data name to be resolved; (c) providing a third language structure comprising an active expression initially having at least one invocation, the invocation comprising an association with a particular definition and the fully formed input data name of the actuality expression; and (d) resolving invocations in the active expression with fully formed input data names in relation to their associated definition to produce at least one or both of the following: (1) an invocation with a fully formed input data name and (2) a result data name.
Claim 2
Independent Claim
134 words
A method of process expression and resolution, comprising the steps of: (a) providing a first language structure comprising a possibility expression having at least one definition which is inherently and generally concurrent; (b) providing a second language structure comprising an actuality expression including a fully formed input data name to be resolved; (c) providing a third language structure comprising an active expression initially having at least one invocation, the invocation comprising an association with a particular definition and the fully formed input data name of the actuality expression; and (d) resolving invocations in the active expression with fully formed input data names in relation to their associated definition to produce at least one or both of the following: (1) an invocation with a fully formed input data name and (2) a result data name.
Claim 3
Dependent Claim
43 words
The method of claim 1 wherein the first, the second and the third language structures are derived from a set of production rules selected from the group consisting essentially of: a set of metasymbols, a set of terminals and a set of nonterminals.
Claim 4
Dependent Claim
54 words
The method of claim 2 wherein the set of metasymbols comprise metasymbols selected from the group consisting essentially of: (a) = term to structure equivalence; (b) | OR; (c) * zero or more (post superscript); (d) + one or more (post superscript); (e) *+ zero or one (post superscript); and (f) - followed by.
Claim 5
Dependent Claim
32 words
The method of claim 2 wherein the set of terminals comprise a set of syntax symbols and a set of at least two value symbols disjoint from the set of syntax symbols.
Claim 6
Dependent Claim
40 words
The method of claim 4 wherein the set of syntax symbols comprise syntax symbols selected from the group consisting essentially of: `(`, `)`, `[`, `]`, `{`, `}`, `<`, `>`, `,`, `;`, `*`, `@`, `!`, ` `, `/`, `?`, and `#`.
Claim 7
Dependent Claim
44 words
The method of claim 2 wherein the set of nonterminals comprise nonterminals selected from the group consisting essentially of: phrase, clause, redefinition, resultant, invocation, delayedinvoc, invocname, resultlist, resultlink, actualist, actual, resultref, definition, nonreplicable, body, formalist, namelist, object, objectstruct, formalref, defname, formalname, linkname, and narrative.
Claim 8
Dependent Claim
95 words
The method of claim 2 wherein each production rule comprises either (1) a nonterminal followed by a term to structure equivalence (=) followed by a terminal or a nonterminal, (2) a nonterminal followed by a term to structure equivalence (=) followed by a plurality of terminals delimited by metasymbols, (3) a nonterminal followed by a term to structure equivalence (=) followed by a plurality of nonterminals delimited by metasymbols, or (4) a nonterminal followed by a term to structure equivalence (=) followed by at least one terminal and at least one nonterminal delimited by metasymbols.
Claim 9
Dependent Claim
153 words
The method of claim 7 wherein: (a) the set of metasymbols comprise metasymbols selected from the group consisting essentially of: (i)= term to structure equivalence; (ii) | OR; (iii) * zero or more (post superscript); (iv) + one or more (post superscript); (v) *+ zero or one (post superscript); and (vi) - followed by; (b) the set of terminals comprise: (i) a set of syntax symbols comprising syntax symbols selected from the group consisting essentially of: `(`, `)`, `[`, `]`, `{`, `}`, `<`, `>`, `,`, `;`, `*`, `@`, `!`, ` `, `/`, `?`, and `#`; and (ii) a set of at least two value symbols disjoint from the set of syntax symbols; and (c) the set of nonterminals comprise nonterminals selected from the group consisting essentially of: value, phrase, clause, redefinition, resultant, invocation, delayedinvoc, invocname, resultlist, resultlink, actualist, actual, resultref, definition, nonreplicable, body, formalist, namelist, object, objectstruct, formalref, defname, formalname, linkname, and narrative.
Claim 10
Dependent Claim
99 words
The method claim 8 wherein the first, the second and the third language structures are derived from a set of production rules selected from the group consisting essentially of: (a) value=at least two value symbols (b) phrase=clause | phrase; clause | phrase?clause (c) clause=redefinition*-resultant *-invocation*+-object* (d) redefinition=invocname@(phrase) (e) resultant=linkname<phrase> (f) invocation=invocname (actualist-resultlist) (g) delayedinvoc=invocname#(actualist-resultlist) (h) invocname=invocation|defname-formalref* |defname*+-formalref+ (i) resultlist=resultlink* (j) resultlink=<linkname> (k) actualist=actual|actualist,actual (l) actual=invocation*+-object*-resultref*+ (m) resultref=$linkname (n) definition=defname [(formalist-resultlist)body] (o) nonreplicable=defname@[(formalist-resultlist)body] (p) body=phrase|phrase;definition+ (q) formalist=namelist|namelist,!|!, namelist (r) namelist=formalname|namelist, formalname (s) object=value* |value*-formalref+|objectstruct (t) objectstruct={object}|{phrase}|{objectstruct*} (u) formalref=*formalname|*! (v) defname=value+ (w) formalname=value+ (x) linkname=value+ (y) narrative= any character string /.
Claim 11
Dependent Claim
40 words
The method of claim 1 wherein the step of resolving comprises simultaneously resolving multiple invocations in the active expression until all of the invocations have been resolved and a fully formed result data name is left in the active expression.
Claim 12
Dependent Claim
127 words
A process expression and resolution system, comprising: (a) first language structure comprising a possibility expression having at least one definition which is inherently and generally concurrent; (b) second language structure comprising an actuality expression including a fully formed input data name to be resolved; (c) third language structure comprising an active expression initially having at least one invocation, the invocation comprising an association with a particular definition and the fully formed input data name of the actuality expression; and (d) resolution means for resolving invocations in the active expression with fully formed input data names in relation to their associated definition to produce at least one or both of the following: (1) an invocation with a fully formed input data name and (2) a result data name.
Claim 13
Dependent Claim
127 words
A process expression and resolution system, comprising: (a) first language structure comprising a possibility expression having at least one definition which is inherently and generally concurrent; (b) second language structure comprising an actuality expression including a fully formed input data name to be resolved; (c) third language structure comprising an active expression initially having at least one invocation, the invocation comprising an association with a particular definition and the fully formed input data name of the actuality expression; and (d) resolution means for resolving invocations in the active expression with fully formed input data names in relation to their associated definition to produce at least one or both of the following: (1) an invocation with a fully formed input data name and (2) a result data name.
Claim 14
Dependent Claim
47 words
The process expression and resolution system of claim 11 wherein the first, the second and the third language structures are derived from a set of production rules selected from the group consisting essentially of: a set of metasymbols, a set of terminals and a set of nonterminals.
Claim 15
Dependent Claim
57 words
The process expression and resolution system of claim 12 wherein the set of metasymbols comprise metasymbols selected from the group consisting essentially of: (a)= term to structure equivalence; (b) | OR; (c) * zero or more (post superscript); (d) + one or more (post superscript); (e) *+ zero or one (post superscript); and (f) - followed by.
Claim 16
Dependent Claim
36 words
The process expression and resolution system of claim 12 wherein the set of terminals comprise a set of syntax symbols and a set of at least two value symbols disjoint from the set of syntax symbols.
Claim 17
Dependent Claim
44 words
The process expression and resolution system of claim 14 wherein the set of syntax symbols comprise syntax symbols selected from the group consisting essentially of: `(`, `)`, `[`, `]`, `{`, `}`, `<`, `>`, `,`, `;`, `*`, `@`, `!`, ` `, `/`, `?`, and `#`.
Claim 18
Dependent Claim
48 words
The process expression and resolution system of claim 12 wherein the set of nonterminals comprise nonterminals selected from the group consisting essentially of: phrase, clause, redefinition, resultant, invocation, delayedinvoc, invocname, resultlist, resultlink, actualist, actual, resultref, definition, nonreplicable, body, formalist, namelist, object, objectstruct, formalref, defname, formalname, linkname, and narrative.
Claim 19
Dependent Claim
99 words
The process expression and resolution system of claim 12 wherein each production rule comprises either (1) a nonterminal followed by a term to structure equivalence (=) followed by a terminal or a nonterminal, (2) a nonterminal followed by a term to structure equivalence (=) followed by a plurality of terminals delimited by metasymbols, (3) a nonterminal followed by a term to structure equivalence (=) followed by a plurality of nonterminals delimited by metasymbols, or (4) a nonterminal followed by a term to structure equivalence (=) followed by at least one terminal and at least one nonterminal delimited by metasymbols.
Claim 20
Dependent Claim
157 words
The process expression and resolution system of claim 17 wherein: (a) the set of metasymbols comprise metasymbols selected from the group consisting essentially of: (i)= term to structure equivalence; (ii) | OR; (iii) * zero or more (post superscript); (iv) + one or more (post superscript); (v) *+ zero or one (post superscript); and (vi) - followed by; (b) the set of terminals comprise: (i) a set of syntax symbols comprising syntax symbols selected from the group consisting essentially of: `(`, `)`, `[`, `]`, `{`, `}`, `<`, `>`, `,`, `;`, `*`, `@`, `!`, ` `, `/`, `?`, and `#`; and (ii) a set of at least two value symbols disjoint from the set of syntax symbols; and (c) the set of nonterminals comprise nonterminals selected from the group consisting essentially of: value, phrase, clause, redefinition, resultant, invocation, delayedinvoc, invocname, resultlist, resultlink, actualist, actual, resultref, definition, nonreplicable, body, formalist, namelist, object, objectstruct, formalref, defname, formalname, linkname, and narrative.
Claim 21
Dependent Claim
95 words
The process expression and resolution system of claim 18 wherein the first, the second and the third language structures are derived from a set of production rules selected from the group consisting essentially of: (a) value=at least two value symbols (b) phrase=clause|phrase;clause|phrase?clause (c) clause=redefinition*-resultant*-invocation*+-object* (d) redefinition=invocname@(phrase) (e) resultant=linkname<phrase> (f) invocation=invocname(actualist-resultlist) (g) delayedinvoc=invocname#(actualist-resultlist) (h) invocname=invocation|defname-formalref* |defname*+-formalref+ (i) resultlist=result link* (j) resultlink=<linkname> (k) actualist=actual|actualist,actual (l) actual=invocation*+-object *-resultref*+ (m) resultref=$linkname (n) definition=defname[(formalist-resultlist)body] (o) nonreplicable=defname@[(formalist-resultlist)body] (p) body=phrase|phrase;definition+ (q) formalist=namelist|namelist,!|!,namelist (r) namelist=formalname|namelist,formalname (s) object=value*|value*-formalref+|objectstruct (t) objectstruct={object}|{phrase}|{objectstruct*} (u) formalref=*formalname|*! (v) defname=value+ (w) formalname=value+ (x) linkname=value+ (y) narrative= any character string /.
Claim 22
Dependent Claim
45 words
The process expression and resolution system of claim 11 wherein the resolution means comprises means for simultaneously resolving multiple invocations in the active expression until all of the invocations have been resolved and a fully formed result data name is left in the active expression.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-10-10 | 1998-04-11 | 1998-10-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-10-10 | 2002-04-11 | 2002-10-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-10-10 | 2006-04-11 | 2006-10-11 | $7700.00 | Window Closed / Lapsed |