Detalhes bibliográficos
Ano de defesa: |
2018 |
Autor(a) principal: |
Paula, Hugo Carvalho de |
Orientador(a): |
Não Informado pela instituição |
Banca de defesa: |
Não Informado pela instituição |
Tipo de documento: |
Dissertação
|
Tipo de acesso: |
Acesso aberto |
Idioma: |
por |
Instituição de defesa: |
Não Informado pela instituição
|
Programa de Pós-Graduação: |
Não Informado pela instituição
|
Departamento: |
Não Informado pela instituição
|
País: |
Não Informado pela instituição
|
Palavras-chave em Português: |
|
Link de acesso: |
http://www.repositorio.ufc.br/handle/riufc/36069
|
Resumo: |
This work develops a study of a sequence of formal systems, with the objective of investigating the relationship between computation and mathematics, and presents a possible new direction for the development of new proof assistants. The starting point is the Simply Typed Lambda Calculus, and successive extensions are presented, culminating with CoqMT. This work deals only with some aspects of each system, such as the mathematics they capture, and how computation manifests in those systems. Although there are independent discussions of each of those systems elsewhere, here there is an emphasis in the view of the systems as a proper sequence, which enables a clear discussion of recurring ideas. Based on those ideas, this dissertation presents what we called "inductive structures", a generalization of concepts found in the Calculus of Inductive Constructions. This dissertation concludes with examples that illustrate the usage of computation in the presence of such structures, and outlines an implementation based on pre-existing works in the literature. |