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 6 of 6 for “"gradual type systems"”.

  1. An Argument against Gradual Type Systems in Programming Language Semantics

    … Siek and Walid Taha formalized the concept of gradual type systems, which integrates static and dynamic typing in a single programming language. This allows the programmer to statically or dynamically type portions of their code at will, which offers more flexibility than languages that require …

    lmu Repository record for An Argument against Gradual Type Systems in Programming Language Semantics (opens in a new tab)

  2. Gradual Typing for a More Pure JavaScript

    Dynamically typed languages have surged in popularity in recent years, owing totheir flexibility and ease of use. However, for projects of a certain size dynamictyping can cause problems of maintainability as refactoring becomes increas-ingly difficult. One proposed solution is the use of gradual …

    chalmers Repository record for Gradual Typing for a More Pure JavaScript (opens in a new tab)

  3. No Zombie Types: Liveness-Based Justification For Monotonic Gradual Types

    Gradual type systems with the monotonic dynamic semantics, such as HiggsCheck implementing SafeTypeScript, are able to achieve decent performance, making them a viable option for JavaScript programmers seeking run-time-checkable type annotations. However, the type restrictions for objects in the …

    waterloo Repository record for No Zombie Types: Liveness-Based Justification For Monotonic Gradual Types (opens in a new tab)

  4. Efficient Runtimes for Gradual Typing

    … of programming languages featuring gradual typing - which is the idea that some parts of a program may be type-checked dynamically while others are type-checked statically. This lets programmers trade off between the costs and benefits of using static type-checking for each …

    cornell Repository record for Efficient Runtimes for Gradual Typing (opens in a new tab)

  5. Reasoning About Foreign Function Interfaces: Blame and Nondeterministic Formal Semantics

    … as a way to mix programming languages. In such systems, a program written in a host language calls functions written in a guest language from within the same program. Perhaps the most popular language to interface with is C, due in no small part to its performance (often gained through unsafe …

    waterloo Repository record for Reasoning About Foreign Function Interfaces: Blame and Nondeterministic Formal Semantics (opens in a new tab)

  6. Gradual C Programming for Typed Lua

    … of enhancing the performance of dynamically-typed programming languages by integrating features from statically-typed programming languages. Statically-typed languages focus on security and performance, but dynamically-typed languages focus on flexibility and automation. Optional type-systems …

    waterloo Repository record for Gradual C Programming for Typed Lua (opens in a new tab)