Emploi de méthodes constructives en programmation. Un dossier : la fonction d'Ackermann
Ensembles infinis en programmation
Exaktní matematické metody v programovací technice
Final dialgebras : from categories to allegories
Final Dialgebras: From Categories to Allegories
The study of inductive and coinductive types (like finite lists and streams, respectively) is usually conducted within the framework of category theory, which to all intents and purposes is a theory of sets and functions between sets. Allegory theory, an extension of category theory due to Freyd, is better suited to modelling relations between sets as opposed to functions between sets. The question thus arises of how to extend the standard categorical results on the existence of final objects...
Foundations for stepwise refinement of program specifications via cylindric algebra theory
Free, iteratively closed categories of complete lattices
Génération automatique de mots circulaires et équilibres
Generativne gramatike metaprogramskih jezika
How to treat decision problems by different programming methodologies
Implementing term rewriting by jungle evaluation
Iterative and metric algebraic theories
Langages d'interprétation des schémas récursifs
Les tests et leur caractérisation syntaxique
Logic and functional programming by retractions
Logic and functional programming by retractions : operational semantics
Mathematical description of program diagram
Mathematical theory of static systems
Nondeterminism and fully abstract models
Note sur la sémantique des structures de contrôle