Sobre la automatización de la extracción de programas de pruebas de terminación
We investigate an automated program synthesis system that is based on the paradigm of programming by proofs. To automatically extract a term that computes a recursive function given by a set of equations the system must nd a formal proof of the totality of the given function. Because of the particul...
| Autores Principales: | , , |
|---|---|
| Formato: | Artículo (Article) |
| Lenguaje: | Español (Spanish) |
| Publicado: |
Universidad Autónoma de Bucaramanga UNAB
2020
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12749/9046 |