Agda-curious?: an exploration of programming with dependent types

Authors:
Conor Thomas McBride
Affiliations:
University of Strathclyde, Glasgow, United Kingdom
Venue:
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Year:
2012

Citing 6
Cited 2

The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A predicative analysis of structural recursion

Journal of Functional Programming
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
Giving Haskell a promotion

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation

System FC with explicit kind equality

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Early detection of type errors in C++ templates

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

I explore programming with the dependently typed functional language, AGDA. I present the progress which AGDA has made, demonstrate its usage in a small development, reflect critically on the state of the art, and speculate about the way ahead. I do not seek to persuade you to adopt AGDA as your primary tool for systems development, but argue that AGDA stimulates new useful ways to think about programming problems and deserves not just curiosity but interest, support and contribution.