Formalization of Programs with Positive Inductive Types

Proof 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. Thi...

Full description

Autores:
Lobo Vesga, Elisabet
Tipo de recurso:
Fecha de publicación:
2014
Institución:
Universidad EAFIT
Repositorio:
Repositorio EAFIT
Idioma:
eng
OAI Identifier:
oai:repository.eafit.edu.co:10784/4552
Acceso en línea:
http://hdl.handle.net/10784/4552
Palabra clave:
Inductive Types
Positive Types
Programming Logic
Continuations
Rights
License
Acceso abierto