2021-03-262009-01-019781605583303SCOPUS;2-s2.0-70149123071http://hdl.handle.net/10784/27420We 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.enginfo:eu-repo/semantics/conferencePaperFunctional programsGeneralGreatest common divisorsIntuitionistic predicate logicLogical theoriesLogical theory of constructionsProgramming languageProgramming logicType TheoryFunctional programmingLinguisticsQuery languagesRecursive functionsComputer software selection and evaluation2021-03-26Bove, A.Dybjer, P.Sicard-Ra?irez, A.