Winâ Foy : functional object-oriented programming language

This thesis will introduce a new strongly typed programming language utilizing Self types, named Win--*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a programming language is based on deficiencies found in programming languages that support both Self types and subtyping. Subtyping is a concept that is taken for granted by most software engineers programming in object-oriented languages. Subtyping supports subsumption but it does not support the inheritance of binary methods. Binary methods contain an argument of type Self, the same type as the object itself, in a contravariant position, i.e. as a parameter. There are several arguments in favour of introducing Self types into a programming language (11. This rationale led to the development of a relation that has become known as matching [4, 5). The matching relation does not support subsumption, however, it does support the inheritance of binary methods. Two forms of matching have been proposed (lJ. Specifically, these relations are known as higher-order matching and I-bound matching. Previous research on these relations indicates that the higher-order matching relation is both reflexive and transitive whereas the f-bound matching is reflexive but not transitive (7]. The higher-order matching relation provides significant flexibility regarding inheritance of methods that utilize or return values of the same type. This flexibility, in certain situations, can restrict the programmer from defining specific classes and methods which are based on constant values [21J. For this reason, the type This is used as a second reference to the type of the object that cannot, contrary to Self, be specialized in subclasses. F-bound matching allows a programmer to define a function that will work for all types of A', a subtype of an upper bound function of type A, with the result type being dependent on A'. The use of parametric polymorphism in f-bound matching provides a connection to subtyping in object-oriented languages. This thesis will contain two main sections. Firstly, significant details concerning deficiencies of the subtype relation and the need to introduce higher-order and f-bound matching relations into programming languages will be explored. Secondly, a new programming language named Win--*Foy Functional Object-Oriented Programming Language has been created, along with a suitable user interface, in order to facilitate experimentation by programmers regarding the matching relation. The construction of the programming language and the user interface will be explained in detail.

Scottish Rite (Masonic Order) French Language Collection, 1787-1825, 1907, n.d.

The origins of the Scottish Rite of Freemasonry can be traced to France around 1754, when a Chapter of Claremont was founded in Paris. Initially this chapter had seven degrees, but by 1758 there were twenty-five degrees, known as the Rite of Perfection. In 1761, Stephen Morin was appointed to introduce the Rite into the New World. He began with Kingston, Jamaica and San Domingo. Further establishments were made in New Orleans, LA(1763); Albany, NY (1767); Philadelphia, PA (1782); and Charleston, SC (1783). In order to improve the disorganized state of the degrees in Europe, “Grand Constitutions” were enacted in 1786. These Constitutions formally brought into existence the “Ancient and Accepted Scottish Rite”. None of the degrees of the Scottish Rite would seem to have origins in Scotland. “Scottish” is translated from the French word “Ecossais”, which is found in some of the French titles of some of the degrees of the Rite of Perfection. It is possible that the Scottish connection is a result of the involvement of a Scotsman, Andrew Michael Ramsey, who may have devised some of the degrees.