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 21 for “"OCaml"”.

  1. Perceus for OCaml

    … by presenting an implementation of Perceus in OCaml, an industrial-strength programming language with a heavily fine-tuned and performant garbage collector. The implementation, as evaluated against the benchmark suite used in the Perceus paper, is competitive with the OCaml (version 4.14.0) …

    gatech Repository record for Perceus for OCaml (opens in a new tab)

  2. CHIRON: MECHANIZING MATHEMATICS IN OCAML

    <p>Computer algebra systems such as Maple [2] and Mathematica [12] are good at symbolic computation, while theorem proving systems such as Coq [11] and pvs [9] are well-developed for creating formal proofs. However, people are searching for a mechanized mathematics system which can provide highly …

    mcmaster Repository record for CHIRON: MECHANIZING MATHEMATICS IN OCAML (opens in a new tab)

  3. A static semantics for labels in OCaml

    … 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 labels is correct or not, a type inference …

    uiuc Repository record for A static semantics for labels in OCaml (opens in a new tab)

  4. IR-MetaOCaml : (re)implementing MetaOCaml

    … of a multi-stage programming system MetaOCaml. The system presented here differs from the OCaml implementation by Taha et al in that it is implemented on top of a modern OCaml compiler. It differs from BER MetaOCaml in that it supports generation of native code in a turn-key fashion. It …

    ubc Repository record for IR-MetaOCaml : (re)implementing MetaOCaml (opens in a new tab) Download PDF for IR-MetaOCaml : (re)implementing MetaOCaml (opens in a new tab)

  5. On Reducing the Trusted Computing Base in Binary Verification

    … The first contribution targets the validation of OCaml-to-PVS translation -- commonly used to translate instruction-set-architecture (ISA) specifications to PVS -- where the destination language is non-executable. We present a methodology called OPEV to validate the translation between OCaml and …

    vt Repository record for On Reducing the Trusted Computing Base in Binary Verification (opens in a new tab)

  6. Srovnání efektivity různých programovacích jazyků při práci s automaty

    V této práci jsou srovnány jazyky C++, C#, OCaml a Python na základě rychlosti, paměťové náročnosti a programátorské přívětivosti. Práce si klade otázku, jak moc se liší programy pracující s konečnými automaty, pokud jsou zapsané v různých jazycích. V každém jazyce je implementována stejná sada …

    brno-tech Repository record for Srovnání efektivity různých programovacích jazyků při práci s automaty (opens in a new tab)

  7. Compiling dynamic languages via statically typed functional languages

    … it into the statically typed functional language OCaml. An interesting practical advantage of using modern statically typed functional languages is that they use Hindley-Milner type systems, which means that there is no need for the translation to construct type terms. We compare the performance …

    rice Repository record for Compiling dynamic languages via statically typed functional languages (opens in a new tab)

  8. Understanding the interaction between elaboration and quotation

    … high-level languages such as Haskell, Scala and OCaml has been very slow. In particular, our focus, Typed Template Haskell has been implemented for a number of years but the ecosystem has failed to adopt the multi-stage ideas. The situation hasn’t been helped by a number of soundness and …

    bristol Repository record for Understanding the interaction between elaboration and quotation (opens in a new tab) Download PDF for Understanding the interaction between elaboration and quotation (opens in a new tab)

  9. Symbolic semantics for CSP

    … It also gives us the ability to extract Ocaml code for an HCSP-based simulator directly from Isabelle.

    uiuc Repository record for Symbolic semantics for CSP (opens in a new tab)

  10. Refutation-Based Semantic-Type Checking

    … with powerful type systems such as Haskell 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 …

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

  11. Strongly typed, compile-time safe and loosely coupled data persistence

    … relational framework, called Qanat, in the OCaml programming language and using a loosely coupled SQL database. We further report experimental results obtained by running a number of benchmark tests, and compare the resulting Qanat applications with the equivalent, raw database driver based …

    birmingham Download PDF for Strongly typed, compile-time safe and loosely coupled data persistence (opens in a new tab)

  12. Program Synthesis With Types

    … because programs in richly-typed languages like OCaml and Haskell are known for ``writing themselves'' once the programmer gets the types correct. In light of this observation, can we use type theory to build more expressive and efficient type-directed synthesis systems for this domain of …

    penn Repository record for Program Synthesis With Types (opens in a new tab)

  13. Dynamic Analyses of Result Quality in Energy-Aware Approximate Programs

    … based on an extension to the functional language OCaml. We add approximation constructs to the language, an approximation simulator to the runtime, and profiling and auto-tuning tools for studying and experimenting with energy-quality tradeoffs. We also present two offline debugging tools and …

    washington Repository record for Dynamic Analyses of Result Quality in Energy-Aware Approximate Programs (opens in a new tab)

  14. Expressive and efficient streaming libraries

    … languages, from Java to C# to Scala to OCaml to Haskell. Yet expressivity and performance are still lacking. This dissertation identifies the key high-level differences between various implementations, observes that future use cases are tied with past design decisions, and shows that …

    greece Repository record for Expressive and efficient streaming libraries (opens in a new tab)

  15. Verified optimizations for functional languages

    … Coq's extraction plugin to obtain a program (in OCaml, Haskell, or Scheme) that can be compiled and executed. However, bugs in either the extraction function or the compiler of the extraction language can render source-level verification useless. A verified compiler is a compiler whose output …

    greece Repository record for Verified optimizations for functional languages (opens in a new tab)

  16. Polarized substructural session types

    … relatively full featured interpreter written in OCaml; a fragment of SILL as an embedded domain specific language in Haskell; and a cleaner version of the same in Idris. Lastly, we show that Liquid Types and Session Types are compatible. This gives us one notion of a dependently session typed …

    uiuc Repository record for Polarized substructural session types (opens in a new tab)

  17. Amortised resource analysis for object-oriented programs

    … of the type inference algorithm and developed an OCaml implementation and experimental evaluation that shows that we can compute linear upper-bounds to the heap-space requirements of many programs, including sorting algorithms for lists such as insertion sort and merge sort and also programs that …

    lmu-germany Repository record for Amortised resource analysis for object-oriented programs (opens in a new tab)

  18. An implementation of the language lambda Prolog organized around higher-order pattern unification.

    … efficiency and a compiler that is written in the OCaml language so as to enhance readability and extensibility. This mix of languages within one system raises interesting software issues that are handled. Portability across architectures for the emulator is also treated by developing a modular …

    umn Repository record for An implementation of the language lambda Prolog organized around higher-order pattern unification. (opens in a new tab)

  19. Statická analýza v nástroji Facebook Infer zaměřená na analýzu výkonnosti

    Statická analýza se v současnosti dostává do popředí v oblasti technik pro odhalování chyb v moderním software. Nedostatečná škálovatelnost, především v kombinaci se zachováním potřebné přesnosti, je však přetrvávající problém u většiny současných nástrojů pro statickou analýzu, což je činí …

    brno-tech Repository record for Statická analýza v nástroji Facebook Infer zaměřená na analýzu výkonnosti (opens in a new tab)

Page 1 of 2