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 127 articles , 1 standard article )
Showing results 1 to 20 of 127.
Sorted by year (- Kocsis, Zoltan A.; Swan, Jerry: Genetic programming $+$ proof search $=$ automatic improvement (2018)
- Bach Poulsen, Casper; Mosses, Peter D.: Flag-based big-step semantics (2017)
- 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)
- Carette, Jacques; Farmer, William M.: Formalizing mathematical knowledge as a biform theory graph: a case study (2017)
- Carter, Nathan C.; Monks, Kenneth G.: A web-based toolkit for mathematical word processing applications with semantics (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)
- Ko, Hsiang-Shang; Gibbons, Jeremy: Programming with ornaments (2017)
- Omar, Cyrus; Voysey, Ian; Hilton, Michael; Aldrich, Jonathan; Hammer, Matthew A.: Hazelnut: a bidirectionally typed structure editor calculus (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)
- Uustalu, Tarmo; Veltri, Niccolò: Finiteness and rational sequences, constructively (2017)
- van Doorn, Floris; von Raumer, Jakob; Buchholtz, Ulrik: Homotopy type theory in Lean (2017)
- Ziliani, Beta; Sozeau, Matthieu: A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading (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)