1. M. Ducassé and J. Noyé. Logic Programming Environments: Dynamic program analysis and debugging. The Journal of Logic Programming, 19/20:351-384, May/July 1994. Note: Anniversary issue: Ten years of Logic Programming. [WWW ] [Abstract] [bibtex-entry]

1. J.-P. Banâtre, C. Bryce, and D. Le Métayer. Compile-time detection of information flow in sequential programs. In Proc. European Symposium on Research in Computer Security, volume 875 of LNCS, 1994. Springer Verlag. [WWW ] Keyword(s): formal verification, program analysis, verification tools, computer security, information flow. [Abstract] [bibtex-entry]



2. P. Brisset and O. Ridoux. The Architecture of an Implementation of $\lambda$Prolog: Prolog/Mali. In ILPS'94 Workshop on Implementation Techniques for Logic Programming Languages, 1994. Note: Extended version of \citebo92b. [WWW ] Keyword(s): See \citebo92b. [Abstract] [bibtex-entry]



3. P. Fradet. Collecting More Garbage. In Proc. of ACM Conf. on Lisp and Functional Programming, Orlando, FL, USA, pages 24-33, June 1994. ACM Press. [WWW ] Keyword(s): Garbage collection, space leaks, typing, parametricity.. [Abstract] [bibtex-entry]



4. P. Fradet. Compilation of Head and Strong Reduction. In Proc. of the 5th European Symposium on Programming, volume 788 of LNCS, Edinburgh, UK, pages 211-224, April 1994. Springer-Verlag. [WWW ] Keyword(s): lambda-calculus, continuations, strong reduction, head reduction, compilation.. [Abstract] [bibtex-entry]



5. C.L. Hankin and D. Le Métayer. A type-based framework for program analysis. In Proc. Static Analysis Symposium, Springer Verlag, volume 864 of LNCS, pages 380-394, 1994. [WWW ] [Abstract] [bibtex-entry]



6. C.L. Hankin and D. Le Métayer. Deriving algorithms from type inference systems: Application to strictness analysis. In Proc. ACM Symposium on Principles of Programming Languages, pages 202-212, 1994. [WWW ] [Abstract] [bibtex-entry]



7. C.L. Hankin and D. Le Métayer. Lazy type inference for the strictness analysis of lists. In Proc. 5th European Symposium on Programming, Springer Verlag, volume LNCS, pages 211-224, 1994. [WWW ] [Abstract] [bibtex-entry]



8. D. Le Métayer. Higher-order multiset programming. In Proc. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 18, 1994. American Mathematical Society. [WWW ] [Abstract] [bibtex-entry]

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.

This document was translated from BibT_EX by bibtex2html