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 88 articles , 1 standard article )
Showing results 1 to 20 of 88.
Sorted by year (- Blanqui, Frédéric: Termination of rewrite relations on $\lambda$-terms based on Girard’s notion of reducibility (2016)
- Escardó, Martín; Xu, Chuangjie: A constructive manifestation of the Kleene-Kreisel continuous functionals (2016)
- Altenkirch, Thosten; 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)
- de Moura, Leonardo; Kong, Soonho; Avigad, Jeremy; van Doorn, Floris; von Raumer, Jakob: The Lean theorem prover (system description) (2015)
- Hinze, Ralf (ed.); Voigtländer, Janis (ed.): Mathematics of program construction. 12th international conference, MPC 2015, Königswinter, Germany, June 29 -- July 1, 2015. Proceedings (2015)
- Kokke, Pepijn; Swierstra, Wouter: Auto in Agda (2015)
- Ahman, Danel; Chapman, James; Uustalu, Tarmo: When is a container a comonad? (2014)
- Anand, Abhishek; Rahli, Vincent: Towards a formally verified proof assistant (2014)
- Casinghino, Chris; Sjöberg, Vilhelm; Weirich, Stephanie: Combining proofs and programs in a dependently typed language (2014)
- Cockx, Jesper; Piessens, Frank; Devriese, Dominique: Overlapping and order-independent patterns. Definitional equality for all (2014)
- Constable, Robert; Bickford, Mark: Intuitionistic completeness of first-order logic (2014)
- Firsov, Denis; Uustalu, Tarmo: Certified CYK parsing of context-free languages (2014)
- Heras, Jónathan; Komendantskaya, Ekaterina: Recycling proof patterns in Coq: case studies (2014)
- Kahl, Wolfram: A mechanised abstract formalisation of concept lattices (2014)
- Kahl, Wolfram: Categories of coalgebras with monadic homomorphisms (2014)
- Kinoshita, Yoshiki; Power, John: Category theoretic structure of setoids (2014)
- Lindblad, Fredrik: A focused sequent calculus for higher-order logic (2014)
- Pouliasis, Konstantinos; Primiero, Guiseppe: J-Calc: a typed lambda calculus for intuitionistic justification logic (2014)
- Sculthorpe, Neil; Hutton, Graham: Work it, wrap it, fix it, fold it (2014)