Loading...
Please wait, while we are loading the content...
Similar Documents
Towards a formal computation model of associative logic programming.
| Content Provider | CiteSeerX |
|---|---|
| Author | Bansal, Arvind K. |
| Abstract | Machine and Its Behavior The compilation model maps the program as a pair of associations of the form ! L L P L A 1 L ,..., L AN , L L C ?. The first element of the pair represents D-bag of clause-head tuples, and second element of the pair represents the clause-body tuples. L is the D-bag of labels connecting clauseheads to low level code of the corresponding clause-body, P is the D-bag of procedure-names, A I is the D-bag of I th argument in set of the clause-heads in a program, C is the D-bag of a sequence of compiled instructions corresponding to set of clause-bodies in the program such that each element c i 2 C is a sequence of instructions corresponding to one clause-body. The computation model has following components: 1. an associative data parallel abstract instruction set, 2. an associative representation of clause-heads, 3. an associative heap to store the bindings of the output variables, shared variables, and scalar bindings. 4. a data parallel binding environm... |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Formal Computation Model Associative Logic Programming Scalar Binding Associative Representation Clause-body Tuples Associative Data Parallel Abstract Instruction Output Variable Clause-head Tuples Second Element First Element Associative Heap Compiled Instruction Computation Model Corresponding Clause-body Compilation Model Data Parallel Binding Environm Low Level Code |
| Content Type | Text |
