Language scoping for modular, flexible, concise, configuration descriptions

• US 5,500,881 A
• Filed: 07/12/1993
• Issued: 03/19/1996
• Est. Priority Date: 07/12/1993
• Status: Expired due to Term

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Hanna, Christine B., Levin, Roy
• Primary Examiner(s): Heckler, Thomas M.
• Application Number:
  US08/090,844
• Time in Patent Office: 981 Days
• Field of Search: 395/700
• US Class Current: 717/141
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management

Abstract

The problems of efficiently building a large software system are solved by the present invention of language scoping for effective configuration descriptions. A software system is defined by a tree of system models which are written in a functional language. The functional language provides a unique combination of static and dynamic scoping. This combination is required to write modular, flexible, and concise, yet complete, configuration descriptions.

Claims

1. In a computer system for processing a computer program, said computer program including a plurality of functions including a plurality of variables, a method for defining said variables comprising the steps of:

A) storing in a static scope a first plurality of variable names corresponding to a first plurality of said variables and a plurality of first values associated with said first plurality of variable names;

B) storing a dynamic scope a second plurality of variable names corresponding to a second plurality of said variables and a plurality of second values associated with said second plurality of said variable names;

C) binding at least one of said first and second values to each said variable during evaluation of said functions, said binding step including, with respect to each said variable, the steps of

i) searching for the variable name corresponding to said variable in said static scope and, if found, binding to said variable the one of said first values associated with said corresponding variable name in said static scope; and

ii) if said corresponding variable name is not found in said static scope, searching for said corresponding variable name in said dynamic scope and, if found, binding to said variable the one of said second values associated with said variable name in said dynamic scope,

whereby said static scope takes precedence over said dynamic scope in evaluating said functions.

2. The method in accordance with claim 1, further comprising the steps of:

A) associating each said variable name of said first plurality of said variable names with at least one of said first values as of a point in said computer program whereat the function including the variable corresponding to said variable name is defined; and

B) associating each said variable name of said second plurality of said variable names with at least one of said second values associated therewith as of a point in said computer program whereat the function including the variable corresponding to said variable name is applied.

3. The method in accordance with claim 1, wherein the first value associated with said variable name when found in said static scope is bound to said corresponding variable by replacing said corresponding variable during processing of at least one of said functions with said associated first value, and wherein the second value associated with said variable name when found in said dynamic scope is bound to said corresponding variable by replacing said corresponding variable during processing of at least one of said functions with said associated second value.

4. The method in accordance with claim 1, further comprising the step of updating said static scope and said dynamic scope when said first and second values are bound to said variables and when, during processing of said computer program, said variable names are assigned new values.

5. A method of operating a computer system comprising the steps of:

A) processing a computer program in a processor, during which a plurality of program values are assigned to a plurality of program variables for evaluating a plurality of functions included in said program;

B) storing a plurality of name/value pairs in a memory, each name/value pair comprising a variable name and an associated value, said storing step including the steps of

i) storing a first set of said name/value pairs in a static scope, said name/value pairs of said first set including values for the associated variable names that are defined when, during processing of said program, a first set of said functions is defined, said first set of said functions including a first plurality of said program variables that correspond to said variable names of said first set of name/value pairs; and

ii) storing a second set of said name/value pairs in a dynamic scope, said name/value pairs of said second set including values for the associated variable names that are defined when, during processing of said program, a second set of said functions is applied, said second set of said functions including a second plurality of said program variables that correspond to said variable names of said second set of name/value pairs; and

C) said processing step including, for each program variable, the steps of

(i) checking whether a corresponding name/value pair is stored in said static scope means, and

(ii) if corresponding name/value pair is not stored in said static scope, both retrieving a value of one of said name/value pairs corresponding to said program variable from said dynamic scope, and binding said retrieved value as said program value to said program variable.

6. The method in accordance with claim 5, wherein said processing step further includes the steps of causing said assigned values and corresponding variable names associated with said program variables to be stored in said memory as corresponding name/value pairs, and using said variable names to retrieve said corresponding values from said stored name/value pairs for use as program values during processing of said program.

7. The method in accordance with claim 5, wherein said binding step comprises the steps of replacing said program variable with said retrieved value in evaluating said function, and updating said static and dynamic scope means to reflect said evaluation.

8. The method in accordance with claim 5, further comprising the step of updating said static scope means and said dynamic scope means when each of said retrieved values are bound to said program variables and when, during processing of said computer program, said program variables are assigned new values.

9. The method in accordance with claim 5, wherein said first set of functions includes functions of said second set.

10. A computer system comprising:

A) processing means for processing a computer program, during which a plurality of program values are assigned to a plurality of program variables for evaluating a plurality of functions included in said program;

B) a memory for storing a plurality of name/value pairs, each comprising a variable name and an associated value, said memory including

i) static scope means for storing a first set of said name/value pairs for which the values for the associated variable names are defined when, during processing of said program by said processing means, a first set of said functions is defined, said first set of said functions including a first plurality of said program variables that correspond to said variable names of said first set of name/value pairs; and

ii) dynamic scope means for storing a second set of said name/value pairs for which the values for the associated variable names are defined when, during processing of said program by said processing means, a second set of said functions is applied, said second set of said functions including a second plurality of said program variables that correspond to said variable names of said second set of name/value pairs; and

C) during said processing, for each program variable, said processing means checks whether a corresponding name/value pair is stored in said static scope means, and if said static scope means does not store a corresponding name/value pair, said processing means both retrieves a value of one of said name/value pairs corresponding to said program variable from said dynamic scope, and binds said retrieved value as said program value to said program variable.

11. The computer system in accordance with claim 10, wherein said processing means comprises an evaluator.

12. The computer system in accordance with claim 11, wherein said evaluator binds said retrieved value to said program variable by replacing said program variable with said retrieved value in evaluating said function, and updating said static and dynamic scope means to reflect said evaluation.

13. The computer system in accordance with claim 10, wherein, if said static scope means stores a corresponding name/value pair, said processing means both retrieves a value of one of said name/value pairs corresponding to said program variable from said static scope, and binds said retrieved value as said program value to said program variable.

14. The computer system in accordance with claim 13, wherein said processing means updates said static scope means and said dynamic scope means when each of said retrieved values are bound to said program variables and when, during processing of said computer program, said program variables are assigned new values.

15. The computer system in accordance with claim 10, wherein said processing means looks up a variable name associated with each said program variable in said static scope means, and, if a corresponding name/value pair is not found in said static scope means for any of said program variables, looks up the variable names for said any program variables in said dynamic scope means.

16. The computer system in accordance with claim 10, wherein said first set of functions includes functions of said second set.