Agda

Known as: Agda theorem prover, Agda (theorem prover), Agda2 
Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
This paper explores the recent addition to Agda enabling reflection, in the style of Lisp and Template Haskell. It gives a brief… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 8
Is this relevant?
2012
2012
This project explores the recent addition to Agda enabling reflection, in the style of Lisp, MetaML, and Template Haskell. It… (More)
  • figure 3.1
  • figure 3.4
  • figure 3.5
  • figure 3.7
  • figure 4.1
Is this relevant?
2012
2012
Embedded languages in Haskell benefit from a range of type extensions, such as type families, that are subsumed by dependent… (More)
Is this relevant?
2011
2011
Agda is a programming language that utilises dependent types which add the power to express properties about terms very precisely… (More)
  • figure 3.1
  • table 4.1
  • table 4.2
  • table 4.4
  • table 4.5
Is this relevant?
2011
2011
Agda is a dependently typed functional programming language and a proof assistant in which developing programs and proving their… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
We present instance arguments: an alternative to type classes and related features in the dependently typed, purely functional… (More)
Is this relevant?
Review
2009
Review
2009
We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is… (More)
Is this relevant?
Review
2009
Review
2009
Dependently typed languages have for a long time been used to describe proofs about programs. Traditionally, dependent types are… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In Hindley-Milner style languages, such as Haskell and ML, there is a clear separation between types and values. In a dependently… (More)
Is this relevant?
2004
2004
We present a tool for automated theorem proving in Agda, an implementation of Martin-Löf’s intuitionistic type theory. The tool… (More)
Is this relevant?