Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 26 for “"Type inference"”.
-
Principal typings and type inference
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Type checking and type inference for object-oriented programming languages
Type systems for object-oriented programming languages have been studied a great deal over the past few years. Since Smalltalk was one of the earliest object-oriented languages, it is not surprising that there have been several attempts to provide a type system for it. Unfortunately, none of the …
-
Extensible records in the System E Framework and a new approach to object-oriented type inference
… as a foundation for studying object-oriented type inference. One of their key benefits is that they allow for an elegant encoding of object-oriented inheritance, where one class of objects may be defined as an extension of another class of objects. However, every system of type inference …
-
A polymorphic type system for logic programs
This thesis develops a polymorphic type system for logic programs. Our approach is semantically oriented. We define a type language with precise semantics. Type inference rules are derived from the semantics of the type language and the semantics of logic programs. Algorithms for automatic type …
-
Conjunctive polymorphic type checking with explicit types
An expressive type language and the ability to do compile-time type inference are desirable goals in language design, but the attainment of the former may preclude the possibility of the latter. Specifically, the type conjunction operator (type intersection) induces a rich type language at the …
-
Starkiller : a static type inferencer and compiler for Python
Starkiller is a type inferencer and compiler for the dynamic language Python designed to generate fast native code. It analyzes Python source programs and converts them into equivalent C++ programs. Starkiller's type inference algorithm is based on the Cartesian Product Algorithm but has been …
-
Combining Static and Dynamic Typing in Ruby
… such as Ruby, Python, and Perl are dynamically typed. Dynamic typing provides many advantages such as terse, flexible code and the ability to use highly dynamic language constructs, such as an eval method that evaluates a string as program text. However these dynamic features have traditionally …
-
A static semantics for labels in OCaml
In this thesis, we are proposing a type system and a type inferencer for the label-feature of OCaml. Labels in OCaml allow the naming of arguments to functions and are intended to document the code. We provide a type system that describes whether a derived type for an OCaml expression containing …
-
Improving the Runtime Performance and Robustness of Hybrid Statically and Dynamically Typed Programming Languages
Dynamically typed languages have turned out to be suitable for different software development scenarios such as Web engineering, rapid prototyping, and the construction of applications where runtime adaptability is an important issue. In contrast, statically typed languages have undeniable …
-
Julia : an efficient dynamic language for technical computing
… A design based on generic functions and a rich type system simultaneously enables an expressive programming model and successful type inference, leading to good performance for a wide range of programs. In our system, more behavior can be defined in libraries and user code, allowing our …
-
Type Checker for Annotated Assembly Programs
… Data values are marked as secret or public using type inference, and the veracity of inference is checked using a type checker. Then, hardware can separate the secret and public values. My contributions were to the type checker, as well as some scripting to evaluate results.
-
Connotational Subtyping and Runtime Class Mutability in Ruby
… is an approach to typing that allows an object's type to change dynamically, following changes to the object's internal state. This allows for a more precise representation of a problem domain with logical objects that have variable behavior. Two approaches to supporting connotational subtyping in …
-
Synthesizing Object Models from Natural Language Specifications
… approaches based on enumerative search and type inference. However, traditional synthesis techniques have no mechanism of incorporating real-world knowledge, which is commonplace in software engineering. Motivated by this, we introduce a new synthesis task known as specification reification: …
-
Javari : adding reference immutability to Java
… reachable from it by following references. The type system permits explicitly excluding fields from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. The type system is distinguishes the notions of assignability and …
-
Abstraction in technical computing
… using generic functions and data-flow type inference. Systems like these can suffer from inefficient compilation, or from uncertainty about what to specialize on. We show that sufficiently powerful type-based dispatch addresses these problems. The resulting language, Julia, achieves a …
-
Implementing a Tiled Singular Value Decomposition: A Framework for Tiled Linear Algebra in Julia
… Julia language’s multiple-dispatch and type inference facilitate the development of type-agnostic, hardware-agnostic, and multi-use frameworks by allowing composability. Utilizing a tiled approach, the implemented framework improves data locality, parallelism, and scalability, making it …
-
Translating Discrete Time SIMULINK to SIGNAL
… translation involves three major steps: clock inference, type inference and hierarchical top-down translation. We validate the semantic preservation of our prototype tool by testing it on different SIMULINK models.
-
Improving Spoken Programming Through Language Design and the Incorporation of Dynamic Context
… and we incorporate constraints gleaned from type inference. Together, these sources of context allow our programming environment to further improve on the initial performance gain enabled by our new syntax. In this dissertation, we describe the theory and design decisions that went into the …
-
Strongly typed, compile-time safe and loosely coupled data persistence
… been particularly concerned with compile-time type safety. Type mismatch errors between program and the database schema occur quite often during program development, and the techniques used in these approaches often defer error checking on database operations until runtime. In this thesis, we …
-
Automated Unit Test Generation for the Python Programming Language
… dynamic typing. Previous work has confirmed that type information is beneficial for a test generator. However, the type information is often not available. This thesis provides a comprehensive overview over the Pynguin test-generation framework for Python. Pynguin aims to generate high-coverage …
Page 1 of 2