Skip to Main content Skip to Navigation

Sur les types de données dans les langages logico-fonctionnels : Réécriture et surréduction des graphes admissibles

Abstract : Functional logic languages are very high level programming languages which allow to define in a uniform way data types, functions and predicates (relations). Several propositions of functional logic languages have been done but they are based on first-order terms computations. This restriction allows to program with algebraic abstract data types but is not appropriate to manipulate real-world data types, as they are modeled with cyclic graphs. The aim of this thesis is thus to introduce cyclic graphs as basic data structure in functional logic languages: we consider the programs as cyclic graph rewriting systems and we study the rewriting and narrowing relations that they induce (operational semantics). An important property of rewriting concerns confluence: it expresses the determinism of the computations. Many results of confluence exist for term rewriting but they do not hold for cyclic graph rewriting in general. We characterize a class of particular cyclic graphs, the admissible graphs, and prove that the admissible graph rewriting relation is confluent. Concerning the narrowing relation, we propose a definition and prove that this calculus is sound and complete wrt the admissible graph rewriting relation. Then we study several admissible graph rewriting and narrowing strategies, ie, algorithms allowing to eliminate useless or redundant calculus. We show that our strategies are optimal wrt many criteria depending on the graph rewriting system which is considered.
Document type :
Complete list of metadatas
Contributor : Thèses Imag <>
Submitted on : Tuesday, August 24, 2004 - 4:54:04 PM
Last modification on : Friday, November 6, 2020 - 4:05:40 AM
Long-term archiving on: : Wednesday, September 12, 2012 - 5:35:28 PM


  • HAL Id : tel-00006746, version 1




Jean-Christophe Janodet. Sur les types de données dans les langages logico-fonctionnels : Réécriture et surréduction des graphes admissibles. Génie logiciel [cs.SE]. Institut National Polytechnique de Grenoble - INPG, 2000. Français. ⟨tel-00006746⟩



Record views


Files downloads