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

Authors:
Ana Bove;Peter Dybjer;Ulf Norell
Affiliations:
Chalmers University of Technology, Gothenburg, Sweden;Chalmers University of Technology, Gothenburg, Sweden;Chalmers University of Technology, Gothenburg, Sweden
Venue:
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Year:
2009

Citing 6
Cited 17

The calculus of constructions

Information and Computation - Semantics of Data Types
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
The Four Colour Theorem: Engineering of a Formal Proof

Computer Mathematics
Dependent Types at Work

Language Engineering and Rigorous Software Development
Dependently typed programming in Agda

AFP'08 Proceedings of the 6th international conference on Advanced functional programming

Bisimulations Generated from Corecursive Equations

Electronic Notes in Theoretical Computer Science (ENTCS)
Generative type abstraction and type-level computation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Integrating an automated theorem prover into agda

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Irrelevance in type theory with a heterogeneous equality judgement

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Equational reasoning about programs with general recursion and call-by-value semantics

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Development of secured systems by mixing programs, specifications and proofs in an object-oriented programming environment: a case study within the FoCaLiZe environment

Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Equality proofs and deferred type errors: a compiler pearl

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Dependently typed programming based on automated theorem proving

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Extracting a DPLL Algorithm

Electronic Notes in Theoretical Computer Science (ENTCS)
Type-specialized staged programming with process separation

Higher-Order and Symbolic Computation
Correctness of object oriented models by extended type inference

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Complete completion using types and weights

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Programming errors in traversal programs over structured data

Science of Computer Programming
Automating theorem proving with SMT

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Stateless higher-order logic with quantified types

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A relationally parametric model of dependent type theory

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.