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 190 articles , 1 standard article )
Showing results 1 to 20 of 190.
Sorted by year (- William DeMeo: The Agda Universal Algebra Library and Birkhoff’s Theorem in Martin-Löf Dependent Type Theory (2021) arXiv
- Al-Sibahi, Ahmad Salim; Jensen, Thomas; Møgelberg, Rasmus Ejlers; Wąsowski, Andrzej: Galois connections for recursive types (2020)
- Benzmüller, Christoph; Parent, Xavier; van der Torre, Leendert: Designing normative theories for ethical and legal reasoning: \textscLogiKEyframework, methodology, and tool support (2020)
- Carette, Jacques; Farmer, William M.; Sharoda, Yasmine: Leveraging the information contained in theory presentations (2020)
- Cockx, Jesper; Abel, Andreas: Elaborating dependent (co)pattern matching: no pattern left behind (2020)
- Daggitt, Matthew L.; Zmigrod, Ran; Griffin, Timothy G.: A relaxation of Üresin and Dubois’ asynchronous fixed-point theory in Agda (2020)
- Fiore, Marcelo P.; Pitts, Andrew M.; Steenkamp, S. C.: Constructing infinitary quotient-inductive types (2020)
- Manzino, Cecilia; Pardo, Alberto: Agda formalization of a security-preserving translation from flow-sensitive to flow-insensitive security types (2020)
- Meshveliani, S. D.: On a machine-checked proof for fraction arithmetic over a GCD domain (2020)
- Swierstra, Wouter: Heterogeneous binary random-access lists (2020)
- Xu, Chuangjie: A syntactic approach to continuity of T-definable functionals (2020)
- Abel, Andreas; Allais, Guillaume; Hameer, Aliya; Pientka, Brigitte; Momigliano, Alberto; Schäfer, Steven; Stark, Kathrin: POPLMark reloaded: mechanizing proofs by logical relations (2019)
- Carette, Jacques; Farmer, William M.: Towards specifying symbolic computation (2019)
- Chapman, James; Uustalu, Tarmo; Veltri, Niccolò: Quotienting the delay monad by weak bisimilarity (2019)
- Ebner, Gabriel: Herbrand constructivization for automated intuitionistic theorem proving (2019)
- Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico: Implementing type theory in higher order constraint logic programming (2019)
- Kahl, Wolfram; Zhao, Yuhang: A flexible categorial formalisation of term graphs as directed hypergraphs (2019)
- Kunčar, Ondřej; Popescu, Andrei: From types to sets by local type definition in higher-order logic (2019)
- Kunčar, Ondřej; Popescu, Andrei: A consistent foundation for Isabelle/HOL (2019)
- Miller, Dale: Mechanized metatheory Revisited (2019)