The Persistent Abstract Machine

RCH Connor; AL Brown; R Carrick; Alan Dearle; Ronald Morrison

doi:10.1007/978-1-4471-3173-1_24

The Persistent Abstract Machine

RCH Connor, AL Brown, R Carrick, Alan Dearle, Ronald Morrison

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The Persistent Abstract Machine is an integral part of a layered architecture model to support the Napier language. It interfaces cleanly with a persistent store, and allows persistence to be implemented without difficulty in a high-level language. The heap based storage mechanism of the Persistent Abstract Machine is designed to support the block retention nature of the Napier language. This allows the implementation of first class procedures and modules in programming languages with the minimum of effort. A primitive type system within the machine contains just enough information to allow machine instructions which behave differently according to the dynamic type of their operands. This type system, in conjunction with the block retention architecture, may be used to great effect to provide a fast implementation of polymorphic procedures, abstract data types, inheritance and bounded universal quantification.

Original language	English
Title of host publication	Persistent object systems
Subtitle of host publication	Proceedings of the third international workshop, 10–13 January 1989, Newcastle, Australia
Editors	John Rosenberg, David Koch
Place of Publication	London
Publisher	Springer
Pages	353-366
ISBN (Electronic)	9781447131731
ISBN (Print)	9783540196266
DOIs	https://doi.org/10.1007/978-1-4471-3173-1_24
Publication status	Published - 1989
Event	Persistent Object Systems Third International Workshop (POS3) - Newcastle, Australia Duration: 10 Jan 1989 → 13 Jan 1989 Conference number: 3

Publication series

Name	Workshops in Computing
Publisher	Springer
ISSN (Print)	1431-1682

Conference

Conference	Persistent Object Systems Third International Workshop (POS3)
Abbreviated title	POS
Country/Territory	Australia
City	Newcastle
Period	10/01/89 → 13/01/89

Access to Document

10.1007/978-1-4471-3173-1_24

Cite this

@inproceedings{19192b0b0e85484eb59d16d7f586eda3,

title = "The Persistent Abstract Machine",

abstract = "The Persistent Abstract Machine is an integral part of a layered architecture model to support the Napier language. It interfaces cleanly with a persistent store, and allows persistence to be implemented without difficulty in a high-level language. The heap based storage mechanism of the Persistent Abstract Machine is designed to support the block retention nature of the Napier language. This allows the implementation of first class procedures and modules in programming languages with the minimum of effort. A primitive type system within the machine contains just enough information to allow machine instructions which behave differently according to the dynamic type of their operands. This type system, in conjunction with the block retention architecture, may be used to great effect to provide a fast implementation of polymorphic procedures, abstract data types, inheritance and bounded universal quantification.",

author = "RCH Connor and AL Brown and R Carrick and Alan Dearle and Ronald Morrison",

year = "1989",

doi = "10.1007/978-1-4471-3173-1_24",

language = "English",

isbn = "9783540196266",

series = "Workshops in Computing",

publisher = "Springer",

pages = "353--366",

editor = "John Rosenberg and David Koch",

booktitle = "Persistent object systems",

address = "Netherlands",

note = "Persistent Object Systems Third International Workshop (POS3), POS ; Conference date: 10-01-1989 Through 13-01-1989",

}

Connor, RCH, Brown, AL, Carrick, R, Dearle, A & Morrison, R 1989, The Persistent Abstract Machine. in J Rosenberg & D Koch (eds), Persistent object systems: Proceedings of the third international workshop, 10–13 January 1989, Newcastle, Australia. Workshops in Computing, Springer, London, pp. 353-366, Persistent Object Systems Third International Workshop (POS3), Newcastle, New South Wales, Australia, 10/01/89. https://doi.org/10.1007/978-1-4471-3173-1_24

The Persistent Abstract Machine. / Connor, RCH; Brown, AL; Carrick, R et al.
Persistent object systems: Proceedings of the third international workshop, 10–13 January 1989, Newcastle, Australia. ed. / John Rosenberg; David Koch. London: Springer, 1989. p. 353-366 (Workshops in Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - The Persistent Abstract Machine

AU - Connor, RCH

AU - Brown, AL

AU - Carrick, R

AU - Dearle, Alan

AU - Morrison, Ronald

N1 - Conference code: 3

PY - 1989

Y1 - 1989

N2 - The Persistent Abstract Machine is an integral part of a layered architecture model to support the Napier language. It interfaces cleanly with a persistent store, and allows persistence to be implemented without difficulty in a high-level language. The heap based storage mechanism of the Persistent Abstract Machine is designed to support the block retention nature of the Napier language. This allows the implementation of first class procedures and modules in programming languages with the minimum of effort. A primitive type system within the machine contains just enough information to allow machine instructions which behave differently according to the dynamic type of their operands. This type system, in conjunction with the block retention architecture, may be used to great effect to provide a fast implementation of polymorphic procedures, abstract data types, inheritance and bounded universal quantification.

AB - The Persistent Abstract Machine is an integral part of a layered architecture model to support the Napier language. It interfaces cleanly with a persistent store, and allows persistence to be implemented without difficulty in a high-level language. The heap based storage mechanism of the Persistent Abstract Machine is designed to support the block retention nature of the Napier language. This allows the implementation of first class procedures and modules in programming languages with the minimum of effort. A primitive type system within the machine contains just enough information to allow machine instructions which behave differently according to the dynamic type of their operands. This type system, in conjunction with the block retention architecture, may be used to great effect to provide a fast implementation of polymorphic procedures, abstract data types, inheritance and bounded universal quantification.

UR - https://archive.cs.st-andrews.ac.uk/papers/download/CBC+90b.pdf

U2 - 10.1007/978-1-4471-3173-1_24

DO - 10.1007/978-1-4471-3173-1_24

M3 - Conference contribution

SN - 9783540196266

T3 - Workshops in Computing

SP - 353

EP - 366

BT - Persistent object systems

A2 - Rosenberg, John

A2 - Koch, David

PB - Springer

CY - London

T2 - Persistent Object Systems Third International Workshop (POS3)

Y2 - 10 January 1989 through 13 January 1989

ER -

The Persistent Abstract Machine

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this