Howdy Logo
Glossary Hero image

The Howdy Glossary

Search terms in Glossary


Agda is a dependently typed programming language used for formal verification. The language is based on intuitionistic type theory, in particular Martin-Löf's constructive type theory. Agda provides practical tools to solve problems using specifications and proofs through its type system, which allows for the expression of properties of programs as types. This feature facilitates formal reasoning about code correctness by providing a way to encode logical relations and functional behavior directly into the program structure, thereby allowing many kinds of bugs to be caught at compile time. Additionally, Agda supports interactive theorem proving through a built-in interactive theorem prover with an Emacs interface that can construct proofs step-by-step while showing detailed feedback about their validity or any inconsistencies encountered along the way.

Hire Agda Experts

Enter your email to get started.