A Brief Overview of Agda - A Functional Language with Dependent Types

@inproceedings{Bove2009ABO,
  title={A Brief Overview of Agda - A Functional Language with Dependent Types},
  author={Ana Bove and Peter Dybjer and Ulf Norell},
  booktitle={TPHOLs},
  year={2009}
}
We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-Löf’s intuitionistic type theory but extends it with numerous programming language features. It supports a wide range of inductive data types, including inductive families and inductive-recursive types, with associated flexible pattern-matching. Unlike other proof assistants, Agda is not tactic-based. Instead it has an Emacs-based interface which allows… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 186 citations. REVIEW CITATIONS

Topics

Statistics

020402009201020112012201320142015201620172018
Citations per Year

186 Citations

Semantic Scholar estimates that this publication has 186 citations based on the available data.

See our FAQ for additional information.