Add to ORKGWe give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-L\uf6f\u27s intuitionistic type theory but extends it with numerous programming language features. It supports a wide range of inductive data types, including inductive families and inductive-recursive types, with associated flexible pattern-matching. Unlike other proof assistants, Agda is not tactic-based. Instead it has an Emacs-based interface which allows programming by gradual refinement of incomplete type-correct terms
We present instance arguments: an alternative to type classes and related features in the dependentl...
Types express a program's meaning, and checking types ensures that a program has the intended meanin...
We extend the proof assistant Agda/Alfa for dependent type theory with a modified version of Claesse...
We give an overview of Agda, the latest in a series of dependently typed programming languages dev...
In these lecture notes we give an introduction to functional programming with dependent types. We us...
We propose a new way to reason about general recursive functional programs in the dependently typed...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
Datatype-generic programming makes it possible to define a construction once and apply it to a large...
Agda is a programming language that utilises dependent types which add the power to express properti...
Most existing programming languages provide little support to formally state and prove properties ab...
This paper presents a library for programming with polymorphic dynamic types in the dependently type...
There has been sustained interest in functional programming languages with dependent types in recent...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
Abstract. Dependently typed programming languages allow sophisticated properties of data to be expre...
We present instance arguments: an alternative to type classes and related features in the dependentl...
Types express a program's meaning, and checking types ensures that a program has the intended meanin...
We extend the proof assistant Agda/Alfa for dependent type theory with a modified version of Claesse...
We give an overview of Agda, the latest in a series of dependently typed programming languages dev...
In these lecture notes we give an introduction to functional programming with dependent types. We us...
We propose a new way to reason about general recursive functional programs in the dependently typed...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
Datatype-generic programming makes it possible to define a construction once and apply it to a large...
Agda is a programming language that utilises dependent types which add the power to express properti...
Most existing programming languages provide little support to formally state and prove properties ab...
This paper presents a library for programming with polymorphic dynamic types in the dependently type...
There has been sustained interest in functional programming languages with dependent types in recent...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
Abstract. Dependently typed programming languages allow sophisticated properties of data to be expre...
We present instance arguments: an alternative to type classes and related features in the dependentl...
Types express a program's meaning, and checking types ensures that a program has the intended meanin...
We extend the proof assistant Agda/Alfa for dependent type theory with a modified version of Claesse...