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 12 of 12 for “"Refinement types"”.

  1. Enhancing Proof Development in Liquid- Haskell: Implementation and Evaluation of Typed Holes

    Refinement type systems provide mechanisms for specifying and verifying programs beyond what mainstream type systems can express. LiquidHaskell extends Haskell with refinement types, and beyond that, has evolved to be used as a theorem prover, akin to Agda or Idris. Unfortunately, it lacks a …

    chalmers Repository record for Enhancing Proof Development in Liquid- Haskell: Implementation and Evaluation of Typed Holes (opens in a new tab)

  2. Static Types with Less Syntax: Locus Types

    Optionally and gradually-typed languages allow types to be introduced to dynamic code as needed. While this approach allows some gradual movement from dynamically to statically-typed code, it requires rewriting object-constructing code to use conventional static types. We introduce a flexible …

    waterloo Repository record for Static Types with Less Syntax: Locus Types (opens in a new tab)

  3. Manifest Contracts

    … Racket contracts check only simple types. Moreover, the standard algorithm for higher-order contract checking can lead to unbounded space consumption and can destroy tail recursion. In this dissertation, I develop so-called manifest contract systems which integrate more coherently in …

    penn Repository record for Manifest Contracts (opens in a new tab)

  4. Manifest Contracts

    … Racket contracts check only simple types. Moreover, the standard algorithm for higher-order contract checking can lead to unbounded space consumption and can destroy tail recursion. In this dissertation, I develop so-called manifest contract systems which integrate more coherently in …

    penn Repository record for Manifest Contracts (opens in a new tab)

  5. Refutation-Based Semantic-Type Checking

    … and OCaml, expressive features such as dependent types or refinement types may introduce levels of complexity that are beyond the capability of traditional type systems. This thesis proposes a shift in perspective for type checking, focusing on incorrectness reasoning guided by semantic typing. …

    jhu Repository record for Refutation-Based Semantic-Type Checking (opens in a new tab)

  6. Advanced Language-based Techniques for Correct, Secure Networked Systems

    … based on conflict-free replicated data types (CRDTs). In order to do so, we add an extension to Liquid Haskell that facilitates stating and semi-automatically proving properties of typeclasses. Our work allows refinement types to be attached to typeclass method declarations, and ensures …

    maryland Repository record for Advanced Language-based Techniques for Correct, Secure Networked Systems (opens in a new tab)

  7. An Integrated Theory of Type-Based Static and Dynamic Verification

    © 2015 Springer. http://dx.doi.org/10.1007/978-3-319-26529-2_11© 2015 ACM, Inc. http://doi.acm.org/10.1145/2676726.2676996

    kyoto Repository record for An Integrated Theory of Type-Based Static and Dynamic Verification (opens in a new tab)

  8. Lightweight Approaches to the Verification of Functional Programs

    … function’s definition. To this end, we present a refinement type system with a restricted form of structural subtyping and environment-level intersection. We describe a fully automated, sound and complete type inference procedure for this system which, under reasonable assumptions, is worst-case …

    bristol Repository record for Lightweight Approaches to the Verification of Functional Programs (opens in a new tab) Download PDF for Lightweight Approaches to the Verification of Functional Programs (opens in a new tab)

  9. Formal foundations for hybrid effect analysis

    … effect checking, the use of bounded existential types to capture the subtle interactions between static typing and dynamic typing, and a differential alignment strategy to achieve efficiency in dynamic typing.</p> <p>We introduce the idea of first-class effects, where the computational effect of …

    iastate Repository record for Formal foundations for hybrid effect analysis (opens in a new tab)

  10. Learning Program Specifications from Sample Runs

    … represented as terms in a decidable refinement type representation, are discovered from observing a program's sample runs in terms of either program execution paths or input-output values, and automatically verified through the use of expressive refinement type systems. Our approach …

    purdue-thes Repository record for Learning Program Specifications from Sample Runs (opens in a new tab)

  11. Towards More Expressive and Usable Types for Dynamic Languages

    … Python, feature dynamic type systems, in which types are not known until runtime. Dynamic typing provides the programmer with flexibility and allows for rapid program development. In contrast, static type systems, found in languages like C++ and Java, help catch errors early during development, …

    maryland Repository record for Towards More Expressive and Usable Types for Dynamic Languages (opens in a new tab)

  12. Towards eliminating expert creative help in automated reasoning

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-03-28 without embargo terms

    uiuc Repository record for Towards eliminating expert creative help in automated reasoning (opens in a new tab)