Skip to search formSkip to main contentSkip to account menu

Agda

Known as: Agda theorem prover, Agda (theorem prover), Agda2 
Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
ALF (proof assistant)Cayenne (programming language)Coq (software)Dependent type

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Generic Foundation for Program Improvement
Improvement theory is an approach to reasoning about program efficiency that allows inequational proofs of improvement to be… 
2018
2018
Improving Haskell
Lazy evaluation is a key feature of Haskell, but can make it difficult to reason about the efficiency of programs. Improvement… 
2017
2017
A Logical Relation for Dependent Type Theory Formalized in Agda
When writing proofs, it is desirable to show that one’s proof is correct. With formalising a proof in dependent type theory, it… 
2016
2016
Towards Visual Type Theory as a Mathematical Tool and Mathematical User Interface
A visual type theory is a cognitive tool that has much in common with language, and may be regarded as an exceptional form of… 
2015
2015
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi… 
Review
2014
Review
2014
An Overview of Type Theories
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has… 
Review
2010
Review
2010
Implementing and Optimizing a Simple, Dependently-Typed Language
This thesis presents a compiler for the simple functional programming language LambdaPi, which includes dependent types. The… 
2006
2006
Procedurrättvisa och praktisk prioritering - tre fall från svensk hälso- och sjukvård
Prioritering av vard vacker starka kanslor bland manga manniskor. Prioritering likstalls ofta med nedskarningar av offentlig… 
1999
1999
Computer-Assisted Mathematics at Work (The Hahn-Banach Theorem in Isabelle/Isar)
We present a complete formalization of the Hahn-Banach theorem in the simply-typed set-theory of Isabelle/HOL, such that both the… 
1999
1999
A Distributed Algorithm in Agda: the Dining Philosophers Problem
One distributed algorithm for the dining philosophers problem 1] is implemented in Agda, a proof checker based on Martin-LL of's… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)