Agda is a dependently typed functional programming language and proof assistant originally developed at Chalmers University of Technology, with its current version, Agda 2, a full rewrite considered a programming language in its own right. It is based on intuitionistic type theory, and its type system is expressive enough to support full functional programs as well as their formal correctness proofs, in the tradition of the Curry-Howard correspondence.
Facts
First Released First Released SignificanceDependently typed functional language and proof assistant 2 Classification
Typing Discipline Typing Discipline Connections
Follows Typing Discipline
In Field
Influenced By
Agda infobox lists Haskell under "Influenced by"; "a Haskell-like syntax." en.wikipedia.org/wiki/Agda_(programming_language)
Licensed Under
Source Agda developers (agda/agda repository): Agda license
Sources
1. Wikidata: Agda
- Wikidata Q20479, class allow-list match (w-wdresolver-0926)
- Wikidata Q20479 P571 (inception)
- Wikidata Q20479 P7078 (typing discipline)
View the Source2. Agda (Wikipedia)
Lead paragraph, history
The original Agda system was developed at Chalmers by Catarina Coquand in 1999
Lead paragraph, description
Agda is a dependently typed functional programming language
In Field: Programming Language Theory, Lead sentence
Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with implementation described in his PhD thesis.
View the SourceDependent type (Wikipedia)
In Group: Dependently Typed Proof Assistant Languages, article names Agda among functional languages using dependent types to help reduce bugsView the Source Agda developers (agda/agda repository): Agda license
Agda developers (agda/agda repository)Licensed Under: MIT License, License file, grant paragraphQuote, Licensed Under: MIT License, License file, grant paragraph
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.