Titre :

Formal Definitions and Proofs for Partial (Co)Recursive Functions

Auteur(s) :

Cheval, Horatiu [Auteur]
University of Bucharest [UniBuc]
Nowak, David [Auteur]
Centre National de la Recherche Scientifique [CNRS]
Extra Small Extra Safe [2XS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Rusu, Vlad [Auteur]
Analyse symbolique et conception orientée composants pour des systèmes embarqués temps-réel modulaires [SYCOMORES]

Titre de la revue :

Journal of Logic and Algebraic Methods in Programming

Pagination :

27

Éditeur :

Elsevier

Date de publication :

2024-10

ISSN :

2352-2208

Mot(s)-clé(s) en anglais :

partial (co)recursive functions
Coq proof assistant

Discipline(s) HAL :

Informatique [cs]/Logique en informatique [cs.LO]

Résumé en anglais : [en]

Partial functions are a key concept in programming. Without partiality a programming language has limited expressiveness -- it is not Turing-complete, hence, it excludes some constructs such as {while}-loops. In functional ...
Lire la suite >Partial functions are a key concept in programming. Without partiality a programming language has limited expressiveness -- it is not Turing-complete, hence, it excludes some constructs such as {while}-loops. In functional programming languages, partiality mostly originates from the non-termination of recursive functions. Corecursive functions are another source of partiality: here, the issue is not termination, but the inability to produce arbitrary large, finite approximations of a theoretically infinite output. Partial functions have been formally studied in the branch of theoretical computer science called domain theory. In this paper we propose to step up the level of formality by using the Coq proof assistant. The main difficulty is that Coq requires all functions to be total, since partiality would break the soundness of its underlying logic. We propose practical solutions for this issue, and others, which appear when one attempts to define and reason about partial (co)recursive functions in a total functional language.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Projet Européen :

COST Action EuroProofNet CA20111, funded by COST (European Cooperation in Science and Technology).

Commentaire :

On line version at https://www.sciencedirect.com/science/article/abs/pii/S2352220824000531?via%3Dihub

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Date de dépôt :

2024-10-02T02:06:22Z