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 4 of 4 for “"Agda"”.
-
Interactions of (co)monads in Agda
… 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 an arbitrary monoidal category, …
-
An algebraic perspective on the convergence of vector-based routing protocols
… work has been formalised in the proof assistant Agda. Not only does this significantly increase users' confidence in the validity of the results, the resulting Agda library may also be used to verify the correctness of protocol implementations. To illustrate this, a formal proof of correctness is …
-
Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers
… interactive theorem provers, including Coq, Agda, and Isabelle, making it portable and accessible to a range of verification efforts and communities. Future work also includes implementing bidirectionality, supporting the translation of Haskell code to a target proof assistant and vice versa. …
-
A type-theoretic approach to semistrict higher categories
… much of its metatheory in the proof assistant Agda, and studying how certain operations of Catt behave in the presence of definitional equality. The main contribution of this thesis is to introduce two type theories, Cattsu and Cattsua, which are instances of this general framework. Cattsu, …