A Brief Overview of Agda - A Functional Language with Dependent Types
Konferensbidrag (offentliggjort, men ej förlagsutgivet), 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.

Författare

Ana Bove

Chalmers, Data- och informationsteknik, Datavetenskap

Peter Dybjer

Chalmers, Data- och informationsteknik, Datavetenskap

Ulf Norell

Chalmers, Data- och informationsteknik, Datavetenskap

Theorem Proving in Higher Order Logics

Vol. 5674 LNCS 73--78-

Ämneskategorier

Datavetenskap (datalogi)