R. Morrison, On the development of algol, Ph.D. Thesis, University of St. Andrews, 1979  Home/Search   Document Details and Download   Summary   Related Articles   Check

....c S E A C false JUMPF c S E A C JUMPF c The unconditional jump causes an immediate branch to the given code address, c. S E A C JUMP c S E A C JUMP c Logical conjunction and disjunction are also implemented using jump instructions. Conjunction is implemented using the JUMPFF [11,7] instruction which examines the top item on the stack. If it is false, a jump is made to the given location. Otherwise, the top item is popped and the next instruction is executed. JUMPFF c:C , A , true:S , E C , A , S , E JUMPFF c:C , A , false:S , E c , A , false:S , E S E ....

....objects directly rather than keeping a pointer to them. Some static analysis may be performed which can tell the compiler when this pertains. In our implementation, we use two stacks, one for pointers and one for non pointers, based on those of the S algol abstract machine and its descendants[7,8,9]. It is interesting to note that the G machine[4] also has two stacks for objects and values. We also use two argument registers, one for pointer arguments and one for non pointer (call by value) arguments. There are two advantages gained with this implementation technique. Firstly, functions ....

R. Morrison, On the development of algol, Ph.D. Thesis, University of St. Andrews, 1979

....Work 1.6.1 Persistence The concept of persistence can be traced back to investigations by Atkinson [Atk78] into the integration of databases and programming languages. This led on to the production of the persistent language PS algol [ACC81] which essentially added persistence to the S algol [Mor79] programming language. The PS algol persistent store has been implemented by several systems, including: the CMS chunk management system [ACC83] which provided a simple transaction mechanism, concurrency control and manipulation of arbitrary sized chunks of data; the POMS persistent object ....

Morrison, R. "On the Development of Algol". Ph.D. Thesis, University of St Andrews (1979).

....a root object. The persistent store is stable, that is, it is transformed atomically from one consistent state to the next. Execution against the persistent store is always restarted from the last stable state. The ProcessBase language is in the algol tradition as were its predecessors S algol [Mor79], PS algol [PS88] and Napier88 [MBC 96] Following the work of Strachey [Str67] and Tennent [Ten77] the languages obey the principles of correspondence, abstraction and type completeness. This makes for languages with few defining rules allowing no exceptions. It is the belief of the designers ....

....possessed by values, such as the operations defined over them. These sets or types partition the value space. The sets may be predefined, like int, or they may be formed by using one of the predefined type constructors, like view. The constructors obey the Principle of Data Type Completeness [Str67, Mor79]. That is, where a type may be used in a constructor, any type is legal without exception. This has two benefits. Firstly, since all the rules are very general and without exceptions, a very rich type system may be described using a small number of defining rules. This reduces the complexity of ....

[Article contains additional citation context not shown here]

Morrison, R. "On the Development of Algol". Ph.D. Thesis, University of St Andrews (1979).

....program and interface generation facilities. The 30 development of object oriented facilities in the SQL3 standard [Kulkarni, 1994] corresponds to this approach. The first version of PS algol [Atkinson, et al. 1983] was an example of this second approach, as it began by extending S algol [Morrison, 1979]. Similarly, Pascal R was initially described as the addition of relational capabilities and long term storage to Pascal [Schmidt, 1977] There are, however, fundamental differences between these two examples: the former set out to leave the language s type system unchanged and hence to achieve ....

Morrison, R., 1979. On the Development of Algol. Ph.D. Thesis, University of St Andrews.

....of stability and visibility in commitment are orthogonal [Kra85, AMP86, MBB 89] The entire computation including the state of the programs, threads and transactions is stable and recoverable after a system crash. The Napier88 language is in the algol tradition as were its predecessors S algol [Mor79] and PS algol [PS88] Following the work of Strachey [Str67] and Tennant [Ten77] the languages obey the principles of correspondence, abstraction and type completeness. This makes for languages with few defining rules allowing no 6 exceptions. It is the belief of the designers that such an ....

....are polymorphic procedures and abstract data types, allow values to belong to more than a single type. The sets may be predefined, like integer, or they may be formed by using one of the predefined type constructors, like structure. The constructors obey the Principle of Data Type Completeness [Str67, Mor79]. That is, where a type may be used in a constructor, any type is legal without exception. This has two benefits. Firstly, since all the rules are very general and without exceptions, a very rich type system may be described using a small number of defining rules. This reduces the complexity of ....

[Article contains additional citation context not shown here]

Morrison, R. "On the Development of Algol". Ph.D. Thesis, University of St Andrews (1979).

No context found.

R. Morrison "On the Development of Algol" Ph.D. Thesis, University of St Andrews (1979).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC