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 3 of 3 for “"monad transformers"”.

  1. Modular Compilers and Their Correctness Proofs

    … in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are developed to assist in modular compiler …

    uiuc Repository record for Modular Compilers and Their Correctness Proofs (opens in a new tab)

  2. Categorical semantics and composition of tree transducers

    … The second approach is based on free monads and monad transformers. In the same way as monoids are used in the theory of character string automata, we use monads in the theory of tree transducers. We generalize the notion of a tree transducer defining the monadic transducer, and we …

    qucosa-diss

  3. Formally justified and modular Bayesian inference for probabilistic programs

    … functional programming abstractions called monad transformers. We develop a compact Haskell library for probabilistic programming closely corresponding to the semantic construction, giving users a high level of assurance in the correctness of the implementation. We also demonstrate on a …

    cambridge Repository record for Formally justified and modular Bayesian inference for probabilistic programs (opens in a new tab)