A Brief Overview of Agda - A Functional Language with Dependent Types
Conference contribution, 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 programming by gradual refinement of incomplete type-correct terms.

Author

Ana Bove

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Peter Dybjer

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Ulf Norell

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Theorem Proving in Higher Order Logics

Vol. 5674 LNCS 73--78-

Subject Categories

Computer Science

More information

Created

10/6/2017