The precise control of inheritance and the inheritance of theory in the ADABTPL language

Author

Sheard, Tim ; Stemple, David

Author_Institution

Dept. of Comput. & Inf. Sci., Massachusetts Univ., Amherst, MA, USA

fYear

1988

fDate

9-13 Oct. 1988

Firstpage

194

Lastpage

201

Abstract

It is possible to include robust inheritance features while separating them from data structuring mechanisms to a higher degree than is accomplished in most languages. The ADABTPL language does this by supplying a small class of orthogonal inheritance producing and restricting mechanisms. ADABTPL also supports a paradigm of programming by tying the compiler to a powerful Boyer-Moore-style theorem prover that can be invoked by the programmer to verify properties of programs and validate program transformations. This is accomplished by the use of higher-order functions and metatheorems to produce a tailored theory about particular programs.<>

Keywords

database management systems; high level languages; program verification; programming; theorem proving; ADABTPL language; Boyer-Moore-style theorem prover; abstract database type programming language; compiler; data structuring mechanisms; higher-order functions; metatheorems; orthogonal inheritance; precise control; program transformations; program verification/validation; programmer; restricting mechanisms; robust inheritance features; tailored theory; Computer languages; Control systems; Databases; Encapsulation; Information science; Mechanical factors; Program processors; Programming profession; Robustness; Software engineering;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Languages, 1988. Proceedings., International Conference on

Conference_Location

Miami Beach, FL, USA

Print_ISBN

0-8186-0874-9

Type

conf

DOI

10.1109/ICCL.1988.13064

Filename

13064