Institutional Repository

The Sequence Abstraction in the Implementation of Emily

Show simple item record Currin, Desmond C. Bishop, B.M. Varol, Y. L. 2018-05-21T15:01:58Z 2018-05-21T15:01:58Z 1979
dc.identifier.citation D.C Currin, J M. Bishop and Y L. Varol (1979) The Sequence Abstraction in the Implementation of Emily. Quaestiones Informaticae Vol 1 No 2, 1979 en
dc.identifier.issn 0254-2757
dc.description.abstract Emily is a general purpose computer aided lllstruction language with a novel nnplementatlon At the user s level, Emily consists of two languages an mstruction language, 1s used by authors to prepare lessons and a command language for controlling access to lessons, registenng users and other system functions In nnplementation, such a system poses the problem of stonng and controllmg a wide vanety of data types under program control and on backmg store Both storage and control are handled by a data base manager whose basic urut 1s a sequence Tlu.s paper gives a bnef descnption of the Emily languages and then concentrates on the sequence abstraction It 1s shown how tlu.s provides an effective mterface between concepts m the level implementation language (Pascal) and the details of the realization of many different data types m a smgle system Fmally, the mtemal representation of sequences 1s discussed en
dc.language.iso en en
dc.publisher Computer Society of South Africa (on behalf of SAICSIT) en
dc.title The Sequence Abstraction in the Implementation of Emily en
dc.type Article en
dc.description.department School of Computing en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


My Account