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 98 for “"Type inference"”.
-
Universally Quantified Type Inference
Haskell’s type system is based on the Hindley–Milner type system, which supports only rank-1 types. As functional languages have evolved, higher-rank types have been recognized as being useful for expressing more general abstract functions. Peyton Jones et al. introduced a type inference algorithm …
-
Type inference in SQL
Type inference is an important concept in programming languages. In this Thesis, we study this problem and propose a framework for type inference in SQL, the database programming language for relational databases such as Oracle and Sybase. We consider a context-free grammar G SQL which covers the …
-
Incremental on-line type inference
Type inference in interactive programming environments falls short in two respects. The ability to type check definitions one at a time, and to type check some definitions but not all after one definition is modified is called incremental on-line type inference. Current interactive programming …
-
Type inference for action semantics
… combinators that operate on collections of types. Our work includes a category-sorted algebra-based model for action semantics; a unification-based type inference algorithm for action expressions similar to that used for ML, extended with subtypes and records; proofs of its soundness and …
-
Type inference, Haskell and dependent types
This thesis studies questions of type inference, unification and elaboration for languages that combine dependent type theory and functional programming. Languages such as modern Haskell have very expressive type systems, allowing the programmer a great deal of freedom. These require advanced type …
-
Interval Type Inference: Improvements and Evaluations
… an upper bound. Interval analysis for integral types is useful in providing facts of the target program to help developers find issues such as unsafe narrowing casts, out-of-bound array indices, numerical overflows/underflows, divisions-by-zero, and dead branches. Various approaches have been …
-
Memory Safety Through Branded Type Inference
… PhantomLatch builds on this idea using branded types to track a separate object representing access to a reference, like in previous research (Yanovski et al., 2021). In PhantomLatch, these objects are called keys. The novel aspect of PhantomLatch is the ability for the compiler to infer when …
-
Type-Inference Based Deforestation of Functional Programs
… with a new analysis that is based on type inference. Short cut deforestation eliminates an intermediate list by a single, local transformation. In return, short cut deforestation expects both producer and consumer of the intermediate list in a certain form. Whereas the required form of …
-
Demand-Driven Type Inference with Subgoal Pruning
… languages like Smalltalk do not have much static type information immediately available before the program runs. Static types can still be inferred by analysis tools, but historically, such analysis is only effective on smaller programs of at most a few tens of thousands of lines of code. This …
-
Type Inference in Flexible Model-Driven Engineering
… with nodes that are unintentionally left untyped. In this thesis we propose the use of approaches that use algorithms from three different research areas, that of classification algorithms, constraint programming and graph similarity to help with the type inference of such untyped nodes. We …
-
Type inference with overloading using an attribute grammar
… static analysis. One form of analysis is type checking, yet type checking in this setting for languages with common features like overloading has received little attention. We implement an interactive type checker for the polymorphic type system of ML with overloading. The implementation …
-
QuAC : quick attribute-centric type inference for Python
… static checking and bug-finding tools. Python type annotations can make these tools more useful. Type inference tools aim to reduce developers’ burden of adding them. However, existing type inference tools struggle to support dynamic features, infer correct types (especially container type …
-
Designing type inference for typed object-oriented languages
Type-checked object-oriented languages have typically been designed with extremely simple type systems. However, there has recently been intense interest in extending such languages with more sophisticated types and subtyping relationships. JAVA and C# are mainstream languages that have been …
-
Practical Type Inference for the GADT Type System
Generalized algebraic data types (GADTs) are a type system extension to algebraic 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 …
-
Complexity Analysis of Tunable Type Inference for Generic Universe Types
… the computational complexity of a tunable static type inference problem which was introduced in prior research [1]. The problem was assumed to be inherently difficult, without evidence, and a SAT solver was used to obtain a solution. In this thesis, we analyze the complexity of the inference …
-
A type inference algorithm and transition semantics for polymorphic C
In an attempt to bring the ML-style type inference to the C programming language, Smith and Volpano developed a type system for a dialect of C, called PolyC SmV96a SmV95b. PolyC extends C with ML-style polymorphism and a limited form of higher-order function. Smith and Volpano proved a type …
-
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 …
-
BinType: A Scalable Type Inference Tool for Compiled C Programs
… In particular, recovering variables and their type is challenging as most such information is lost during compilation. Although past proposals seem to have addressed this problem, their approaches are either not scalable and suffer from coverage issues (e.g., dynamic analysis), or yield …
-
A Type System with Physical Units Checked Using Bidirectional Type Inference
… often accepted silently by compilers. Previous type systems for checking physical units have mainly relied on unification, a method that often produces long and confusing error messages. This thesis introduces a type system based on bidirectional type checking. Unlike unification-based systems …
Page 1 of 5