Conferences in DBLP
Christian Queinnec , Julian A. Padget A Proposal for a Modular Lisp with Macros and Dynamic Evaluation. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:1-8 [Conf ] Vincent Dornic , Pierre Jouvelot , David K. Gifford Polymorphic Time Systems for Estimating Program Complexity. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:9-17 [Conf ] Bruno Monsuez An Attempt to Find Polymorphic Types by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:18-25 [Conf ] Jean-Pierre Talpin , Pierre Jouvelot Polymorphic Type, Region and Effect Inference. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:26-32 [Conf ] Patrick Cousot , Radhia Cousot Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract). [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:33-36 [Conf ] Pierre Crégut Interprétation abstraite pour améliorer la représentation des environnements dans les langages fonctionnels. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:37-43 [Conf ] Yong Sun Equational Logics. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:44-52 [Conf ] Rachid Echahed , Paul Jacquet , Marie-Laure Potet , Sadik Sebbar Equational Reasonning and the Completion Procedure. A Comparative Study in Program Transformation. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:53-61 [Conf ] Christophe Lecoutre , Philippe Devienne , Patrick Lebègue Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:62-69 [Conf ] Philippe Codognet , Gilberto Filé Computations, Abstractions and Constraints (abstract). [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:70-71 [Conf ] Charles Consel , Siau-Cheng Khoo Evaluation partielle paramétrable. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:72-81 [Conf ] Christopher Colby , Peter Lee An Implementation of Parametrized Partial Evaluation. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:82-89 [Conf ] Anne De Niel , Eddi Bevers , Karel De Vlaminck Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:90-97 [Conf ] Irène Durand , David Sherman , Robert Strandh Partial Evaluation of an Intermediate Language for Equational Programs. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:98-106 [Conf ] Patrick Cousot , Radhia Cousot Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:107-110 [Conf ] Michel Billaud Axiomatizations of Backtracking. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:111-116 [Conf ] Roberto Barbuti , Michael Codish , Roberto Giacobazzi , Giorgio Levi Modelling Prolog Control. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:117-124 [Conf ] Frédéric Mesnard , Jean-Gabriel Ganascia A propos du contrôle de la résolution. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:125-131 [Conf ] Anne Parrain , Philippe Devienne , Patrick Lebègue Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:132-138 [Conf ] François Barthélemy Prédire à bon escient. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:139-143 [Conf ] Kaninda Musumbu Interprétation abstraite au moyen de grammaires attribuées. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:144-150 [Conf ] Eric Villemonte de la Clergerie A Tool for Abstract Interpretation: Dynamic Programming. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:151-156 [Conf ] François Denis , Jean-Paul Delahaye Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:157-164 [Conf ] Pierre De Boeck , Baudouin Le Charlier Automatic Construction of Prolog Primitives for Type Checking Analysis. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:165-172 [Conf ] W.-N. Chin Generalising Deforestation for All First-Order Functional Programs. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:173-181 [Conf ] Geoff W. Hamilton , S. B. Jones Transforming Programs to Eliminate Intermediate Structures. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:182-188 [Conf ] Yamine Aït Ameur Non Functional Properties Can Guide Program Developments. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:189-196 [Conf ] Olin Shivers Useless-Variable Elimination. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:197-201 [Conf ] Peter T. Breuer An Analysis/Synthesis Language with Learning Strategies. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:202-209 [Conf ] Jean-Louis Imbert , Pascal Van Hentenryck A propos des redondances dans les systèmes d'inéquations linéaires. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:210-216 [Conf ] M. Griffiths , Pierre Massotte , C. Paul Analyse et transformation de programmes Prolog en vue de leur parallélisation avec les prédicats parand et paror . [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:217-224 [Conf ] F. Goudal Une représentation abstraite des expressions et continuations en Scheme. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:225-233 [Conf ] Karoline Malmkjær On Static Properties of Specialized Programs. [Citation Graph (0, 0)][DBLP ] JTASPEFT/WSA, 1991, pp:234-241 [Conf ]