ADABTPL(ID:2834/ada008)


for Abstract DAtaBase Type Programming Language, but pronounced abaptable

A high level Pascal-like database language with functional semantics, featuring schemes, domains and tuples as first order types, and domain constraint mechanisms.






Structures:
References:
  • Croft, W. Bruce and Stemple, David W. "Supporting Offics Document Architectures with Constrained Types." view details Abstract: Data models have been proposed ae a means of defimng the objects and operations m an office mformatlon system Office documents, because of their highly variable structure and multimedia ontent, are a difficult class of objects to model.The modeling ask is further comphcated by document architecture standards ued for iterchange between systems. We present an approach to data modeling based on constrained type definitions that allows architecture standards to be defined and ensures that individual document types conform to those standards. The ADABTPL model, which is used to define the schema of document types and standards, is described. Extract: Introduction
    Introduction
    Office information systems, because they attempt to Integrate all aspects of a business environment, must be able to deal with a large variety of information types Data that has traditionally been stored m databases such as the typical "supplier and parts" example, must be combined with office objects such as forms, documents and mail. For example, an order form may contain references to suppliers and parts that have their own descriptions A number of data models have been proposed for this application [1,2,3], and the importance in the office of documents with complex structure and multimedia content means that these approaches have strong similarities to other research in multimedia databases [4], which includes applications such as CAD.
    As well as providing a common language for defining the structure of obJects, a data model can be used to define the valid operations on obJects such as documents This "object-oriented" view of data modeling has been shown to be useful in multimeia applications [4], and can be extended to describe the user operations or tasks that make up office work [5].
    Document architecture standards, such as ODA [6], are also designed to be able to represent the possible structures of office documents. The main aim of these architectures is to allow the interchange of documents between open systems. One of the results of this emphasis is that ODA provides for the description of the layout structure of a document as well as the logical structure ODA also specifies constraints on allowable document types, rather than being used only for the specification of types Parts of ODA, therefore, have similarities to the "metaclasses" of object-orIented programing languages [7].
    If a data model is used as the basis for an office information system, It must be capable of representing document architecture standards and enforcing them on document type definitions. In this paper, we describe a data model, ADABTPL, that is characterized by formal underpinnings, type constructors, robust subtyping, and extensive constraint mechanisms. We argue that a model with these characteristics 1s essential to represent document architecture standards and their relationship to particular document types. That is, in addition to basic facilities for defining aggregation, generalization and instantiation, a data model should have a formal means for defining constraints on types and specifying how these constraints are inherited and specialized by subtypes. The ADABTPL constraint specification language and manipulation language has a formal semantics that supports mechanical reasoning about Important propertIes of specified systems [8,9] Specifying document architecture standards m ADABTPL gives them a formal semantics and Integrates them with the rest of the office model.
          in Proceedings of the 1987 ACM SIGMOD international conference on Management of Data ACM SIGMOD Record , 16(3) December 1987 view details
  • Sheard, T. Stemple, D. "The precise control of inheritance and the inheritance of theory inthe ADABTPL language" Proceedings., International Conference on Computer Languages, 1988 pp194-201 view details 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 External link: Online copy
          in Proceedings of the 1987 ACM SIGMOD international conference on Management of Data ACM SIGMOD Record , 16(3) December 1987 view details
  • Stemple, D.; Socorro, A. and Sheard, T. "Formalizing Objects for Databases Using ADABTPL" pp110-128 view details
          in In Proceedings of the Second International Workshop on Object-Oriented Database Systems Sept 1988 view details
  • Fegaras, L.; T. Sheard, and D. Stemple. "The ADABTPL Type System" pp243-254 view details Abstract: ADABTPL (Abstract DAtaBase Type Programming Language, pronounced abaptable) is a high level programming language based on finite sets and total functions. It has the purpose of bringing polymorphic, axiomatic types to bear on the problem of specifying database systems. It contains a type definition language for specifying the types of database objects and transaction inputs along with a transaction specification language. In this paper we present the features of the type system.
          in Second International Workshop on Database Programming Languages, Salishan, Oregon, Morgan Kaufmann Publishers, Inc., June 1989 view details
  • Fegaras, Leonidas; and Stemple, David "Using Type Transformation in Database System Implementation" view details
          in Second International Workshop on Database Programming Languages, Salishan, Oregon, Morgan Kaufmann Publishers, Inc., June 1989 view details
  • J. Eliot and B. Moss "Working with Persistent Objects:To Swizzle or Not to Swizzle" view details
          in IEEE Transactions on Computers July 19, 1991 view details
  • Sheard, T. and D. Stemple "Inheritance of theory in the ADABTPL language" view details
          in Computer Languages 17(3) view details
  • Hosking, A. L. Lightweight Support for Fine-Grained Persistence on Stock Hardware. PhD thesis, University of Massachusetts at Amherst, MA 01003, Feb. 1995. view details
          in Computer Languages 17(3) view details
  • Schewe, Klaus-Dieter; Stemple, David; Thalheim, Bernhard "Higher-Level Genericity in Object Oriented Databases" view details
          in Computer Languages 17(3) view details