Basic | Functional | Declarative | Imperative | Reflective | Communicative | Directive | Hybrid | Facets

Declarative Action Notation

Actions| Yielders| Data

Actions

bind T to Y | unbind T | rebind | produce Y | furthermore A | A₁ moreover A₂ | A₁ hence A₂ | A₁ before A₂ |

• All primitive declarative actions:
  
  
  • Do not commit.
    
    
  • Give no transients.
    
    
  • Make no changes to storage.
    
    
  • Do not communicate.
    
    
  • Redirect no bindings.
    
    
• All declarative action combinators are:
  
  
  • Functionally conducting (see the basic action A₁ and A₂).
    
    
• bind T to Y: a primitive declarative action, where T is a token and Y is a yielder of bindable data. Represents creating a piece of scoped information.
  
  
  • Indivisible. Completes when Y yields data of sort bindable. Fails otherwise.
    
    
  • Produces the binding of the token T to the bindable data.
    
    
• unbind T: a primitive declarative action, where T is a token. Represents hiding a piece of scoped information, making a hole in its scope.
  
  
  • Indivisible. Completes.
    
    
  • Produces the binding of the token T to the datum unknown.
    
    
• rebind: a primitive declarative action. Represents propagation of scoped information. Unit for the declarative action A₁ hence A₂.
  
  
  • Indivisible. Always completes.
    
    
  • Produces all received bindings.
    
    
• produce Y: a primitive declarative action. Represents production of reified scoped information.
  
  
  • Indivisible. Completes when Y yields a datum of sort bindings.
    
    
  • Produces the bindings yielded by Y.
    
    
• furthermore A: a declarative combination of the action A. Represents propagating the received bindings, but letting bindings produced by A take precedence when there is a conflict.
  
  
  • Basically as A.
    
    
  • Functionally as A.
    
    
  • Declaratively as rebind moreover A.
    
    
• A₁ moreover A₂: a declarative combination of actions A₁ , A₂. Like A₁ and A₂, but gives priority to bindings produced by A₂.
  
  
  • Basically interleaving (see the basic action A₁ and A₂).
    
    
  • Declaratively overlaying: The bindings received by the combination of A₁ , A₂ are received by both A₁ , A₂. On normal termination the bindings produced by A₁, overlaid with those produced by A₂, are produced by the combined action.
    
    
• A₁ hence A₂: a declarative combination of actions A₁ , A₂. Represents passing on scoped information, restricting the bindings received by A₂.
  
  
  • Basically sequencing (see the basic action A₁ and then A₂).
    
    
  • Declaratively composing: The bindings received by the combination of A₁ , A₂ are received by A₁. Only the bindings produced by A₁ are received by A₂ (provided that it is performed). Only the bindings produced by A₂ are produced by the combined action.
    
    
• A₁ before A₂: a declarative combination of actions A₁ , A₂. Represents accumulating scoped information.
  
  
  • Basically sequencing (see the basic action A₁ and then A₂).
    
    
  • Declaratively accumulating: The bindings received by the combination of A₁ , A₂ are received by A₁. The bindings received by the combined action, overlaid with the bindings produced by A1, are received by A₂ (provided that it is performed). On normal termination the bindings produced by A₁, overlaid with those produced by A₂, are produced by the combined action.
    
    

Yielders

current bindings | the d bound to T | Y₁ receiving Y₂

• current bindings: a yielder of bindings maps. Yields the collection of bindings received by its evaluation.
  
  
• the d bound to T: a yielder of bindable data, where d is a sort of data and T is a token. Yields the data of sort d to which T is bound by the received bindings, if any.
  
  
• Y₁ receiving Y₂: a yielder, where Y₂ is a yielder of binding maps. Represents evaluation of Y₁ using reified bindings instead of current bindings.
  
  

bindings | token | bindable | unknown | known b

• bindings: a subsort of map. Its individuals represent collections of associations between tokens and bindable (or unknown) individuals. (Further entities, called indirections, are associated with tokens in connection with the directiveactions)
  
  
• token: a subsort of distinct-datum. Left unspecified, as it depends on the variety of identifiers of a programming language. (Usually, it is a subsort of string.)
  
  
• bindable: a subsort of data. Left open, as it depends on the variety of scoped information processed by the programs of a programming language.
  
  
• unknown: an individual datum, not of sort bindable. A binding of a token to unknown is used to conceal a binding of the token to other data.
  
  
• known b: the restriction of the bindings b obtained by omitting bindings of tokens to unknown.