Formalization of Programs with Positive Inductive Types

dc.contributor.authorLobo Vesga, Elisabet
dc.contributor.eafitauthorElizabet Lobo-Vesga (elobove@eafit.edu.co)spa
dc.date.accessioned2014-12-10T21:09:38Z
dc.date.available2014-12-10T21:09:38Z
dc.date.issued2014-11
dc.descriptionProof assistants are computer systems that allows a user to do mathematics on a computer helping with the development of formal proof by human-machine collaboration, however most of them only work with strictly positive types, this restriction limits the number of problem that can be formalized. This is perhaps the reason why verification of programs that use positive (and negative) types is uncommon. Hence, we use the programming logic created by Bove, Dybjer and Sicard- Ram´ırez that accept positive types to formalize the termination of a breadth-first search in a binary tree using continuations data type which is positive.spa
dc.identifier.urihttp://hdl.handle.net/10784/4552
dc.language.isoengeng
dc.publisherUniversidad EAFIT, Medellín, Colombiaspa
dc.publisher.departmentUniversidad EAFIT. Escuela de Ciencias y Humanidades. Grupo de Investigación Lógica y Computaciónspa
dc.publisher.programGrupo de Investigación Lógica y Computaciónspa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.rights.localAcceso abiertospa
dc.subject.keywordInductive Typesspa
dc.subject.keywordPositive Typesspa
dc.subject.keywordProgramming Logicspa
dc.subject.keywordContinuationsspa
dc.titleFormalization of Programs with Positive Inductive Typesspa
dc.typeworkingPapereng
dc.type.hasVersiondraftspa
dc.type.localDocumento de trabajo de investigaciónspa

Archivos

Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
LoboVesga-2014_Practica-investigativa-III_Formalization-of-programs-with-positive-inductive-types.pdf
Tamaño:
169.08 KB
Formato:
Adobe Portable Document Format
Descripción:
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
2.5 KB
Formato:
Item-specific license agreed upon to submission
Descripción: