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 22 for “"monads"”.
-
Parameterized monads in linguistics
… this dissertation uses parameterized monads, a particular theoretical framework in category theory, as a dynamic semantic framework to reinterpret the compositional Discourse Representation Theory(cDRT), and to provide an analysis of donkey anaphora. Parameterized monads are also used …
-
Interactions of (co)monads in Agda
We study interaction laws of monads and comonads in the interactive theorem prover Agda. Effectful computations are modeled as monads, while comonads model computation-running machines. Interaction laws describe how computations may be uniformly run to yield values. We study monads and comonads on …
-
Programming and static analysis with graded monads
… impure, side-effecting computation using monads. Recent research in program semantics has focussed on graded monads, a useful generalisation of monads which allow the programmer to establish useful properties of a computation purely from their type of a computation. They have been used to …
-
Feasibility of Vector Instruction-Set Semantics Using Abstract Monads
Formalizations of instruction-set semantics help establish formal proofs of correctness of both hardware designed to implement these instruction sets and the software implemented against this specification. One such prior work1 formalizes a specification of a subset of the RISC-V instruction-set …
-
Mapping spaces of algebras over iterated +-construction for polynomial monads
In a 2019 paper "Polynomial monads and delooping of maping spaces", Batanin and De Leger have introduced an extension of Grothendieck homotopy theory from the cate- gory of small categories to the category of polynomial monads. As an application (among other), they provided a new proof of a famous …
-
State transformers and modes of computation
… to adjunctions in a 2-category. A calculus of monads in a 2-category is presented, and general lifting theorems are proved. Applications to constructions in categorical automata theory are given, and a representation theorem for strong monads into the monad of continuations is proved.
-
Autonomous Pseudomonoids
… by means of pseudo-commutative enriched monads (a slight generalisation of the pseudo-commutative 2-monads of [37], and showing that lax-idempotent 2-monads are pseudo-commutative. Finally we apply the general theory developed for pseudomonoids to deduce the main results of [27].
-
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 …
-
Kantian Questions, Leibnizian Responses
… and incorrectly reduced sensible bodies to the monads that allegedly underlie them. My project is to show that although these are powerful and original objections, Leibniz did not sacrifice the material world for the monadic. It is argued that Leibniz had an ontology that allowed for the real …
-
Melting and crystallization studies in a partially excluding copolymer
… phase tends to exclude one of two similar monads. Previous studies on PEKK have focused on effects of changing overall composition on the melting and crystallization behavior. These studies have demonstrated that PEKK tends to exclude one of two chemically similar monads from the …
-
Goodwillie calculus and I
… operad and module structures for derivatives of monads and their modules, leading to a chain rule for higher derivatives. We also define a category through which n-excisive finitary functors to spectra factor, up to homotopy, and give a classification of such functors as modules over a certain …
-
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 …
-
Monadic and Higher-Order Structure
… the relationship between algebraic theories and monads that clarifies the nature of the correspondence. The crucial insight follows from the consideration of relative monads, which are shown to act as an intermediary in the correspondence. To support our proposal that this be viewed as the …
-
Operads and Homotopy Theory
… apply to homotopy theory via their associated monads. As an application, all braid groups and symmetric groups are used to produce a free group model for the canonical stabilization of the double loop double suspension of a space. In Part II, a new idea is proposed to investigate operations on …
-
Probabilistic completion of nondeterministic models
Motivated by Moggi's work [34] on how monads can be used to capture computational behavior, there has been a growing interest in finding monads which capture the precise computational effects generated when combining the theory of probabilistic choice and the theory of nondeterministic choice. The …
-
Categories with New Foundations
… for a class of relative adjoints, (pseudo)monads, etc. Thus, where it seems appropriate to do so, this thesis seeks to contribute to the broader study of relative algebra.
-
Random Variable Spaces: Mathematical Properties and an Extension to Programming Computable Functions
… to Category Theory with special attention to Monads and the Giry Monad. The crux of the dissertation lies in the detailed exploration of Random Variable Spaces. Their mathematical properties are studied, including the establishment of relationships between these spaces through functors based …
-
Game comonads and beyond: compositional constructions for logic and algorithms
Game comonads represent a rare application of category theoretic methods to the fields of finite model theory and descriptive complexity. First introduced by Abramsky, Dawar and Wang in 2017, these new constructions exposed connections between Spoiler-Duplicator games used in logic, related …
-
Functional quantum algorithms: a mélange of methods for matrix functions
… programming, identifying them as instances of monads, suggesting concrete directions for high-level, flexible quantum algorithmic design and analysis.
-
A "new literary history" of modern poetry: history and deconstruction in the works of Whitman, Stevens, and Olson
… into the concrete universals and aesthetic monads of Modern criticism. The Modern critical tradition begins to crack under a close reading of Wallace Stevens’ poems, and it “breaks down” completely when it is brought into contact with the poetry of Whitman and Olson.</p>
Page 1 of 2