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 63 for “"Agda"”.

  1. An Agda scope checker implemented in Agda

    Agda [1] is a Haskell-style, purely functional, dependently typed programming language and theorem prover. Scope checking is the process of analyzing the Abstract Syntax Tree (AST) of a program and resolving all references to symbols by connecting them to the corresponding declarations of said …

    chalmers Repository record for An Agda scope checker implemented in Agda (opens in a new tab)

  2. A New Synthesis Tool for Agda

    Agda is a dependently typed functional programming language and proof assistant based on constructive type theory. Agda programmers spend most of their time working with unfinished programs where uncompleted parts are marked by holes. These holes can stand for anything from the core, complex parts …

    chalmers Repository record for A New Synthesis Tool for Agda (opens in a new tab)

  3. A totaly Epic backend for Agda

    Agda is a programming language that utilises dependent types which add the power to express properties about terms very precisely, but this also introduces a runtime performance overhead. This thesis presents a new compiler backend for Agda targeting Epic with the aim to use the types for …

    chalmers Repository record for A totaly Epic backend for Agda (opens in a new tab)

  4. Formalizing the translation method in Agda

    … translation method in the programming language Agda. In contrast to the implementation previously given by Wood and Zeilberger, the bijections produced by our implementation are formally verified, making our implementation more robust. We also take advantage of the fact that Agda is a proof …

    reykjavik Repository record for Formalizing the translation method in Agda (opens in a new tab)

  5. 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, …

    reykjavik Repository record for Interactions of (co)monads in Agda (opens in a new tab)

  6. Polynomial Functors in Agda: Theory and Practice

    … [3]. This thesis formalizes Poly in Cubical Agda and showcases its use in dynamical systems, contributing to the Poly code ecosystem. The first part, theory, formalizes the category Poly itself and many of its categorical constructs, including the initial and terminal objects, product, …

    chalmers Repository record for Polynomial Functors in Agda: Theory and Practice (opens in a new tab)

  7. Towards Reasoning about State Transformer Monads in Agda

    … typed functional programming language Agda. In particular he defined a notion of state which is parameterized by a list of types indicating what kind of data are to be stored in the respective locations. He also showed how to define monadic state transformation over this notion of …

    chalmers Repository record for Towards Reasoning about State Transformer Monads in Agda (opens in a new tab)

  8. Autoformalization for Agda via Fine-tuning Large Language Models

    … especially for less-popular systems such as Agda. We address this gap by introducing SMAD (Synthetic Multilanguage Autoformalization Dataset), a 400K 4-to-3 parallel corpus covering four formal languages (Dedukti, Agda, Coq, Lean) and three natural languages (English, French, Swedish), …

    chalmers Repository record for Autoformalization for Agda via Fine-tuning Large Language Models (opens in a new tab)

  9. Univalent Categories A formalization of category theory in Cubical Agda

    … proof of univalence. The programming language Agda has been extended with capabilities for working in such a cubical setting. This thesis will explore the usefulness of this extension in the context of category theory. The thesis will motivate the need for univalence and explain why …

    chalmers Repository record for Univalent Categories A formalization of category theory in Cubical Agda (opens in a new tab)

  10. Provably Correct Key-Value Maps in Agda - Leveraging Membership to Reach Correctness

    … of a provably correct finite map in the Agda programming language. Finite maps are fundamental data structures in computer science, and existing finite maps in Agda can be improved in terms of correctness and some implementation details. We present an extension of ‘A Theory of Finite …

    chalmers Repository record for Provably Correct Key-Value Maps in Agda - Leveraging Membership to Reach Correctness (opens in a new tab)

  11. An Agda Formalisation of Modalities and Erasure in a Dependently Typed Language

    Modal types extend the expressivity of types by giving them different interpretations depending on the used modality. In this thesis, we develop a general modality structure in the setting of a dependently typed language, notably containing dependent products and sums as well as natural numbers, …

    chalmers Repository record for An Agda Formalisation of Modalities and Erasure in a Dependently Typed Language (opens in a new tab)

  12. Methods for using Agda to prove Safety and Liveness for Concurrent Programs

    … dependent type theory, the proof checking tool Agda [Nor09], is used. The methods are based on the semi-formal theory of the semantics of concurrent programming from [OL82] (Owicki and Lamport, 1981);. The formalisation and implementation in Agda is done with two di erent approaches, which we …

    chalmers Repository record for Methods for using Agda to prove Safety and Liveness for Concurrent Programs (opens in a new tab)

  13. Singly typed actors in Agda - An approach to distributed programming with dependent types

    … actors, implemented as a shallow embedding in Agda. The shallow embedding allows for a minimal calculus that does not sacrifice usability, since programs are expressed using the full power of Agda— a deep embedding would not have allowed for the same experimental investigation without …

    chalmers Repository record for Singly typed actors in Agda - An approach to distributed programming with dependent types (opens in a new tab)

  14. An Agda proof of the correctness of Valiant’s algorithm for context free parsing

    … programming languages, using pattern matching. Agda is a dependently typed functional programming language that doubles as a proof assistant and is hence very suitable for implementing and proving the correctness of Valiant’s algorithm. In this thesis, we provide a very natural specification for …

    chalmers Repository record for An Agda proof of the correctness of Valiant’s algorithm for context free parsing (opens in a new tab)

  15. On Initial Categories with Families Formalization of unityped and simply typed CwFs in Agda

    … The work revolves around implementing in the Agda proof assistant categories with families at three levels: (i) untyped, (ii) simply typed, and (iii) dependently typed calculi. The formalization primarily consists of constructing initial objects in the category of categories with families and …

    chalmers Repository record for On Initial Categories with Families Formalization of unityped and simply typed CwFs in Agda (opens in a new tab)

  16. Dependent Types as a Medium for Domain Modelling: Case Studies and Lessons from Agda

    … through a series of case studies developed in Agda, spanning multiple domains: a railway system modelled at both problem-space and solution-space levels, a structure-aware version control system, file and order management systems, and a typed calculator serving as a low-payoff baseline. Across …

    mcmaster Repository record for Dependent Types as a Medium for Domain Modelling: Case Studies and Lessons from Agda (opens in a new tab)

  17. Dependently typed programming language translation to go programming language /

    … of programming language with dependent types (Agda) to other programming languages and describes implemented improvements to the existing Agda to Go translator. The theoretical part of the work compares the main ideas and use cases of Go and Agda programming languages, describes the translators …

    vilnius Repository record for Dependently typed programming language translation to go programming language / (opens in a new tab)

  18. (Re-)Creating sharing in Agda's GHC backend

    Agda is a dependently-typed programming language and theorem prover, supporting proof construction in a functional programming style. Due to its incredibly flexible concrete syntax and support for Unicode identifiers, Agda can be used to construct elegant and expressive proofs in a format that is …

    mcmaster Repository record for (Re-)Creating sharing in Agda's GHC backend (opens in a new tab)

  19. TYPES OF ALGEBRAIC STRUCTURES IN PROOF ASSISTANT SYSTEMS

    … on the standard library of four proof systems (Agda, Idris, Lean, and Coq), we define the scope for our research to study types of algebraic structures in proof systems. From the result of the survey, we establish our focus to contribute to the Agda standard library. Universal algebra studies …

    mcmaster Repository record for TYPES OF ALGEBRAIC STRUCTURES IN PROOF ASSISTANT SYSTEMS (opens in a new tab)

  20. Programavimo kalbos su priklausomais tipais transliavimas į Go programavimo kalbą /

    … The theoretical part of this paper describes Agda and Go programming languages, existing translators, and their similarities. In the practical part we define the intermediate representation of Go functions and translation rules which define translations from Agda treeless syntax to our defined …

    vilnius Repository record for Programavimo kalbos su priklausomais tipais transliavimas į Go programavimo kalbą / (opens in a new tab)

Page 1 of 4