Internal Program Extraction in the Calculus of Inductive Constructions

Autores
Severi, Paula; Szasz, Nora
Año de publicación
2002
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Based on the Calculus of Constructions extended with inductive de nitions we present a Theory of Speci fications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types for representing speci fications, whose corresponding notion of implementation is that of a pair formed by a program and a correctness proof. The rules of the theory are such that in implementations the program parts appear mixed together with the proof parts. A reduction relation performs the task of separating programs from proofs. Consequently, every implementation computes to a pair composed of a program and a proof of its correctness, and so the program extraction procedure is immediate.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Cálculo
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/183654

id SEDICI_e92a6bcbabf45a0a928bccfb9e624b20
oai_identifier_str oai:sedici.unlp.edu.ar:10915/183654
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Internal Program Extraction in the Calculus of Inductive ConstructionsSeveri, PaulaSzasz, NoraCiencias InformáticasCálculoBased on the Calculus of Constructions extended with inductive de nitions we present a Theory of Speci fications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types for representing speci fications, whose corresponding notion of implementation is that of a pair formed by a program and a correctness proof. The rules of the theory are such that in implementations the program parts appear mixed together with the proof parts. A reduction relation performs the task of separating programs from proofs. Consequently, every implementation computes to a pair composed of a program and a proof of its correctness, and so the program extraction procedure is immediate.Sociedad Argentina de Informática e Investigación Operativa2002-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf72-85http://sedici.unlp.edu.ar/handle/10915/183654enginfo:eu-repo/semantics/altIdentifier/issn/1666-1133info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:50:07Zoai:sedici.unlp.edu.ar:10915/183654Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:50:07.95SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Internal Program Extraction in the Calculus of Inductive Constructions
title Internal Program Extraction in the Calculus of Inductive Constructions
spellingShingle Internal Program Extraction in the Calculus of Inductive Constructions
Severi, Paula
Ciencias Informáticas
Cálculo
title_short Internal Program Extraction in the Calculus of Inductive Constructions
title_full Internal Program Extraction in the Calculus of Inductive Constructions
title_fullStr Internal Program Extraction in the Calculus of Inductive Constructions
title_full_unstemmed Internal Program Extraction in the Calculus of Inductive Constructions
title_sort Internal Program Extraction in the Calculus of Inductive Constructions
dc.creator.none.fl_str_mv Severi, Paula
Szasz, Nora
author Severi, Paula
author_facet Severi, Paula
Szasz, Nora
author_role author
author2 Szasz, Nora
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Cálculo
topic Ciencias Informáticas
Cálculo
dc.description.none.fl_txt_mv Based on the Calculus of Constructions extended with inductive de nitions we present a Theory of Speci fications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types for representing speci fications, whose corresponding notion of implementation is that of a pair formed by a program and a correctness proof. The rules of the theory are such that in implementations the program parts appear mixed together with the proof parts. A reduction relation performs the task of separating programs from proofs. Consequently, every implementation computes to a pair composed of a program and a proof of its correctness, and so the program extraction procedure is immediate.
Sociedad Argentina de Informática e Investigación Operativa
description Based on the Calculus of Constructions extended with inductive de nitions we present a Theory of Speci fications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types for representing speci fications, whose corresponding notion of implementation is that of a pair formed by a program and a correctness proof. The rules of the theory are such that in implementations the program parts appear mixed together with the proof parts. A reduction relation performs the task of separating programs from proofs. Consequently, every implementation computes to a pair composed of a program and a proof of its correctness, and so the program extraction procedure is immediate.
publishDate 2002
dc.date.none.fl_str_mv 2002-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/183654
url http://sedici.unlp.edu.ar/handle/10915/183654
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1666-1133
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
72-85
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616360735277056
score 13.070432