default search action
1. JTASPEFL/WSA 1991: Bordeaux, France
- Michel Billaud, Pierre Castéran, Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy:
Actes JTASPEFL'91 (Bordeaux, France), October 1991, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Proceedings. Series Bigre 74, Atelier Irisa, IRISA, Campus de Beaulieu 1991 - Christian Queinnec, Julian A. Padget:
A Proposal for a Modular Lisp with Macros and Dynamic Evaluation. JTASPEFT/WSA 1991: 1-8 - Vincent Dornic, Pierre Jouvelot, David K. Gifford:
Polymorphic Time Systems for Estimating Program Complexity. JTASPEFT/WSA 1991: 9-17 - Bruno Monsuez:
An Attempt to Find Polymorphic Types by Abstract Interpretation. JTASPEFT/WSA 1991: 18-25 - Jean-Pierre Talpin, Pierre Jouvelot:
Polymorphic Type, Region and Effect Inference. JTASPEFT/WSA 1991: 26-32 - Patrick Cousot, Radhia Cousot:
Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract). JTASPEFT/WSA 1991: 33-36 - Pierre Crégut:
Interprétation abstraite pour améliorer la représentation des environnements dans les langages fonctionnels. JTASPEFT/WSA 1991: 37-43 - Yong Sun:
Equational Logics. JTASPEFT/WSA 1991: 44-52 - Rachid Echahed, Paul Jacquet, Marie-Laure Potet, Sadik Sebbar:
Equational Reasonning and the Completion Procedure. A Comparative Study in Program Transformation. JTASPEFT/WSA 1991: 53-61 - Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite. JTASPEFT/WSA 1991: 62-69 - Philippe Codognet, Gilberto Filé:
Computations, Abstractions and Constraints (abstract). JTASPEFT/WSA 1991: 70-71 - Charles Consel, Siau-Cheng Khoo:
Evaluation partielle paramétrable. JTASPEFT/WSA 1991: 72-81 - Christopher Colby, Peter Lee:
An Implementation of Parametrized Partial Evaluation. JTASPEFT/WSA 1991: 82-89 - Anne De Niel, Eddi Bevers, Karel De Vlaminck:
Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem. JTASPEFT/WSA 1991: 90-97 - Irène Durand, David J. Sherman, Robert Strandh:
Partial Evaluation of an Intermediate Language for Equational Programs. JTASPEFT/WSA 1991: 98-106 - Patrick Cousot, Radhia Cousot:
Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. JTASPEFT/WSA 1991: 107-110 - Michel Billaud:
Axiomatizations of Backtracking. JTASPEFT/WSA 1991: 111-116 - Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi:
Modelling Prolog Control. JTASPEFT/WSA 1991: 117-124 - Frédéric Mesnard, Jean-Gabriel Ganascia:
A propos du contrôle de la résolution. JTASPEFT/WSA 1991: 125-131 - Anne Parrain, Philippe Devienne, Patrick Lebègue:
Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs. JTASPEFT/WSA 1991: 132-138 - François Barthélemy:
Prédire à bon escient. JTASPEFT/WSA 1991: 139-143 - Kaninda Musumbu:
Interprétation abstraite au moyen de grammaires attribuées. JTASPEFT/WSA 1991: 144-150 - Éric Villemonte de la Clergerie:
A Tool for Abstract Interpretation: Dynamic Programming. JTASPEFT/WSA 1991: 151-156 - François Denis, Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. JTASPEFT/WSA 1991: 157-164 - Pierre De Boeck, Baudouin Le Charlier:
Automatic Construction of Prolog Primitives for Type Checking Analysis. JTASPEFT/WSA 1991: 165-172 - W.-N. Chin:
Generalising Deforestation for All First-Order Functional Programs. JTASPEFT/WSA 1991: 173-181 - Geoff W. Hamilton, Simon B. Jones:
Transforming Programs to Eliminate Intermediate Structures. JTASPEFT/WSA 1991: 182-188 - Yamine Aït Ameur:
Non Functional Properties Can Guide Program Developments. JTASPEFT/WSA 1991: 189-196 - Olin Shivers:
Useless-Variable Elimination. JTASPEFT/WSA 1991: 197-201 - Peter T. Breuer:
An Analysis/Synthesis Language with Learning Strategies. JTASPEFT/WSA 1991: 202-209 - Jean-Louis Imbert, Pascal Van Hentenryck:
A propos des redondances dans les systèmes d'inéquations linéaires. JTASPEFT/WSA 1991: 210-216 - 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. JTASPEFT/WSA 1991: 217-224 - F. Goudal:
Une représentation abstraite des expressions et continuations en Scheme. JTASPEFT/WSA 1991: 225-233 - Karoline Malmkjær:
On Static Properties of Specialized Programs. JTASPEFT/WSA 1991: 234-241
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.