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.
- A. Abel and T. Altenkirch. A predicative analysis of structural recursion. phJ. Funct. Program., 12 (1): 1--41, 2002. Google Scholar
Digital Library
- A. Bove and P. Dybjer. Dependent types at work. In A. Bove, L. S. Barbosa, A. Pardo, and J. S. Pinto, editors, phLerNet ALFA Summer School, volume 5520 of phLecture Notes in Computer Science, pages 57--99. Springer, 2008. ISBN 978--3--642-03152--6. Google Scholar
Digital Library
- L. Damas and R. Milner. Principal type-schemes for functional programs. In R. A. DeMillo, editor, phPOPL, pages 207--212. ACM Press, 1982. ISBN 0--89791-065--6. Google Scholar
Digital Library
- C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In C. Hankin and D. Schmidt, editors, phPOPL, pages 81--92. ACM, 2001. ISBN 1--58113--336--7. Google Scholar
Digital Library
- J. McKinna and J. Wright. A type-correct, stack-safe, provably correct, expression compiler in epigram. Submitted to the Journal of Functional Programming, 2006.Google Scholar
- U. Norell. phTowards a Practical Programming Language based on Dependent Type Theory. PhD thesis, Chalmers University of Technology, 2007.Google Scholar
- U. Norell. Dependently Typed Programming in Agda. In P. W. M. Koopman, R. Plasmeijer, and S. D. Swierstra, editors, phAdvanced Functional Programming, volume 5832 of phLNCS, pages 230--266. Springer, 2008. Google Scholar
Digital Library
- D. A. Turner. Total functional programming. phJ. UCS, 10 (7): 751--768, 2004.Google Scholar
- }DBLP:conf/tldi/YorgeyWCJVM12B. A. Yorgey, S. Weirich, J. Cretin, S. L. P. Jones, D. Vytiniotis, and J. P. Magalh\ aes. Giving haskell a promotion. In B. C. Pierce, editor, phTLDI, pages 53--66. ACM, 2012. ISBN 978--1--4503--1120--5. Google Scholar
Digital Library
Index Terms
Agda-curious?: an exploration of programming with dependent types
Recommendations
Agda-curious?: an exploration of programming with dependent types
ICFP '12: Proceedings of the 17th ACM SIGPLAN international conference on Functional programmingI 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 ...
Dependently typed programming in Agda
TLDI '09: Proceedings of the 4th international workshop on Types in language design and implementationDependently typed languages have for a long time been used to describe proofs about programs. Traditionally, dependent types are used mostly for stating and proving the properties of the programs and not in defining the programs themselves. An ...
Programming assurance cases in Agda
ICFP '11Agda is a modern functional programming language equipped with an interactive proof assistant as its developing environment. Its features include dependent types, type universe, inductive and coinductive families of types, pattern matching, records, and ...







Comments