Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,335,413 papers from all fields of science
Search
Sign In
Create Free Account
Agda
Known as:
Agda theorem prover
, Agda (theorem prover)
, Agda2
Expand
Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
ALF (proof assistant)
Cayenne (programming language)
Coq (software)
Dependent type
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Generic Foundation for Program Improvement
G. Hutton
2018
Corpus ID: 43990853
Improvement theory is an approach to reasoning about program efficiency that allows inequational proofs of improvement to be…
Expand
2018
2018
Improving Haskell
Martin A. T. Handley
,
G. Hutton
Symposium on Trends in Functional Programming
2018
Corpus ID: 46903861
Lazy evaluation is a key feature of Haskell, but can make it difficult to reason about the efficiency of programs. Improvement…
Expand
2017
2017
Methods for using Agda to prove Safety and Liveness for Concurrent Programs
Erik Bergsten
,
O. Larsson
,
T. Rastemo
,
Oskar Rutqvist
,
Anderas Standar
2017
Corpus ID: 125128371
It is hard and error-prone to prove that a given concurrent program has a given property. To help develop such proofs, a modern…
Expand
2016
2016
Towards Visual Type Theory as a Mathematical Tool and Mathematical User Interface
Lucius T. Schoenbaum
FM4M/MathUI/ThEdu/DP/WIP@CIKM
2016
Corpus ID: 5868046
A visual type theory is a cognitive tool that has much in common with language, and may be regarded as an exceptional form of…
Expand
2016
2016
Π-Ware : Hardware Description and Verification in Agda
J. P. P. Flor
,
Wouter Swierstra
,
Y. Sijsling
2016
Corpus ID: 4191526
There is a long tradition of modelling digital circuits using functional programming languages. This paper demonstrates that by…
Expand
2015
2015
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
Ekaterina Komendantskaya
,
Patricia Johann
,
Martin Schmidt
arXiv.org
2015
Corpus ID: 18108315
Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi…
Expand
Review
2014
Review
2014
An Overview of Type Theories
Nino Guallart
Axiomathes
2014
Corpus ID: 119733111
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has…
Expand
2006
2006
Procedurrättvisa och praktisk prioritering - tre fall från svensk hälso- och sjukvård
Peter Garpenby
2006
Corpus ID: 129936459
Prioritering av vard vacker starka kanslor bland manga manniskor. Prioritering likstalls ofta med nedskarningar av offentlig…
Expand
1999
1999
Computer-Assisted Mathematics at Work (The Hahn-Banach Theorem in Isabelle/Isar)
G. Bauer
,
M. Wenzel
Types for Proofs and Programs
1999
Corpus ID: 7806762
We present a complete formalization of the Hahn-Banach theorem in the simply-typed set-theory of Isabelle/HOL, such that both the…
Expand
1999
1999
A Distributed Algorithm in Agda: the Dining Philosophers Problem
Hai-Yan Qiao
1999
Corpus ID: 14029543
One distributed algorithm for the dining philosophers problem 1] is implemented in Agda, a proof checker based on Martin-LL of's…
Expand