General Terms

General Terms

Cached

Download Links

[www.md.chalmers.se]

by Ana Bove , Peter Dybjer , Andrés Sicard-ramírez

Versions

Version 0

Version History

Metadata Version 0

Datum	Value	Source
TITLE	General Terms	SVM HeaderParse 0.2
AUTHOR NAME	Ana Bove	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science and Engineering; Chalmers University of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Gothenburg, Sweden	SVM HeaderParse 0.2
AUTHOR NAME	Peter Dybjer	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science and Engineering; Chalmers University of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Gothenburg, Sweden	SVM HeaderParse 0.2
AUTHOR NAME	Andrés Sicard-ramírez	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Fundamental Sciences; EAFIT University	SVM HeaderParse 0.2
AUTHOR ADDR	Medellín, Colombia	SVM HeaderParse 0.2
ABSTRACT	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 intuitionistic type theory. We show how to embed an external programming logic, Aczel’s Logical Theory of Constructions (LTC) inside Agda. To this end we postulate the existence of a domain of untyped functional programs and the conversion rules for these programs. Furthermore, we represent the inductive notions in LTC (intuitionistic predicate logic and totality predicates) as inductive notions in Agda. To illustrate our approach we specify an LTC-style logic for PCF, and show how to prove the termination and correctness of a general recursive algorithm for computing the greatest common divisor of two numbers. Categories and Subject Descriptors F.3.1 [Logics and meanings of programs]: Specifying and Verifying and Reasoning about Programs–Logics of programs; D.2.4 [Software Engineering]:	SVM HeaderParse 0.2
CITATIONS	26 found	ParsCit 1.0