Show simple item record

dc.creatorBove, A.
dc.creatorDybjer, P.
dc.creatorSicard-Ra?irez, A.
dc.date.available2021-03-26T21:35:21Z
dc.date.issued2009-01-01
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=2441
dc.identifierhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-70149123071&partnerID=40&md5=f822f18df86fe3b58e641a5de5348f39
dc.identifier.urihttp://hdl.handle.net/10784/27420
dc.description.abstractWe 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.
dc.languageeng
dc.relationSCOPUS;2-s2.0-70149123071
dc.sourceEmbedding A Logical Theory Of Constructions In Agda
dc.sourceISBN: 9781605583303
dc.subjectFunctional programs; General; Greatest common divisors; Intuitionistic predicate logic; Logical theories; Logical theory of constructions; Programming language; Programming logic; Type Theory; Functional programming; Linguistics; Query languages; Recursive functions; Computer software selection and evaluation
dc.titleEmbedding a logical Theory of Constructions in agda
dc.typeConference Paper
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.date.accessioned2021-03-26T21:35:21Z


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record