Agda
Agda is a dependently typed functional programming language: It has inductive families, which are similar to Haskell’s GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram and NuPRL. This package includes both a command-line program (agda) and an Emacs mode. If you want to use the Emacs mode you can set it up by running agda-mode setup (see the README). Note that the Agda library does not follow the package versioning policy, because it is not intended to be used by third-party packages.
Keywords for this software
References in zbMATH (referenced in 104 articles , 1 standard article )
Showing results 1 to 20 of 104.
Sorted by year (- Blanchette, Jasmin Christian; Bouzy, Aymeric; Lochbihler, Andreas; Popescu, Andrei; Traytel, Dmitriy: Friends with benefits. Implementing corecursion in foundational proof assistants (2017)
- Botta, Nicola; Jansson, Patrik; Ionescu, Cezar; Christiansen, David R.; Brady, Edwin: Sequential decision problems, dependent types and generic solutions (2017)
- Cimini, Matteo; Siek, Jeremy G.: Automatically generating the dynamic semantics of gradually typed languages (2017)
- Grohne, Helmut; Voigtländer, Janis: Formalizing semantic bidirectionalization and extensions with dependent types (2017)
- Palmgren, Erik: Constructions of categories of setoids from proof-irrelevant families (2017)
- Slama, Franck; Brady, Edwin: Automatically proving equivalence by type-safe reflection (2017)
- Bernardy, Jean-Philippe; Jansson, Patrik: Certified context-free parsing: a formalisation of Valiant’s algorithm in Agda (2016)
- Blanqui, Frédéric: Termination of rewrite relations on $\lambda$-terms based on Girard’s notion of reducibility (2016)
- Bove, Ana; Krauss, Alexander; Sozeau, Matthieu: Partiality and recursion in interactive theorem provers -- an overview (2016)
- Chatzikyriakidis, Stergios; Luo, Zhaohui: Proof assistants for natural language semantics (2016)
- Chiang, Yu-Hsi; Mu, Shin-Cheng: Formal derivation of greedy algorithms from relational specifications: a tutorial (2016)
- Cockx, Jesper; Devriese, Dominique; Piessens, Frank: Unifiers as equivalences: proof-relevant unification of dependently typed data (2016)
- Escardó, Martín; Xu, Chuangjie: A constructive manifestation of the Kleene-Kreisel continuous functionals (2016)
- Honsell, Furio; Lenisa, Marina; Liquori, Luigi; Scagnetto, Ivan: Implementing Cantor’s paradise (2016)
- Kanso, Karim; Setzer, Anton: A light-weight integration of automated and interactive theorem proving (2016)
- Schubert, Aleksy; Urzyczyn, Paweł; Zdanowski, Konrad: On the Mints hierarchy in first-order intuitionistic logic (2016)
- Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo: Monads need not be endofunctors (2015)
- Berger, Ulrich; Lawrence, Andrew; Forsberg, Fredrik Nordvall; Seisenberger, Monika: Extracting verified decision procedures: DPLL and resolution (2015)
- Capriotti, Paolo; Kraus, Nicolai; Vezzosi, Andrea: Functions out of higher truncations (2015)
- de Moura, Leonardo; Kong, Soonho; Avigad, Jeremy; van Doorn, Floris; von Raumer, Jakob: The Lean theorem prover (system description) (2015)