|
1. |
Compact coding of syntax tables |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 909-919
Jose Felipe Contla,
Preview
|
PDF (596KB)
|
|
摘要:
AbstractA method for constructing compact syntax tables in three steps is presented. First, the rules of a grammar are mapped into a syntax graph, from which five syntactic forms are defined. Secondly, the grammar expressed in these syntactic forms is mapped into data structures. Finally, from the data structures, the compact syntax table of the grammar is constructed.
ISSN:0038-0644
DOI:10.1002/spe.4380141002
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
2. |
Top‐down design within a functional environment |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 921-930
Philip Leith,
Preview
|
PDF (489KB)
|
|
摘要:
AbstractThis paper describes a design tool for use within the INTERLISP1 environment. The design tool, DT, is based upon the design methodology described by the general term, top‐down design and is novel in that it attempts to apply this design method to a functional programming environment. Also novel is the method whereby the generation of the design can occur in parallel with the implementation of the design. This allows a design process more in accord with the needs of functional programmer
ISSN:0038-0644
DOI:10.1002/spe.4380141003
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
3. |
Distributing and revoking access authorizations on abstract objecs: A capability approch |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 931-943
P. Corsini,
G. Frosini,
L. Lopriore,
Preview
|
PDF (753KB)
|
|
摘要:
AbstractIn this paper a capability addressing environment is presented, based on the concept of extended capability. First of all it is shown that such an environment is well suited for implementing objects of abstract type. Then the problem of distributing and revoking access authorizations on abstract objects is considered and an efficient solution is presented. The revocation mechanism results in being selective, transitive and deferred.
ISSN:0038-0644
DOI:10.1002/spe.4380141004
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
4. |
Implementation of the database programming language modula/R on the personal computer lilith |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 945-956
Manuel Reimer,
Preview
|
PDF (791KB)
|
|
摘要:
AbstractModula/R is a database programming language that integrates the programming language Modula‐2 and the relational database model. This paper describes the language concepts of Modula/R and its implementation on the personal computer Lilith within the database project LID AS. A transaction concept as an extension of the procedure concept is integrated into Modula/R to support its implementation in a multi‐user environment with access to shared distributed databases through a network of personal comput
ISSN:0038-0644
DOI:10.1002/spe.4380141005
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
5. |
An experiment in language design for distributed systems |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 957-971
D. Crookes,
J. W. G. Elder,
Preview
|
PDF (809KB)
|
|
摘要:
AbstractThis paper describes a recent experiment in the design, implementation and application of a programming language designed specifically for distributed systems. The fundamental nature of such systems is used in the derivation of an experimental language, which is described and illustrated. Having outlined an implementation, the project is evaluated and some of the more significant findings are reported. In particular, the paper discusses (and argues for) an explicit language facility for expressing the distribution of a program over an actual system.
ISSN:0038-0644
DOI:10.1002/spe.4380141006
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
6. |
Polymorphic programming I. Another language designed on semantic principles |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 973-997
David M. Harland,
Hamish I. E. Gunn,
Preview
|
PDF (1445KB)
|
|
摘要:
AbstractWe wish to illustrate the potential of a thus far little explored avenue of programming language design–‐namely the employment of types and routines as values in their own right within the framework of an Algol. In this first paper we pay particular attention to the development of highly orthogonal self‐initializing data structures, and to the advantageous expressive power of polymorphism when combined with routine values so as to provide abstract data structures. The emphasis is on the design phase, rather than on the implementation details or precise syntactic structure of the envisaged language. A second, companion paper† discusses the design of a high‐level orthogonal abstract architecture intended to support polymorphic languages in which routines are ‘first class’ values. The relationship of the abstract machine architecture to the programming languagevis‐a‐visthe ‘semantic gap’ is then discussed from the viewpoint of compiling programs which are strongly typed while exploiting polymorphism. We feel that polymorphism is essential if truly general purpose programs, software tools, are to be written easily. The research reported herein is an effort toward
ISSN:0038-0644
DOI:10.1002/spe.4380141007
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
7. |
A hierarchical exception handler binding mechanism |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 999-1003
Lee R. Nackman,
Russell H. Taylor,
Preview
|
PDF (421KB)
|
|
摘要:
AbstractA mechanism is proposed for binding exception handlers to exceptions. Hierarchical exception classes can be defined and changed during program execution. In addition, the action taken when an exception of a particular class is raised depends upon the type of the current exception handler for that class. The mechanism can be implemented in programming languages that allow runtime determination of an identifier's binding; most dynamically scoped programming languages meet this criterion.
ISSN:0038-0644
DOI:10.1002/spe.4380141008
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
8. |
Applying Mccabe's complexity measure to multiple‐exit programs |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page 1004-1007
Warren A. Harrison,
Preview
|
PDF (312KB)
|
|
摘要:
AbstractThe traditional short‐cut calculation for McCabe's complexity metric, π+1, does not handle the case of multiple‐exit flowgraphs. An alternative short‐cut calculation is presented that allows the metric to be applied to multiple‐exit
ISSN:0038-0644
DOI:10.1002/spe.4380141009
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
9. |
Masthead |
|
Software: Practice and Experience,
Volume 14,
Issue 10,
1984,
Page -
Preview
|
PDF (50KB)
|
|
ISSN:0038-0644
DOI:10.1002/spe.4380141001
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
|