BACK TO INDEX

Publications of year 1995
Books and proceedings
  1. M. Ducassé, editor. Proceedings of the 2nd International Workshop on Automated and Algorithmic Debugging, Saint Malo, France, May 1995. IRISA, Campus de Beaulieu, F-35042 Rennes cedex. Note: See http://www.irisa.fr/EXTERNE/manifestations/AADEBUG95/.
    @Proceedings{duc95b,
    title = {Proceedings of the 2nd International Workshop on Automated and Algorithmic Debugging},
    note = {see http://www.irisa.fr/EXTERNE/manifestations/AADEBUG95/},
    address = {Saint Malo, France},
    year = {1995},
    editor = {M. Ducassé},
    publisher = {IRISA, Campus de Beaulieu, F-35042 Rennes cedex},
    month = {May} 
    }
    


Articles in journal or book chapters
  1. C. Belleannée, P. Brisset, and O. Ridoux. Une reconstruction pragmatique de $\lambda$Prolog. Technique et science informatiques, 14:1131-1164, 1995. [WWW] Keyword(s): Programmation logique, LambdaProlog, lambda-calcul, quantifications, types. logic programming, LambdaProlog, lambda-calculus, quantifications, types..
    Abstract:
    LambdaProlog est un langage de programmation logique dont les clauses et les termes généralisent ceux de Prolog. On peut se demander si toutes ces extensions sont nécessaires simultanément et si des langages intermédiaires intéressants ne pourraient pas être définis, au moins dans un but pédagogique. Nous répondons à cette question en montrant que des liens de nécessité conduisent à adopter toutes les extensions à partir de l'introduction du nouveau domaine de termes. De cette reconstruction découle une heuristique de programmation par induction sur les types qui est un guide commode pour utiliser LambdaProlog. LambdaProlog is a logic programming language in which clauses and terms are more general than in Prolog. One may wonder whether these extensions are simultaneously needed, and what are the useful subsets of LambdaProlog, at least for pedagogical purposes. We answer this question by exhibiting necessity links from the addition of the new term domain to the extension of the formula language. A handy heuristic for programming by induction on types can be derived from these links.

    @Article{belleannee:reconstruction:tsi:95,
    author = {C. Belleannée and P. Brisset and O. Ridoux},
    title = {Une reconstruction pragmatique de $\lambda${Prolog}},
    journal = {Technique et science informatiques},
    year = 1995,
    volume = 14,
    numero = 9,
    pages = {1131--1164},
    abstract = {LambdaProlog est un langage de programmation logique dont les clauses et les termes généralisent ceux de Prolog. On peut se demander si toutes ces extensions sont nécessaires simultanément et si des langages intermédiaires intéressants ne pourraient pas être définis, au moins dans un but pédagogique. Nous répondons à cette question en montrant que des liens de nécessité conduisent à adopter toutes les extensions à partir de l'introduction du nouveau domaine de termes. De cette reconstruction découle une heuristique de programmation par induction sur les types qui est un guide commode pour utiliser LambdaProlog. LambdaProlog is a logic programming language in which clauses and terms are more general than in Prolog. One may wonder whether these extensions are simultaneously needed, and what are the useful subsets of LambdaProlog, at least for pedagogical purposes. We answer this question by exhibiting necessity links from the addition of the new term domain to the extension of the formula language. A handy heuristic for programming by induction on types can be derived from these links.},
    keywords = {Programmation logique, LambdaProlog, lambda-calcul, quantifications, types. logic programming, LambdaProlog, lambda-calculus, quantifications, types.},
    url = {ftp://ftp.irisa.fr/local/lande/cbpbor-tsi95.ps.Z} 
    }
    


  2. S. Coupet-Grimal and O. Ridoux. On the use of Advanced Logic Programming Languages in Computational Linguistics. J. Logic Programming, 24(1&2):121-159, 1995. [WWW] Keyword(s): Logic programming, computational linguistics, LambdaProlog, Prolog II, lambda-terms, rational terms..
    Abstract:
    Computational Linguistics and Logic Programming have strong connections, but the former uses concepts that are absent from the most familiar implementations of the latter. We advocate that a Logic Programming language need not feature the Computational Linguistics concepts exactly, it must only provide a logical way of dealing with them. We focus on the manipulation of higher-order terms and the logical handling of context, and we show that the advanced features of Prolog~II and LambdaProlog are useful for dealing with these concepts. Higher-order terms are native in LambdaProlog, and Prolog~II's infinite trees provide a handy data-structure for manipulating them. The formula language of LambdaProlog can be transposed in the Logic Grammar realm to allow for a logical handling of context.

    @Article{coupet:use:jlp:95,
    author = {S. Coupet-Grimal and O. Ridoux},
    title = {On the use of Advanced Logic Programming Languages in Computational Linguistics},
    journal = {J.~Logic Programming},
    volume = 24,
    number = {1\&2},
    pages = {121--159},
    year = 1995,
    abstract = {Computational Linguistics and Logic Programming have strong connections, but the former uses concepts that are absent from the most familiar implementations of the latter. We advocate that a Logic Programming language need not feature the Computational Linguistics concepts exactly, it must only provide a logical way of dealing with them. We focus on the manipulation of higher-order terms and the logical handling of context, and we show that the advanced features of Prolog~II and LambdaProlog are useful for dealing with these concepts. Higher-order terms are native in LambdaProlog, and Prolog~II's infinite trees provide a handy data-structure for manipulating them. The formula language of LambdaProlog can be transposed in the Logic Grammar realm to allow for a logical handling of context.},
    keywords = {Logic programming, computational linguistics, LambdaProlog, Prolog~II, lambda-terms, rational terms.},
    url = {ftp://ftp.irisa.fr/local/lande/scor-jlp95.ps.Z} 
    }
    


Conference articles
  1. M. Ducassé. Automated Debugging Extensions of the Opium Trace Analyser. In Proceedings of the 2nd International Workshop on Automated and Algorithmic Debugging, Saint Malo, France, May 1995. IRISA, Campus de Beaulieu, F-35042 Rennes cedex. [WWW]
    Abstract:
    Traces of program executions tell how programs behave in given cases. They are a helpful source of information for automated debugging. Opium is an automated trace analyser for Prolog programs. It is programmable and extendable. It provides a trace query language and abstract views of executions as a basis for automated debugging. Opium has shown its capabilities to build abstract tracers and automated debugging facilities. This paper lists the extensions written so far, and describes two recent extensions: the abstract tracers for the LO (Linear Objects) language and for the CHR (Constraint Handling Rules) language.

    @InProceedings{duc95,
    author = {M. Ducassé},
    url = {ftp://ftp.irisa.fr/local/lande/md-aadebug95.ps.gz},
    title = {Automated Debugging Extensions of the {Opium} Trace Analyser},
    booktitle = {Proceedings of the 2nd International Workshop on Automated and Algorithmic Debugging},
    year = {1995},
    publisher = {IRISA, Campus de Beaulieu, F-35042 Rennes cedex},
    address = {Saint Malo, France},
    month = {May},
    abstract = {Traces of program executions tell how programs behave in given cases. They are a helpful source of information for automated debugging. Opium is an automated trace analyser for Prolog programs. It is programmable and extendable. It provides a trace query language and abstract views of executions as a basis for automated debugging. Opium has shown its capabilities to build abstract tracers and automated debugging facilities. This paper lists the extensions written so far, and describes two recent extensions: the abstract tracers for the LO (Linear Objects) language and for the CHR (Constraint Handling Rules) language. } 
    }
    


  2. O. Ridoux. Imagining CLP$(\Lambda,\equiv_{\alpha\beta})$. In A. Podelski, editor, Constraint Programming: Basics and Trends. Selected papers of the 22nd Spring School in Theoretical Computer Science. LNCS 910, Châtillon/Seine, France, pages 209-230, 1995. [WWW] Keyword(s): CLP, LambdaProlog, lambda-calculus..
    Abstract:
    We study under which conditions the domain of lambda-terms and the equality theory of the lambda-calculus form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom {$\eta$}, and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, CLP-lambda must be close to LambdaProlog.

    @InProceedings{ridoux:imagining:sctcs:95,
    author = {O. Ridoux},
    title = {Imagining {CLP}$(\Lambda,\equiv_{\alpha\beta})$},
    editor = {A. Podelski},
    year = 1995,
    pages = {209--230},
    booktitle = {Constraint Programming: Basics and Trends. Selected papers of the 22nd Spring School in Theoretical Computer Science. LNCS 910},
    address = {Ch\^{a}tillon/Seine, France},
    abstract = {We study under which conditions the domain of lambda-terms and the equality theory of the lambda-calculus form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom {$\eta$}, and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, CLP-lambda must be close to LambdaProlog.},
    keywords = {CLP, LambdaProlog, lambda-calculus.},
    url = {ftp://ftp.irisa.fr/local/lande/or-spring95.ps.Z} 
    }
    



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Thu Apr 8 17:20:28 2021
Author: ferre.


This document was translated from BibTEX by bibtex2html