Embedding a logical Theory of Constructions in agda
MetadataShow full item record
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 type theory. We show to embed an external programming logic, Aczel's Logical Theory Constructions (LTC) inside Agda. To this end we postulate existence of a domain of untyped functional programs and the rules for these programs. Furthermore, we represent the notions in LTC (intuitionistic predicate logic with equality,totality predicates) as inductive notions in Agda. To illustrate approach we specify an LTC-style logic for PCF, and show to prove the termination and correctness of a general recursive for computing the greatest common divisor of two numbers. © 2009.
Showing items related by title, author, creator and subject.
Agudelo-Agudelo, Juan C.; Sierra-Aristizabal, Manuel H. (OXFORD UNIV PRESS, 2014-08-01)Restricted normal modal logics are here defined by imposing conditions on the modal axioms and rules of normal modal systems. The conditions are defined in terms of a depth (associated with the modal connective) and a ...
Alpuente, M.; Correa, F.; Falaschi, M. (Elsevier BV, 2002-01-01)We present a generic scheme for the declarative debugging of functional logic programs which is valid for eager as well as lazy programs. In particular we show that the framework extends naturally some previous work and ...
I. BUILES ROLDAN; H. MANRIQUE TISNES (CONSEJO SUPERIOR INVESTIGACIONES CIENTIFICAS-CSIC, INST GRASA, 2018-01-01)In this article we defend the possibility of finding in intuitive thinking a set of characteristics or laws which refer to logical aspects, which are different from classic symbolic logic, involving both the rational ...