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 161 articles , 1 standard article )
Showing results 1 to 20 of 161.
Sorted by year (- Chapman, James; Uustalu, Tarmo; Veltri, Niccolò: Quotienting the delay monad by weak bisimilarity (2019)
- Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico: Implementing type theory in higher order constraint logic programming (2019)
- Kunčar, Ondřej; Popescu, Andrei: From types to sets by local type definition in higher-order logic (2019)
- Baston, Colm; Capretta, Venanzio: The coinductive formulation of common knowledge (2018)
- Calderón, Guillermo: Formalizing constructive projective geometry in Agda (2018)
- Carette, Jacques; Farmer, William M.; Laskowski, Patrick: HOL Light QE (2018)
- Carette, Jacques; Farmer, William M.; Sharoda, Yasmine: Biform theories: project description (2018)
- Copello, Ernesto; Szasz, Nora; Tasistro, Álvaro: Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory (2018)
- Czajka, Łukasz; Kaliszyk, Cezary: Hammer for Coq: automation for dependent type theory (2018)
- Farmer, William M.: Incorporating quotation and evaluation into Church’s type theory (2018)
- Gunther, Emmanuel; Gadea, Alejandro; Pagano, Miguel: Formalization of universal algebra in Agda (2018)
- Kocsis, Zoltan A.; Swan, Jerry: Genetic programming (+) proof search (=) automatic improvement (2018)
- Perera, Roly; Cheney, James: Proof-relevant (\pi)-calculus: a constructive account of concurrency and causality (2018)
- Rabe, Florian: A modular type reconstruction algorithm (2018)
- Rahli, Vincent; Bickford, Mark: Validating Brouwer’s continuity principle for numbers using named exceptions (2018)
- Rahli, Vincent; Cohen, Liron; Bickford, Mark: A verified theorem prover backend supported by a monotonic library (2018)
- Rizkallah, Christine; Garbuzov, Dmitri; Zdancewic, Steve: A formal equational theory for call-by-push-value (2018)
- Stump, Aaron: From realizability to induction via dependent intersection (2018)
- Zmigrod, Ran; Daggitt, Matthew L.; Griffin, Timothy G.: An Agda formalization of Üresin & Dubois’ asynchronous fixed-point theory (2018)
- Abel, Andreas; Adelsberger, Stephan; Setzer, Anton: Interactive programming in Agda -- objects and graphical user interfaces (2017)