DOCSLIB.ORG

Affine Contracts for Affine Types

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Affine Contracts for Affine Types Affine Contracts for Affine Types Jesse A. Tov Riccardo Pucella Northeastern University ftov,[email protected] Abstract ML-like language illustrates why conventional type systems are Affine and other substructural type systems offer a range of expres- inadequate to the task of typing strong updates: siveness and performance benefits but cannot easily interact with fun tricky (r1: (int ! int) ref, r2: (int ! int) ref): int = components written in non-affine languages in a safe manner. We let val f = !r1 propose a technique for regulating the interaction between code val = r1 := 0 written in an affine language and code written in a conventional val g = !r2 typed language by means of contracts. in f (g 2) end We formalize our approach via a typed calculus with both affine-typed and conventionally typed modules. An affine type If we invoke tricky(r, r), where r is a reference cell containing an system is used for affine modules and a conventional type system int ! int function, then g in the code above will be an integer rather for conventional modules, and neither type system is aware of the than a function, resulting in a run-time fault. The problem occurs other. We show how to preserve the properties guaranteed by the only if the two arguments to tricky are aliases for the same reference two type systems despite modules being able to call each other and cell, which a linear or affine type system can prevent. exchange values arbitrarily, and we establish the correctness of our Beyond strong updates, substructural types have been used approach through a syntactic type soundness theorem. for memory management (Jim et al. 2002), for optimization of lazy languages (Turner et al. 1995), and to handle effects in pure Categories and Subject Descriptors D.2.4 [Software Engineer- languages (Barendsen and Smetsers 1996). Typestate (Strom and ing]: Software/Program Verification—Programming by contract; Yemini 1986) and session types (Gay and Hole 1999) can also be F.4.1 [Mathematical Logic and Formal Languages]: Mathematical understood as substructural type systems, although they are not Logic—Affine Logic always presented as such. Given the range of language features that substructural types can General Terms Languages, Reliability express, a programmer may wish to take advantage of these features in writing real-world programs. Writing real systems, however, Keywords Contracts, affine types, substructural logic, multi- often requires access to comprehensive libraries, which mainstream language systems programming languages generally provide but prototype imple- mentations often do not. The prospect of rewriting libraries to work 1. Introduction in a substructural language strikes these authors as unappealing. This suggests allowing conventional and substructural lan- Substructural type systems augment conventional type systems guages to interoperate. We envision the following scenarios: with the ability to control the number and order of uses of a data structure or operation (Walker 2005). The most common • The programmer wishes to import a legacy library into a sub- substructural type systems are linear type systems (Wadler 1990; structural language. Unfortunately, if the library is unaware Plotkin 1993; Benton 1995; Ahmed et al. 2004). Roughly speaking, of the substructural conditions then it may duplicate values a linear type system ensures that values with linear type cannot received from the substructural language. be duplicated or dropped: a value of linear type must be elimi- • The programmer wishes to write a library in a substructural nated exactly once. Other substructural type systems refine these language but provide access to the library from a conventional constraints. Affine type systems, for instance, enforce that values language. The naive client may duplicate values it receives cannot be duplicated, but allow them to be dropped: a value of from a substructural library and resubmit them, causing aliasing affine type may be used once or not at all. that the substructural library could not produce by itself and A common use case for substructural type systems is to type bypassing the guarantees of the substructural type system. check reference cells that support strong updates, that is, where the type of a value stored in a cell can be different at different points Our Contributions. The core contribution of this paper is a novel during the execution of a program. The following example in an approach to regulating the interaction between an affine language and a conventionally typed language. We present a calculus having several notable features: • The non-affine language may gain access to affine values, in- cluding strongly-updatable references, and may apply affine- language functions. • The non-affine type system has no awareness of the affine type system. [Copyright notice will appear here once ’preprint’ option is removed.] • And yet, the resulting system enjoys type soundness. 1 2009/3/2 We expect our technique to be efficiently implementable on real variables x; y hardware. module names f; g Our calculus consists of two sublanguages with different type integers z systems: a simply-typed λ calculus with a completely standard type system and a λ calculus with an affine type system. We have chosen programs P ::= M e declarations M ::= • j M m an affine rather than linear type system because what it means for u an affine invariant to be violated is significantly clearer than what it modules m ::= module f : σ = v means for a linear invariant to be violated. (We revisit this point in expressions e ::= v j x j f j e e j if0 e e e x6.) Our affine language provides strong updates as a simple stand- j he; ei j let hx; xi = e in e in for the variety of features such as typestate that they subsume. values v ::= λx:σ:e j c j hv; vi A program is a collection of modules and a main expression, constants c ::= dze j new j swap j · · · and each module may be written in either of the two sublanguages. a u types σ ::= σ j σ Modules in each language have access to modules written in the u u unlimited types σu ::= int j σ 1 σ j σ ⊗ σ other language, though they view foreign types through a transla- ( a a affine types σa ::= σ ref j σ 1 σ j σ ⊗ σ j σ ⊗ σ tion into the native type system. Affine modules are checked by ( arrows ∗ ::= 1 j 1 an affine type system, and non-affine modules are checked by the ( ( ( conventional type system. Notably, the conventional type system has no knowledge of affine types and their properties. Figure 1. A syntax To allow modules to invoke each other and exchange values while preserving the safety properties guaranteed by the individual type systems, we need to perform runtime checks in cases where affine sublanguage in x3. In x4 we introduce our multi-language the non-affine type system is too weak to express the affine type calculus and attempt to justify some of its design. The impatient system’s invariants for values that flow between the languages. reader may wish to skip to x4.3 on page 7 for examples. We explain For instance, the affine type system guarantees that an affine value our soundness criterion, state a standard type soundness theorem, created in an affine module will not be duplicated within the affine and discuss highlights of the proof in x5. We explore alternate sublanguage. If the value flows into a non-affine module, however, design ideas, extensions, and future research possibilities in x6 and static bets are off. In that case, we resort to a dynamic check that conclude in x7. prevents the value from flowing back into an affine context—where To distinguish the two languages of our calculus, we typeset our it can be used—more than once. Since our calculus is higher-order, affine language A in a sans-serif font and our non-affine language we use a form of higher-order contract (Findler and Felleisen 2002) C in a bold serif font. to keep track of each module’s obligations toward maintaining the affine invariants. 2. The Affine Sublanguage In Findler and Felleisen’s formulation, a software contract is A an agreement between two software components, or parties, about We begin with our affine sublanguage, which we call A (for some property of a value. The positive party produces a value, “affine,” typeset in sans-serif). Figure 1 presents the syntax of types which must satisfy the specified property. The negative party con- and terms. sumes the value and is held responsible to treat it appropriately. In preparation for adding contracts, A includes modules, which Contracts are concerned with catching violations of the property act as contractual parties. For simplicity, a module declares only and blaming the guilty party, which may help locate the source of a one name bound to one value. A program comprises a mutually bug. For first-order values, the contract may be immediately check- recursive collection of modules M and a main expression e. able, but for functional values, the property is likely undecidable, Expressions are mostly conventional: values, which include λ so the check must wait until the negative party applies the function, expressions, several constants, pairs of values, and dze for integer at which point the negative party is responsible for providing a literals; variables; application; if expressions; pair construction; suitable argument and the positive party for producing a suitable and pair elimination. Less conventionally, expressions also include result. Thus, for higher-order functions, checks are delayed until module names (f), which reduce to the value of the named module. first-order values are reached. We define the free variables of an expression in the usual way, but Our approach to integrating affine and conventional types note that this includes only regular variables (e.g., y), not module borrows heavily from recent literature on multi-language inter- names (e.g., g), which we assume are distinguished syntactically.
Load more

Recommended publications
  • Typescript Language Specification
    TypeScript Language Specification Version 1.8 January, 2016 Microsoft is making this Specification available under the Open Web Foundation Final Specification Agreement Version 1.0 ("OWF 1.0") as of October 1, 2012. The OWF 1.0 is available at http://www.openwebfoundation.org/legal/the-owf-1-0-agreements/owfa-1-0. TypeScript is a trademark of Microsoft Corporation. Table of Contents 1 Introduction ................................................................................................................................................................................... 1 1.1 Ambient Declarations ..................................................................................................................................................... 3 1.2 Function Types .................................................................................................................................................................. 3 1.3 Object Types ...................................................................................................................................................................... 4 1.4 Structural Subtyping ....................................................................................................................................................... 6 1.5 Contextual Typing ............................................................................................................................................................ 7 1.6 Classes .................................................................................................................................................................................
    [Show full text]
  • Typescript-Handbook.Pdf
    This copy of the TypeScript handbook was created on Monday, September 27, 2021 against commit 519269 with TypeScript 4.4. Table of Contents The TypeScript Handbook Your first step to learn TypeScript The Basics Step one in learning TypeScript: The basic types. Everyday Types The language primitives. Understand how TypeScript uses JavaScript knowledge Narrowing to reduce the amount of type syntax in your projects. More on Functions Learn about how Functions work in TypeScript. How TypeScript describes the shapes of JavaScript Object Types objects. An overview of the ways in which you can create more Creating Types from Types types from existing types. Generics Types which take parameters Keyof Type Operator Using the keyof operator in type contexts. Typeof Type Operator Using the typeof operator in type contexts. Indexed Access Types Using Type['a'] syntax to access a subset of a type. Create types which act like if statements in the type Conditional Types system. Mapped Types Generating types by re-using an existing type. Generating mapping types which change properties via Template Literal Types template literal strings. Classes How classes work in TypeScript How JavaScript handles communicating across file Modules boundaries. The TypeScript Handbook About this Handbook Over 20 years after its introduction to the programming community, JavaScript is now one of the most widespread cross-platform languages ever created. Starting as a small scripting language for adding trivial interactivity to webpages, JavaScript has grown to be a language of choice for both frontend and backend applications of every size. While the size, scope, and complexity of programs written in JavaScript has grown exponentially, the ability of the JavaScript language to express the relationships between different units of code has not.
    [Show full text]
  • Comparative Studies of Programming Languages; Course Lecture Notes
    Comparative Studies of Programming Languages, COMP6411 Lecture Notes, Revision 1.9 Joey Paquet Serguei A. Mokhov (Eds.) August 5, 2010 arXiv:1007.2123v6 [cs.PL] 4 Aug 2010 2 Preface Lecture notes for the Comparative Studies of Programming Languages course, COMP6411, taught at the Department of Computer Science and Software Engineering, Faculty of Engineering and Computer Science, Concordia University, Montreal, QC, Canada. These notes include a compiled book of primarily related articles from the Wikipedia, the Free Encyclopedia [24], as well as Comparative Programming Languages book [7] and other resources, including our own. The original notes were compiled by Dr. Paquet [14] 3 4 Contents 1 Brief History and Genealogy of Programming Languages 7 1.1 Introduction . 7 1.1.1 Subreferences . 7 1.2 History . 7 1.2.1 Pre-computer era . 7 1.2.2 Subreferences . 8 1.2.3 Early computer era . 8 1.2.4 Subreferences . 8 1.2.5 Modern/Structured programming languages . 9 1.3 References . 19 2 Programming Paradigms 21 2.1 Introduction . 21 2.2 History . 21 2.2.1 Low-level: binary, assembly . 21 2.2.2 Procedural programming . 22 2.2.3 Object-oriented programming . 23 2.2.4 Declarative programming . 27 3 Program Evaluation 33 3.1 Program analysis and translation phases . 33 3.1.1 Front end . 33 3.1.2 Back end . 34 3.2 Compilation vs. interpretation . 34 3.2.1 Compilation . 34 3.2.2 Interpretation . 36 3.2.3 Subreferences . 37 3.3 Type System . 38 3.3.1 Type checking . 38 3.4 Memory management .
    [Show full text]
  • Context-Aware Programming Languages
    UCAM-CL-TR-906 Technical Report ISSN 1476-2986 Number 906 Computer Laboratory Context-aware programming languages Tomas Petricek March 2017 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom phone +44 1223 763500 http://www.cl.cam.ac.uk/ c 2017 Tomas Petricek This technical report is based on a dissertation submitted March 2017 by the author for the degree of Doctor of Philosophy to the University of Cambridge, Clare Hall. Technical reports published by the University of Cambridge Computer Laboratory are freely available via the Internet: http://www.cl.cam.ac.uk/techreports/ ISSN 1476-2986 ABSTRACT The development of programming languages needs to reflect important changes in the way programs execute. In recent years, this has included the development of parallel programming models (in reaction to the multi- core revolution) or improvements in data access technologies. This thesis is a response to another such revolution – the diversification of devices and systems where programs run. The key point made by this thesis is the realization that an execution en- vironment or a context is fundamental for writing modern applications and that programming languages should provide abstractions for programming with context and verifying how it is accessed. We identify a number of program properties that were not connected before, but model some notion of context. Our examples include tracking different execution platforms (and their versions) in cross-platform devel- opment, resources available in different execution environments (e. g. GPS sensor on a phone and database on the server), but also more traditional notions such as variable usage (e. g.
    [Show full text]
  • Semantic Casts Contracts and Structural Subtyping in a Nominal World
    Semantic Casts Contracts and Structural Subtyping in a Nominal World Robert Bruce Findler, Matthew Flatt, and Matthias Felleisen 1 University of Chicago; Chicago, IL, USA; [email protected] 2 University of Utah; Salt Lake City, UT, USA; [email protected] 3 Northeastern University; Boston, MA, USA; [email protected] Abstract Nominal subtyping forces programmers to explicitly state all of the subtyping re- lationships in the program. This limits component reuse, because programmers cannot anticipate all of the contexts in which a particular class might be used. In contrast, structural subtyping implicitly allows any type with appropriate structure to be used in a given context. Languagues with contracts exacerbate the problem. Since contracts are typically expressed as refinements of types, contracts in nominally typed languages introduce additional obstacles to reuse. To overcome this problem we show how to extend a nominally typed language with semantic casts that introduce a limited form of structural subtyping. The new language must dynamically monitor contracts, as new subtyping relationships are exploited via semantic casts. In addition, it must also track the casts to properly assign blame in case interface contract are violated. 1 Enriching Nominal Subtypes with Semantic Casts Conventional class-based object-oriented languages like C++ [45], C# [34], Eiffel [33], and Java [18] come with nominal typing systems. In such systems, a programmer ex- plicitly names the superclass(es) and the implemented interfaces of a class. Thus, the declared type of any instance of a class must be one of the explicitly named interfaces or classes. Language designers choose nominal type systems because they are easy to under- stand and easy to implement.
    [Show full text]
  • 03 a Pril , 2011 S Aarbrücken , G Ermany
    E UROPEAN J OINT C ONFERENCES ON T HEORY AND P RACTICE OF S OFTWARE 26 M ARCH – 03 A PRIL , 2011 S AARBRÜCKEN , G ERMANY BYTECODE 2011 6 TH W ORKSHOP ON BYTECODE S EMANTICS , V ERIFICATION , A NALYSIS AND T RANSFORMATION P IERRE G ANTY AND M ARK M ARRON (E DS .) http://www.etaps.org http://etaps2011.cs.uni-saarland.de ByteCode 2011 Complete and Platform-Independent Calling Context Profiling for the Java Virtual Machine Aibek Sarimbekov Philippe Moret Walter Binder1 Faculty of Informatics University of Lugano Lugano, Switzerland Andreas Sewe Mira Mezini2 Software Technology Group Technische Universit¨atDarmstadt Darmstadt, Germany Abstract Calling context profiling collects statistics separately for each calling context. Complete calling con- text profiles that faithfully represent overall program execution are important for a sound analysis of program behavior, which in turn is important for program understanding, reverse engineering, and workload characterization. Many existing calling context profilers for Java rely on sampling or on incomplete instrumentation techniques, yielding incomplete profiles; others rely on Java Virtual Machine (JVM) modifications or work only with one specific JVM, thus compromising portability. In this paper we present a new calling context profiler for Java that reconciles completeness of the collected profiles and full compatibility with any standard JVM. In order to reduce measurement perturbation, our profiler collects platform-independent dynamic metrics, such as the number of method invocations and the number of executed bytecodes. In contrast to prevailing calling con- text profilers, our tool is able to distinguish between multiple call sites in a method and supports selective profiling of (the dynamic extent of) certain methods.
    [Show full text]
  • Concrete Types for Typescript
    Concrete Types for TypeScript Abstract preservation in favor of improved error reporting. The pragmatic TypeScript extends the JavaScript programming language with a justification for optional types is that developers should have con- set of optional type annotations that are, by design, unsound and, fidence that adding type annotation to a well-tested dynamic pro- that the TypeScript compiler discards as it emits plain JavaScript gram will neither cause the program to get stuck nor degrade its code. The motivation for this choice is to preserve the programming performance. idioms developers are familiar with, and their legacy code, while This paper presents a design for a gradual type system for Type- offering them a measure of static error checking. This paper details Script that lets developers choose between writing code that has no an alternative design for TypeScript, one where it is possible to type annotations (implicitly variables are of type any), with op- support the same degree of dynamism, but also where types can tional type annotations that are trace-preserving (types are erased), be strengthened to provide runtime guarantees. We report on an and finally with concrete type annotations that provide correct- implementation of our design, called StrongScript, that improves ness guarantees but are not trace-preserving (types are retained and runtime performance of typed programs when run on an optimizing are used by the compiler). We name the language StrongScript in JavaScript engine. homage to StrongTalk. Its type system is inspired by ideas devel- oped in Thorn [2] but terminology and syntax are aligned to Type- Script. Our design goals were as follows: 1.
    [Show full text]
  • Gradual Typing for Smalltalk
    Gradual Typing for Smalltalk Esteban Allendea,∗∗, Oscar Calla´ua, Johan Fabrya, Eric´ Tantera, Marcus Denkerb aPLEIAD Laboratory Computer Science Department (DCC) | University of Chile bINRIA Lille Nord Europe CNRS UMR 8022 | University of Lille Abstract Being able to combine static and dynamic typing within the same language has clear benefits in order to support the evolution of prototypes or scripts into mature robust programs. While being an emblematic dynamic object-oriented language, Smalltalk is lagging behind in this regard. We report on the design, implementation and application of Gradualtalk, a gradually-typed Smalltalk meant to enable incremental typing of existing programs. The main design goal of the type system is to support the features of the Smalltalk language, like metaclasses and blocks, live programming, and to accomodate the programming idioms used in practice. We studied a number of existing projects in order to determine the features to include in the type system. As a result, Gradualtalk is a practical approach to gradual types in Smalltalk, with a novel blend of type system features that accomodate most programming idioms. Keywords: Type systems, gradual typing, Smalltalk 1. Introduction The popularity of dynamic languages has led programs in these languages to become larger and more com- plex. A number of frameworks like Ruby on Rails, the Google Javascript library suite, Seaside (Smalltalk), Django (Python), etc. are regularly used to build large and complex systems. In this context, the possibility to consolidate grown prototypes or scripts with the guarantees of a static type system is appealing. While research in combining static and dynamic typing started more than twenty years ago, recent years have seen a lot of proposals of either static type systems for dynamic languages, or partial type systems that allow a combination of both approaches [1, 2, 3, 4, 5, 6, 7].
    [Show full text]
  • University of Southampton Research Repository Eprints Soton
    University of Southampton Research Repository ePrints Soton Copyright © and Moral Rights for this thesis are retained by the author and/or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder/s. The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders. When referring to this work, full bibliographic details including the author, title, awarding institution and date of the thesis must be given e.g. AUTHOR (year of submission) "Full thesis title", University of Southampton, name of the University School or Department, PhD Thesis, pagination http://eprints.soton.ac.uk UNIVERSITY OF SOUTHAMPTON FACULTY OF PHYSICAL SCIENCES AND ENGINEERING Electronics and Computer Science Preemptive type checking in dynamically typed programs by Neville Grech Thesis for the degree of Doctor of Philosophy November 2013 The research work disclosed in this publication is partially funded by the Strategic Educational Pathways Scholarship (Malta). This Scholarship is part-financed by the European Union – European Social Fund (ESF) under Operational Programme II – Cohesion Policy 2007-2013, “Empowering People for More Jobs and a Better Quality Of Life”. Operational Programme II – Cohesion Policy 2007-2013 Empowering People for More Jobs and a Better Quality of Life Scholarship part-financed by the European Union European Social Fund (ESF) Co-financing rate: 85% EU Funds; 15%National Funds Investing in your future UNIVERSITY OF SOUTHAMPTON ABSTRACT FACULTY OF PHYSICAL SCIENCES AND ENGINEERING Electronics and Computer Science Doctor of Philosophy PREEMPTIVE TYPE CHECKING IN DYNAMICALLY TYPED PROGRAMS by Neville Grech With the rise of languages such as JavaScript, dynamically typed languages have gained a strong foothold in the programming language landscape.
    [Show full text]
  • UC Santa Cruz UC Santa Cruz Electronic Theses and Dissertations
    UC Santa Cruz UC Santa Cruz Electronic Theses and Dissertations Title Executable Refinement Types Permalink https://escholarship.org/uc/item/92c8b5hp Author Knowles, Kenneth Lorenz Publication Date 2014 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA SANTA CRUZ EXECUTABLE REFINEMENT TYPES A dissertation submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in COMPUTER SCIENCE by Kenneth L. Knowles March 2014 The dissertation of Kenneth L. Knowles is approved: Professor Cormac Flanagan, Chair Professor Luca de Alfaro Professor Ranjit Jhala Tyrus Miller Vice Provost and Dean of Graduate Studies Copyright c by Kenneth L. Knowles 2014 Table of Contents List of Figures vii Abstract ix Acknowledgments xii 1 Introduction1 1.1 Specification Disciplines...........................3 1.1.1 Dynamic Contracts..........................4 1.1.2 Refinement Types..........................6 1.1.3 Extended Static Checking......................7 1.2 Thesis Overview...............................8 2 Preliminaries 13 2.1 Preparatory Readings............................ 13 2.2 The Simply-Typed λ-Calculus........................ 14 2.2.1 Syntax of STLC........................... 15 2.2.2 Operational Semantics of STLC................... 17 2.2.3 The STLC Type System....................... 19 3 Executable Refinement Types 23 3.1 The Language λH ............................... 25 3.2 Operational Semantics of λH ........................ 28 3.3 Denotation of λH types to sets of ST LC terms.............. 30 3.4 The λH Type System............................ 32 3.4.1 Typing for λH ............................ 33 3.4.2 Type well-formedness for λH .................... 34 3.4.3 Environment well-formedness for λH ................ 35 3.4.4 Subtyping for λH ..........................
    [Show full text]
  • Typed First-Class Traits
    Typed First-Class Traits Xuan Bi The University of Hong Kong, Hong Kong, China [email protected] Bruno C. d. S. Oliveira The University of Hong Kong, Hong Kong, China [email protected] Abstract Many dynamically-typed languages (including JavaScript, Ruby, Python or Racket) support first-class classes, or related concepts such as first-class traits and/or mixins. In those languages classes are first-class values and, like any other values, they can be passed as an argument, or returned from a function. Furthermore first-class classes support dynamic inheritance: i.e. they can inherit from other classes at runtime, enabling programmers to abstract over the inheritance hierarchy. In contrast, type system limitations prevent most statically-typed languages from having first-class classes and dynamic inheritance. This paper shows the design of SEDEL: a polymorphic statically-typed language with first- class traits, supporting dynamic inheritance as well as conventional OO features such as dynamic dispatching and abstract methods. To address the challenges of type-checking first-class traits, SEDEL employs a type system based on the recent work on disjoint intersection types and dis- joint polymorphism. The novelty of SEDEL over core disjoint intersection calculi are source level features for practical OO programming, including first-class traits with dynamic inherit- ance, dynamic dispatching and abstract methods. Inspired by Cook and Palsberg’s work on the denotational semantics for inheritance, we show how to design a source language that can be elaborated into Alpuim et al.’s Fi (a core polymorphic calculus with records supporting disjoint polymorphism). We illustrate the applicability of SEDEL with several example uses for first- class traits, and a case study that modularizes programming language interpreters using a highly modular form of visitors.
    [Show full text]
  • Universidad De Chile Facultad De Ciencias Físicas Y Matem´Aticas Departamento De Ciencias De La Computaci´On Empirically-Driv
    UNIVERSIDAD DE CHILE FACULTAD DE CIENCIAS F´ISICAS Y MATEMATICAS´ DEPARTAMENTO DE CIENCIAS DE LA COMPUTACION´ EMPIRICALLY-DRIVEN DESIGN AND IMPLEMENTATION OF GRADUALTALK TESIS PARA OPTAR AL GRADO DE DOCTOR EN CIENCIAS MENCION´ COMPUTACION´ OSCAR EDWIN ALVAREZ CALLAU´ PROFESORES GU´IAS: ERIC´ TANTER ROMAIN ROBBES MIEMBROS DE LA COMISION:´ MAR´IA CECILIA BASTARRICA PINEYRO~ ALEXANDRE BERGEL OSCAR NIERSTRASZ Este trabajo ha sido parcialmente financiado por CONICYT, NIC Chile y Microsoft Research SANTIAGO DE CHILE 2015 Resumen Los lenguajes de tipado din´amicopermiten un desarrollo ´agil. Sin embargo, cuando estos peque~nosprogramas se convierten en aplicaciones grandes, depurar se vuelve una tarea tediosa. Esto se debe principalmente a que los errores son solo detectables en tiempo de ejecuci´on. Smalltalk, al ser un lenguaje de tipado din´amico,sufre de estos problemas. Los sistemas de tipos pueden disminuir ciertos errores de los lenguajes de tipado din´amico. Adem´as,la inserci´onde tipos mejora la documentaci´onde APIs, provee un mejor soporte a los editores y ayuda a optimizar la compilaci´on.Los sistema de tipos, especialmente dise~nadospara lenguajes existentes, son llamados sistema de tipos retro-alimentados (retrofitted type systems en ingl´es). Dise~narun sistema de tipos retro-alimentado es una tarea complicada. Esto se debe a que tales sistemas de tipos deben soportar patrones de programaci´onmuy particulares (llamados idioms), minimizar la refactorizaci´onde c´odigopor la inserci´onde tipos, y proveer una integraci´onentre las partes (ej. m´odulos)con y sin tipos. Estos problemas son exacerbados cuando el lenguaje destino es altamente din´amico,como Smalltalk.
    [Show full text]