Showing papers on "Orthogonality (programming) published in 1991"
26 Aug 1991
TL;DR: A new abstract machine which implements lazy narrowing is presented, which consists of a conventional stack based architecture like the one used for imperative languages and almost orthogonal extensions of this core implement the different concepts of functional logic languages.
Abstract: Lazy narrowing has been proposed as the operational model of functional logic languages. This paper presents a new abstract machine which implements lazy narrowing. The core of this machine consists of a conventional stack based architecture like the one used for imperative languages. Almost orthogonal extensions of this core implement the different concepts of functional logic languages. This simplifies the machine design to a great deal and reduces the instruction set which has been particularly designed to support the application of standard code generation techniques. By its orthogonality, it is achieved that unused features introduce only minimal overhead. As a result, when performing ground term reduction the machine enjoys the same characteristics as efficient graph reduction machines.
27 citations
TL;DR: The authors presented a challenge to advanced inorganic chemistry students that will enhance their degree of understanding of the great orthogonality theorem, which was a challenge for the first time in the 1990s.
Abstract: These authors present a challenge to advanced inorganic chemistry students that will enhance their degree of understanding of the great orthogonality theorem.
2 citations