DOCSLIB.ORG

Section 9 Database, Standards, and Modelling Base De Données

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Section 9 Database, Standards, and Modelling Base De Données Contents / Matières Session / Séance Authors / Auteurs 09 Index Section 9 Database, Standards, and Modelling Base de données, standards, et modélisation The Integrated Data Model for the Spatiotemporal Phenomena Morishige Ota Semi-Automatic Change Detection for Updating of Large Scale Spatial Databases Roshanak Darvishzadeh - travel award winner Spatio-Temporal Formalization: Incorporating the Concept of Change in Cartographic Modeling George Panopoulos, Marinos Kavouras Archiving the Cartographic Record: The Canadian Experience Betty Kidd Building Aerial Photograph Referencing System and Providing Service on the Net Noboru Kobori On the automatic retrieval of updates in geographic databases based on geographic data matching tools Thierry Badard A fully integrated Geospatial Data Warehouse François Létourneau Interactive, User-Oriented, Error Modelling Designed to Support Rural Spatial Analysis and Information Production David Fraser Active Object Techniques for Production of Multiple Map and Geodata Products from a Spatial Database P.G. Hardy Application of Method of Object-Oriented Analysis for Multi-Detailed Representation of Cartographic Data Michael O. Govorov, Aleksej G. Khorev, Elena L. Kasjianova Database, Standards, and Modelling / Base de données, standards, et modélisation Contents / Matières Session / Séance Authors / Auteurs 09 Index Multi-scale representation of raster drainage network based on model Yaolin Liu and Martien Molenaar Production and “Intelligence” of Rasater Maps C. Armenakis, E. Siekierska, F. Hegyi and P. Pilon Enhancing a Database Management System for GIS with Fuzzy Set Methodologies Emmanuel Stefanakis and Timos Sellis A Model-based Approach to Geological Map Representation Boyan Brodaric Maintaining Parallel Map-Datasets Peter Højholt A Case Study of Propagating Updates between Cartographic Data Sets Lars Harrie and Anna-Karin Hellström Managing Québec’s Cadastral Database Michel Morneau, Daniel Roberge Implications cartographiques de la rénovation cadastrale au Québec Yaïves Ferland Object-Oriented Modeling Approach on Geo-Databases and Cartographic Products Leena Salo-Merta Image data compression methods and the assessment of map complexity David Fairbairn Modelling Objects for Screen Map Design Mats Dunkars, Anna Bergman A Spline Function is Applied in Map-Projection Transformation Yinxiang Yuan Ottawa ICA / ACI 1999 - Proceedings /Actes 09 Index Session / Séance 52-B The Integrated Data Model for the Spatiotemporal Phenomena Morishige Ota Kokusai Kogyo Co., Ltd., Tokyo, Japan [email protected] Abstract Geographic Information Systems have the mechanism to store geographic features systematically in the database. To realise this mechanism, many spatial data models have been developed and applied in the history of GIS. But, most of them are “spatial” and they are independent from “time”. It is still difficult to describe the time related phenomena like “motion”, “deformation”, “substitution”, “fission” and “fusion”. This paper presents the geometric and topological spatiotemporal data models to describe these phenomena. Introduction This paper presents the integrated data models to describe spatiotemporal features which are extended the 2-D vector spatial and 1-D temporal models. Many spatial data models have been proposed and adopted into com- mercial GISs. Most of them store the temporal characteristic in the database as a thematic attribute. They do not have a capability to manage spatiotemporal features despite that the real world phenomenon appears, disappears, substitutes as time passes. Recently, the demands for the Spatiotemporal GIS is increasing. And, many attempts and experiments have been done. Armstrong (1988) proposed the Snapshot Model; the heap of layers of which include the features on the same time slice. Langran and Chrisman (1988) discussed the Space-Time Composite Model; each object in the model has own time stamp. These approaches have significant data redundancy, and it is difficult to separate an individual geographic feature from the database. The space-time composite approach requires re-construction of thematic and temporal attribute tables whenever operations involve any changes in spatial objects. Thus, geographic entities tend to be decomposed into fragments of spatial objects [Yuan, 1996]. Worboys (1992) proposed the Object-oriented Data Model. In this model, the feature is represented by the cylindrical solid figure. They do not have disadvantages like the Snapshot Model or the Space-Time Composite Model, but it can not describe dynamic phenomena and does not have the topological structure which most of GISs adopt as the spatial data model. Pigot and Hazelton (1992) discussed the theoretical Dynamic 4-D model. But this idea is theoretical and more complex than other data models and it is difficult to implement [Peuquet, 1994]. This paper aim to provide (1) the 2-D spatial data models as the basis of the spatiotemporal data models. (2) the 1-D temporal data models and (3) the spatiotemporal data models which are the extension from 2-D spatial and 1-D temporal models. The next section provides the 2-D geometric and topological data models. The 3rd sec- tion proposes the spatiotemporal data models, which are obtained by the extension from the spatial and tempo- ral data models. The last section summarises the results of this paper and indicates the future directions and extensions. Database, Standards, and Modelling / Base de données, standards, et modélisation 09 Index Basic Data Models This section investigates the fundamental spatial and temporal models as the basis of the spatiotemporal data models. 2-D spatial data model There has been many spatial data models already proposed and applied in the society [Peuquet, 1984; Egenhofer and Herring, 1991; FIPS PUB 173, 1992]. 2-D Spatial Data Model represents an spatial attribute of the feature as a spatial geometric or topological primitive in the 2-D Euclidean space. The fundamental spatial geometric primitives are a point, a curve and a surface. A point represents the 0 dimensional position (x, y). A curve represents the 1 dimensional object. It is a simple list of points in practice. “Simple” in this case, means that there is no self-intersection or self-tangency. A surface is the 2 dimensional object, consists of one outer boundary and may have inner boundaries. These boundaries are closed curves called a ring in this paper. Inside of a ring is disjoint from others. The rotation direction of the ring is assumed as counterclockwise in this paper. The 2-D topological primitives are also imagined in 2-D Euclidean space. They represent a topological charac- teristic of the feature. The 2-D topological primitives are a node, an edge and a face. They can be defined by their boundaries and/or co-boundaries. A node is the 0 dimensional primitive and bounds an edge. An edge is the 1 dimensional primitive, bounds a left and/or right face and is bounded by start and end nodes. A face is the 2 dimensional primitive, bounded by a set of edges. A face may have holes as well as a surface. A hole of face is called a loop in this paper. A loop is a topological characteristic of a ring. It is a simple closed edge, has no boundary, disjoint from others. The 2-D spatial model can be seen from Table 1. There are two types of parent primitives called Spatial geometry and Spatial topology. Both of them have 4 sub-primitive types defined above. Table 1. 2-D spatial model Parent primitives Primitives Definitions Constrains Spatial geometry Spatial point sp = (x, y) Spatial curve sc = <sp>, A number of sp > 1, sc is simple Spatial ring sr = sc, sp0 = spn-1,, n > 2, counter-clockwise Spatial surface ss = (outer_sr, {inner_sr}) sr is disjoint from others Spatial topology Spatial node sn = {(sign, se)} Spatial edge se = (start_sn, end_sn, left_sf, right_sf) Spatial loop sl = (left_sf, right_sf) counter-clockwise Spatial face sf = (<(sign, se)>, {(sign, sl)}) The outer boundary is counter-clockwise, sl is disjoint from others Ottawa ICA / ACI 1999 - Proceedings /Actes 09 Index (a, b, ..., k): a tuple of a, b, .., k, {a, b, ..., k}: a set of a, b, ..., k <a>: an ordered set of ai, i=0..n-1 sign: the (rotation) direction of a primitive (+ or -) A topological primitive may have one to one relationship between equivalent geometric primitive to realise it geometrically in the Euclidean space. 1-D Temporal Model and causality Entities in the real world appear, change and disappear in the certain period of time. Basically, the temporal characteristic of a feature can be described by the existing “period”. The characteristic of a feature being shorter than the granularity of time measure can be called “instant”. As time is 1 dimensional space, the 0 dimensional point (instant) and the 1 dimensional line (period) are defined as the geometric characteristics [Goralwalla, 1998]. Instant is represented by a point of time t. Period is an interval of time (st, et), st is the start instant and et is the end instant. Time is a metric space, but the nature of time we usually experience is aniso- tropic. It moves toward one direction (st < et). As long as time is the 1 dimensional space, the topological model also can be defined. As can be seen from Table 2, primitives are a temporal node and a temporal edge. A temporal node bounds a temporal edge. The temporal edge is bounded by the start and the end temporal nodes. It has a direction from start to end. The temporal topology relationships may form a directed acyclic graph. Table 2. 1-D temporal data model Parent primitives Primitives Definitions Constrains Temporal geometry Instant it = (t) Period pd = (st, et) st < et Temporal topology Temporal node tn = ({previous_te}, {next_te}) Temporal edge te = (start_tn, end_tn) For example, when the owner of a parcel registered on 1960-02-10 plots out it to two parcels on 1998-08-20, one can describe the temporal geometry and topology for these parcels (See Figure 1). Database, Standards, and Modelling / Base de données, standards, et modélisation 09 Index Figure 1.
Load more

Recommended publications
  • A Model of Inheritance for Declarative Visual Programming Languages
    An Abstract Of The Dissertation Of Rebecca Djang for the degree of Doctor of Philosophy in Computer Science presented on December 17, 1998. Title: Similarity Inheritance: A Model of Inheritance for Declarative Visual Programming Languages. Abstract approved: Margaret M. Burnett Declarative visual programming languages (VPLs), including spreadsheets, make up a large portion of both research and commercial VPLs. Spreadsheets in particular enjoy a wide audience, including end users. Unfortunately, spreadsheets and most other declarative VPLs still suffer from some of the problems that have been solved in other languages, such as ad-hoc (cut-and-paste) reuse of code which has been remedied in object-oriented languages, for example, through the code-reuse mechanism of inheritance. We believe spreadsheets and other declarative VPLs can benefit from the addition of an inheritance-like mechanism for fine-grained code reuse. This dissertation first examines the opportunities for supporting reuse inherent in declarative VPLs, and then introduces similarity inheritance and describes a prototype of this model in the research spreadsheet language Forms/3. Similarity inheritance is very flexible, allowing multiple granularities of code sharing and even mutual inheritance; it includes explicit representations of inherited code and all sharing relationships, and it subsumes the current spreadsheet mechanisms for formula propagation, providing a gradual migration from simple formula reuse to more sophisticated uses of inheritance among objects. Since the inheritance model separates inheritance from types, we investigate what notion of types is appropriate to support reuse of functions on different types (operation polymorphism). Because it is important to us that immediate feedback, which is characteristic of many VPLs, be preserved, including feedback with respect to type errors, we introduce a model of types suitable for static type inference in the presence of operation polymorphism with similarity inheritance.
    [Show full text]
  • Methodology Stereotypes
    UML/MARTE Methodology for Heterogeneous System design May, 2016 Microelectronics Engineering Group TEISA Dpt. , University of Cantabria Authors: P. Peñil Revisions : F. Herrera Author Date Description FeHe 26/05/2015 Polishing of the Architectural View section FeHe 28/05/2015 Polishing on the Application View section including some restructuring FeHe 25/06/2015 Polishing of section 5.3 FeHe 15/05/2016 Polishing of section 5.1 Index: 1 MODEL VIEW SPECIFICATION ....................................................... 11 PIM VIEWS .............................................................................................. 12 2 DATA VIEW ....................................................................................... 12 2.1 Enumeration Data type .................................................................................................... 12 2.2 Primitive Data type ........................................................................................................... 12 2.3 Derived Data type ............................................................................................................. 13 2.3.1 Structure Data type ................................................................................................... 13 2.3.2 Array Data type.......................................................................................................... 13 2.4 Specifying data types ........................................................................................................ 14 2.5 Generalization of DataTypes
    [Show full text]
  • Polymorphic Type Inference and Assignment
    Proc. 18th Symp. Principles of Programming Languages, 1991, pages 291{302. Polymorphic type inference and assignment Xavier Leroy¤ Pierre Weis¤ Ecole Normale Sup¶erieure INRIA Rocquencourt Abstract that physical modi¯cation of data compromises type safety, since it can invalidate static typing assumptions. We present a new approach to the polymorphic typing As demonstrated here, the use of polymorphic mu- of data accepting in-place modi¯cation in ML-like lan- table data (that is, data structures that can be mod- guages. This approach is based on restrictions over type i¯ed in place) must be restricted. An obvious way to generalization, and a re¯ned typing of functions. The tackle this problem, used in early implementations of type system given here leads to a better integration of ML [3], is to require all such data to have monomor- imperative programming style with the purely applica- phic, statically-known types. This restriction trivially tive kernel of ML. In particular, generic functions that solves the problem, but it also makes it impossible to allocate mutable data can safely be given fully polymor- write polymorphic functions that create mutable values. phic types. We show the soundness of this type system, This fact has unfortunate consequences. and give a type reconstruction algorithm. A ¯rst drawback is that it is not possible to provide generic, e±cient implementations of most data struc- tures (vectors, hash tables, graphs, B-trees, ::: ), as 1 Introduction they require physical modi¯cation. Even a trivial func- Polymorphic type disciplines originate in the study of ¸- tion such as taking a vector of an arbitrary type and calculus and its connections to constructive logic [7, 14], returning a copy of it is not well-typed with the policy so it is no surprise it ¯ts very nicely within purely above, since it creates a vector with a statically un- applicative languages, without side e®ects.
    [Show full text]
  • 1St Workshop on Refactoring Tools (WRT'07)
    Forschungsberichte der Fakultät IV – Elektrotechnik und Informatik 1st Workshop on Refactoring Tools (WRT'07) Proceedings July 31, 2007, TU Berlin, Germany Danny Dig, Michael Cebulla (Eds.) Bericht-Nr. 2007 – 8 ISSN 1436-9915 Table of Contents WRT’07 Organization …………………………………………………….v Proceedings …………………………………………………………………. • KABA: Automated Refactoring for Improved Cohesion ……………………..1 G. Snelting, M. Streckenbach (Universitat Passau) • Automation of Refactoring and Refactoring Suggestions for TTCN-3 Test Suites. The TRex TTCN-3 Refactoring and Metrics Tool ……………..…………3 H. Neukirchen, B. Zeiss (University of Gottingen) • A visual interface for type-related refactorings ……………………………….5 P. Mayer (Ludwig-Maximilians-Universität), A. Meißner (Fernuniversität in Hagen), F. Steimann (Fernuniversität in Hagen) • ITCORE: A Type Inference Package for Refactoring Tools …………………7 H. Kegel (ej-technologies GmbH), F. Steimann (Fernuniversität in Hagen) • Flexible Transformation Language …………………………………………….9 A. A. Santos, L. Menezes, and M. Cornélio (UPE) • A Refactoring Discovering Tool based on Graph Transformation …………11 J. Perez, Y. Crespo (Universidad de Valladolid) • Refactoring with Contracts ……………………………………………………13 Y. A. Feldman, M. Goldstein (IBM Haifa Research Lab), S. Tyszberowicz (The Academic College of Tel-Aviv Yaffo) • Synchronizing Refactored UML Class Diagrams and OCL Constraints ……………………………………………………………...15 S. Markovic, T. Baar (Ecole Polytechnique Federale de Lausanne) • Code Analyses for Refactoring by Source Code Patterns and Logical Queries ……………………………………………………...17 D. Speicher, M. Appeltauer, G. Kniesel (University of Bonn) • Reuse Based Refactoring Tools ………………………………………………..21 R. Marticorena, C. Lopez (University of Burgos), Y. Crespo, J. Perez (University of Valladolid) i • SORMASA: A tool for Suggesting Model Refactoring Actions by Metrics-led Genetic Algorithm ………………………………………….……..23 T. Bodhuin, G. Canfora, L. Troiano (University of Sannio) • Model-driven Software Refactoring …………………………………………..25 T.
    [Show full text]
  • Declared Type Generalization Checker: an Eclipse Plug-In for Systematic Programming with More General Types
    Declared Type Generalization Checker: An Eclipse Plug-In for Systematic Programming with More General Types Markus Bach, Florian Forster, and Friedrich Steimann Lehrgebiet Programmiersysteme Fernuniversität in Hagen D-58084 Hagen [email protected], [email protected], [email protected] Abstract. The Declared Type Generalization Checker is a plug-in for Eclipse’s Java Development Tools (JDT) that supports developers in systematically find- ing and using better fitting types in their programs. A type A is considered to fit better than a type B for a declaration element (variable) d if A is more general than B, that is, if A provides fewer members unneeded for the use of d. Our support comes in the form of warnings generated in the Problem View of Eclipse, and associated Quick Fixes allowing elements to be re-declared auto- matically. Due to the use of Eclipse extension points, the algorithm used to compute more general types is easily exchangeable. Currently our tool can use two publicly available algorithms, one considering only supertypes already pre- sent in a project, and one computing new, perfectly fitting types. 1 The Problem: Too Strong Coupling Due to Overly Specific Types A class C is coupled to a type B if one or more declaration elements of C (i.e., fields, formal parameters, local variables, or methods with non-void return types) are de- clared with B as their type. Even though coupling between types cannot be eliminated completely (because without any coupling a type would be isolated from the rest of the system and therefore useless [1]), there is often a certain amount of unnecessary coupling which can be reduced in many cases by using a more general type than B.
    [Show full text]
  • Programming by Numbers: a Programming Method for Novices
    Programming by Numbers: A Programming Method for Novices HUGH GLASER,PIETER H. HARTEL AND PAUL W. GARRATT Department of Electronics and Computer Science, University of Southampton, S017 1BJ Southampton, UK Email: [email protected] Students often have difficulty with the minutiae of program construction. We introduce the idea of ‘Programming by Numbers’, which breaks some of the programming process down into smaller steps, giving such students a way into the process of Programming in the Small. Programming by Numbers does not add intellectual difficulty to learning programming, as it does not require the student to learn additional tools or theory. In fact it can be done with pencil and paper or the normal editor, and only requires the student to remember (and understand) seven simple steps. Programming by Numbers works best with languages that offer pattern matching, such as ML, or data-directed dispatching, such as Java. Received 24 August, 1998; revised 22 June, 2000 1. INTRODUCTION right from the start, because recursion is so fundamental to programming in a functional language. In the Java-based Programming in the Small is easy for experienced course Programming by Numbers is introduced later, when programmers. First they think about how to do it (The Idea), discussing recursion in connection with abstract classes, and then they write the solution down in the language of their sub-classing and data-directed dispatching. choice. This step from a solution in some form, to a solution Programming by Numbers is intended to help the student in a form acceptable as input to a computer is an essential get started on a problem.
    [Show full text]
  • Redesign of UML Class Diagrams: a Formal Approach Piotr Kosiuczenko
    Redesign of UML Class Diagrams: A Formal Approach Piotr Kosiuczenko Department of Computer Science University of Leicester, LE1 7RH, UK e-mail: [email protected], tel: 0043 116 2522025 Regular Paper Abstract: Contracts provide a precise way of specifying object-oriented systems. When a class structure is modified, the corresponding contracts must be modified accordingly. This paper presents a method of transforming contracts, which allows the extension of a mapping defined on a few model elements, to - what we call - an interpretation function, and to use this function to automatically translate OCL-constraints. Interestingly, such functions preserve reasoning using prepositional calculi, resolution, equations, and induc- tion. Interpretation functions can be used to trace model elements throughout multiple redesigns of UML class diagrams in both the forward, and the backward direction. The applicability of our approach is demonstrated in several examples, including some of Fowler’s refactoring patterns. Keywords: UML, OCL, formal methods, refactoring, requirements tracing. 1 Introduction Object-oriented modelling languages provide textual, and diagrammatic means for system specification (cf. [UML05]). An object-oriented system and its real-world environment are modelled using abstractions such as class, association, generalization, operation, and prop- erty. Class diagrams specify a common structure, and relationships between objects; they are often detailed by constraints. System specification, design, and implementation occur in a series of steps. There exist different software engineering approaches which detail how those steps can be performed. In the 80’s, and early 90’s, the waterfall model prevailed in software engineering. In this process, one has to begin with fixed requirement specifica- tion, design the system, and then implement the design specification.
    [Show full text]
  • Transformation of Structure-Shy Programs Applied to Xpath Queries and Strategic Functions
    Transformation of Structure-Shy Programs Applied to XPath Queries and Strategic Functions Alcino Cunha Joost Visser DI-CCTC, Universidade do Minho, Portugal {alcino,joost.visser}@di.uminho.pt Abstract focusing on the essence of the algorithm rather than oozing with Various programming languages allow the construction of structure- boilerplate code. This reduces development time and improves shy programs. Such programs are defined generically for many understandability. Also, structure-shy programs are only loosely different datatypes and only specify specific behavior for a few rel- bound to the data structures on which they operate. As a result, evant subtypes. Typical examples are XML query languages that they do not necessarily need adaptation when those data structures allow selection of subdocuments without exhaustively specifying evolve, and they may be reusable for different data structures. intermediate element tags. Other examples are languages and li- The flip side of these benefits is that structure-shy programs braries for polytypic or strategic functional programming and for have potentially worse space and time behaviour than equivalent adaptive object-oriented programming. structure-sensitive programs. A source of performance loss, gener- In this paper, we present an algebraic approach to transforma- ally by a factor linear in the input size, are dynamic checks em- tion of declarative structure-shy programs, in particular for strate- ployed in the execution of structure-shy programs to determine at gic functions and XML queries. We formulate a rich set of alge- each data node whether to apply specific or generic behaviour. An- braic laws, not just for transformation of structure-shy programs, other source of inefficiency is that algorithmic optimizations, such but also for their conversion into structure-sensitive programs and as cutting off traversal into certain substructures, cannot be ex- vice versa.
    [Show full text]
  • Java SE 7 Programming Course Details
    5 Days Java SE 7 Programming The Java SE 7 Programming training lays emphasis on the core Application Programming Interfaces (API) that are widely used to design and code object-oriented applications with Java. Through this training, individuals learn to write database programs with JDBC, manipulate files, and identify best practices to build strong java applications Completion of this training course will enable candidates to: Create Java technology applications with the latest JDK 7 Technology and the NetBeans Integrated Development Environment (IDE). Create Class, Subclass, Abstract Classes and Interfaces Create high-performance, multi-threaded applications. Identify good practices in the use of the language to create robust Java applications. Learn Object Oriented Programming Skills Work with database applications such as SQL through JDBC. Properly use exceptions and the Collections framework. Develop applications that manipulate files, directories and file systems. Course Benefits: Attaining this course helps individuals to enhance the productivity, communication, and collaboration of their organization. This course will equip you with the right knowledge and skill set to minimize the cost of application ownership through more efficient deployment and development techniques. Earn Your Java Certification This course develops the essential skills with Java language. This training is an important pre-requisite for individuals who are preparing for the Oracle Certified Professional, Java SE 7 Programmer Exam. Course Details ___________________ Course Outline 1. Java Platform Overview Introductions Course Schedule Java Platforms Overview Open JDK Licensing The Java Community Process Java in Server Environments 2. Java Syntax and Class Review Simple Java classes Java fields, constructors, and methods Package and import statements Model objects using Java classes 3.
    [Show full text]
  • Practical Type Inference for the GADT Type System
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PDXScholar Portland State University PDXScholar Dissertations and Theses Dissertations and Theses 1-1-2010 Practical Type Inference for the GADT Type System Chuan-kai Lin Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/open_access_etds Let us know how access to this document benefits ou.y Recommended Citation Lin, Chuan-kai, "Practical Type Inference for the GADT Type System" (2010). Dissertations and Theses. Paper 367. 10.15760/etd.367 This Dissertation is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact [email protected]. Practical Type Inference for the GADT Type System by Chuan-kai Lin A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Dissertation Committee: Tim Sheard, Chair Andrew P. Black James Hook Mark P. Jones Andrew Tolmach Douglas V. Hall Portland State University © 2010 i ABSTRACT Generalized algebraic data types (GADTs) are a type system extension to alge- braic data types that allows the type of an algebraic data value to vary with its shape. The GADT type system allows programmers to express detailed program properties as types (for example, that a function should return a list of the same length as its input), and a general-purpose type checker will automatically check those properties at compile time. Type inference for the GADT type system and the properties of the type system are both currently areas of active research.
    [Show full text]
  • Subtyping with Generics: a Unified Approach
    University of Massachusetts Amherst ScholarWorks@UMass Amherst Doctoral Dissertations Dissertations and Theses Summer November 2014 Subtyping with Generics: A Unified Approach John G. Altidor University of Massachusetts Amherst Follow this and additional works at: https://scholarworks.umass.edu/dissertations_2 Part of the Programming Languages and Compilers Commons, Software Engineering Commons, and the Theory and Algorithms Commons Recommended Citation Altidor, John G., "Subtyping with Generics: A Unified Approach" (2014). Doctoral Dissertations. 153. https://doi.org/10.7275/6056894.0 https://scholarworks.umass.edu/dissertations_2/153 This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of ScholarWorks@UMass Amherst. For more information, please contact [email protected]. SUBTYPING WITH GENERICS: A UNIFIED APPROACH A Dissertation Presented by JOHN G. ALTIDOR Submitted to the Graduate School of the University of Massachusetts Amherst in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY September 2014 School of Computer Science c Copyright by John G. Altidor 2014 All Rights Reserved SUBTYPING WITH GENERICS: A UNIFIED APPROACH A Dissertation Presented by JOHN G. ALTIDOR Approved as to style and content by: Yannis Smaragdakis, Chair Jack C. Wileden, Member Neil Immerman, Member Ian Grosse, Member Lori Clarke, Department Chair School of Computer Science ACKNOWLEDGMENTS First, I thank Yannis Smaragdakis and Jack Wileden who have taught me a great deal about programming languages. In addition, they have stressed the importance of communicating ideas clearly, motivating work, and justifying claims.
    [Show full text]
  • The Infer Type Refactoring and Its Use for Interface-Based Programming
    JOURNAL OF OBJECT TECHNOLOGY Online at http://www.jot.fm. Published by ETH Zurich, Chair of Software Engineering ©JOT, 2007 Vol. 6, No. 2, Special Issue OOPS Track at SAC 2006, February 2007 The Infer Type Refactoring and its Use for Interface-Based Programming Friedrich Steimann, Fernuniversität in Hagen, Germany Abstract Interface-based programming, i.e. the systematic use of interface types in variable dec- larations, serves the decoupling of classes and increases a program’s changeability. To maximize this effect, interfaces should contain as few elements as possible. For the de- sign of minimal (i.e., maximally general) interfaces, an in-depth analysis of the protocol needed from objects in a given context is required. However, currently available refac- torings for the creation of such interfaces (such as Extract Interface) leave programmers alone with the decision what to include or, more importantly, what to omit: they let them choose manually from the protocol of a class, and only then offer the use of the new in- terface where (if) possible. To end this trial and error process, we have developed a new refactoring named Infer Type that, using type inference, completely automates the construction of new, context-specific interfaces and their use in variable declarations, thus supporting greater decoupling and access protection of code, serving the goals of interface-based programming. 1 INTRODUCTION Interface-based programming is an object-oriented programming technique by which ob- ject references (variables and methods with return values) are statically typed with ab- stract interfaces rather than concrete classes. These interfaces are typically context- specific [Steimann & Mayer 2005], i.e., they contain only the protocol needed from the referenced objects as accessed through the references setting up the context.
    [Show full text]