Combining interactive and automatic reasoning in first order theories of functional programs

Vista sencilla de ítem
dc.contributor.authorBove, A.
dc.contributor.authorDybjer, P.
dc.contributor.authorSicard-Ramírez, A.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupLógica y Computaciónspa
dc.creatorBove, A.
dc.creatorDybjer, P.
dc.creatorSicard-Ramírez, A.
dc.date.accessioned2021-03-26T21:35:20Z
dc.date.available2021-03-26T21:35:20Z
dc.date.issued2012-01-01
dc.description.abstractWe propose a new approach to the computer-assisted verification of functional programs. We work in first order theories of functional programs which are obtained by extending Aczel's first order theory of combinatory formal arithmetic with positive inductive and coinductive predicates. Rather than building a special purpose system we implement our theories in Agda, a proof assistant for dependent type theory which can be used as a generic theorem prover. Agda provides support for interactive reasoning by encoding first order theories using the formulae-as-types principle. Further support is provided by off-the-shelf automatic theorem provers for first order logic which can be called by a program which translates Agda representations of first order formulae into the TPTP language understood by the provers. We show some examples where we combine interactive and automatic reasoning, covering both proof by induction and coinduction. © 2012 Springer-Verlag Berlin Heidelberg.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=2053
dc.identifier.doi10.1007/978-3-642-28729-9_7
dc.identifier.issn03029743
dc.identifier.issn16113349
dc.identifier.otherWOS;000342756900007
dc.identifier.otherSCOPUS;2-s2.0-84859133078
dc.identifier.urihttp://hdl.handle.net/10784/27408
dc.language.isoengeng
dc.publisherSPRINGER
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84859133078&doi=10.1007%2f978-3-642-28729-9_7&partnerID=40&md5=eb2fda1c010878592be78f38d42f3013
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0302-9743
dc.sourceLecture Notes In Computer Science
dc.subject.keywordAutomatic reasoningeng
dc.subject.keywordCoinductioneng
dc.subject.keywordComputer-assisted verificationeng
dc.subject.keywordDependent type theoryeng
dc.subject.keywordFirst ordereng
dc.subject.keywordFirst order logiceng
dc.subject.keywordFirst order theorieseng
dc.subject.keywordFunctional programseng
dc.subject.keywordInteractive reasoningeng
dc.subject.keywordProof assistanteng
dc.subject.keywordTheorem proverseng
dc.subject.keywordAutomatic reasoningeng
dc.subject.keywordComputer-assisted verificationeng
dc.subject.keywordDependent type theoryeng
dc.subject.keywordFirst order logiceng
dc.subject.keywordFirst order theorieseng
dc.subject.keywordFunctional programseng
dc.subject.keywordInteractive reasoningeng
dc.subject.keywordTheorem proverseng
dc.subject.keywordArtificial intelligenceeng
dc.subject.keywordFormal logiceng
dc.subject.keywordOpen systemseng
dc.subject.keywordTheorem provingeng
dc.subject.keywordOpen systemseng
dc.subject.keywordComputation theoryeng
dc.titleCombining interactive and automatic reasoning in first order theories of functional programseng
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos

Colecciones

Documentos de conferencia