Jan 20, 2009 · Abstract. We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda,.

Abstract. We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on ...

A new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-Löf's ...

We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on ...

We propose a new way to reason about general recursive functional in the dependently typed programming language Agda,is based on Martin-Löf's intuitionistic ...

Resumen: We propose a new way to reason about general recursive functional in the dependently typed programming language Agda,is based on Martin-Löf's ...

Agda formalisation of FOTC (First-Order Theory of Combinators) which is a programming logic for functional programs that can deal with general recursion, ...

Embedding a logical theory of constructions in agda. A Bove, P Dybjer, A Sicard-Ramírez. Proceedings of the 3rd workshop on Programming languages meets ...

We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-Löf's ...

An embedding of ZFC into Agda. I assumed the excluded middle (on Prop ) and function extensionality. The theory of sets is represented as a postulated type ...