Previous Next Contents

Références

[1]
Harold Abelson, Gerald J. Sussman, Structure and Interpretation of Computer Programs, MIT Press, 1985.

[2]
Adobe Systems Inc., PostScript Language, Tutorial and Cookbook, Addison Wesley, 1985.

[3]
Al V. Aho, Ravi Sethi, Jeff D. Ullman, Compilers: Principles, Techniques, and Tools, Addison Wesley, 1986. En français: Compilateurs : principes, techniques et outils, trad. par Pierre Boullier, Philippe Deschamp, Martin Jourdan, Bernard Lorho, Monique Mazaud, InterÉditions, 1989.

[4]
Henk Barendregt, The Lambda Calculus, Its Syntax and Semantics, North Holland, 1981.

[5]
Danièle Beauquier, Jean Berstel, Philippe Chrétienne, Eléments d'algorithmique, Masson, Paris, 1992.

[6]
Jon Bentley, Programming Pearls, Addison Wesley, 1986.

[7]
Claude Berge, La théorie des graphes et ses applications, Dunod, Paris, 1966.

[8]
Jean Berstel, Jean-Eric Pin, Michel Pocchiola, Mathématiques et Informatique, McGraw-Hill, 1991.

[9]
Noam Chomsky, Marcel Paul Schützenberger, The algebraic theory of context free languages dans Computer Programming and Formal Languages, P. Braffort, D. Hirschberg ed. North Holland, Amsterdam, 1963

[10]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Algorithms, MIT Press, 1990.

[11]
Patrick Cousot, Introduction à l'algorithmique et à la programmation, Ecole Polytechnique, Cours d'Informatique, 1986.

[12]
Shimon Even, Graph Algorithms, Computer Science Press, Potomac, Md, 1979.

[13]
Adele Goldberg, Smalltalk-80: the language and its implementation, Addison-Wesley 1983.

[14]
David Goldberg, What Every Computer Scientist Should Know About Floating-Point Arithmeticc, Computing Surveys, 23(1), Mars 1991.

[15]
Gaston H. Gonnet, Riccardo Baeza-Yates, Handbook of Algorithms and Data Structures, In Pascal and C, Addison Wesley, 1991.

[16]
Mike J. C. Gordon, Robin Milner, Lockwood Morris, Malcolm C. Newey, Chris P. Wadsworth, A metalanguage for interactive proof in LCF, In 5th ACM Symposium on Principles of Programming Languages, 1978, ACM Press, New York.

[17]
Ron L. Graham, Donald E. Knuth, Oren Patashnik, Concrete mathematics: a foundation for computer science, Addison Wesley, 1989.

[18]
Samuel P. Harbison, Modula-3, Prentice Hall, 1992.

[19]
John H. Hennessy, David A. Patterson, Computer Architecture, A Quantitative Approach, Morgan Kaufmann Publishers, Inc. , 1990.

[20]
Kathleen Jensen, Niklaus Wirth, PASCAL user manual and report : ISO PASCAL standard, Springer, 1991. (1ère édition en 1974).

[21]
Gerry Kane, Mips, RISC Architecture, MIPS Computer Systems, Inc., Prentice Hall, 1987.

[22]
Brian W. Kernighan, Dennis M.Ritchie, The C programming language, Prentice Hall, 1978. En français: Le Langage C, trad. par Thierry Buffenoir, Manuels informatiques Masson, 8ème tirage, 1990.

[23]
Brian W. Kernighan, PIC--a language for typesetting graphics, Software Practice & Experience 12 (1982), 1-20.

[24]
Dick B. Kieburtz, Structured Programming And Problem Solving With Algol W, Prentice Hall, 1975.

[25]
Stephen C. Kleene, Introduction to Metamathematics, North Holland, 6ème édition, 1971. (1ère en 1952).

[26]
Donald E. Knuth, The TeXbook, Addison Wesley, 1984.

[27]
Donald E. Knuth, The Metafont book, Addison Wesley, 1986.

[28]
Donald E. Knuth, Fundamental Algorithms. The Art of Computer Programming, vol 1, Addison Wesley, 1968.

[29]
Donald E. Knuth, Seminumerical algorithms, The Art of Computer Programming, vol 2, Addison Wesley, 1969.

[30]
Donald E. Knuth, Sorting and Searching. The Art of Computer Programming, vol 3, Addison Wesley, 1973.

[31]
Leslie Lamport, LATEX, User's guide & Reference Manual, Addison Wesley, 1986.

[32]
Butler W. Lampson et Ken A. Pier, A Processor for a High-Performance Personal Computer, Xerox Palo Alto Research Center Report CSL-81-1. 1981 (aussi dans Proceedings of Seventh Symposium on Computer Architecture, SigArch/IEEE, La Baule, Mai 1980, pp. 146--160.

[33]
Jan van Leeuwen, Handbook of theoretical computer science, volumes A et B, MIT press, 1990.

[34]
M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics, Cambridge University Press, 1983.

[35]
Udi Manber, Introduction to Algorithms, A creative approach, Addison Wesley, 1989

[36]
Bob Metcalfe, D. Boggs, Ethernet: Distributed Packet Switching for Local Computer Networks, Communications of the ACM 19,7, Juillet 1976, pp 395--404.

[37]
Robin Milner, A proposal for Standard ML, In ACM Symposium on LISP and Functional Programming, pp 184-197, 1984, ACM Press, New York.

[38]
Robin Milner, Mads Tofte, Robert Harper, The definiton of Standard ML, The MIT Press, 1990.

[39]
Greg Nelson, Systems Programming with Modula-3, Prentice Hall, 1991.

[40]
Eric Raymond, The New Hacker's Dictionary, dessins de Guy L. Steele Jr., MIT Press 1991.

[41]
Brian Randell, L. J. Russel, Algol 60 Implementation, Academic Press, New York, 1964.

[42]
Martin Richards, The portability of the BCPL compiler, Software Practice and Experience 1:2, pp. 135-146, 1971.

[43]
Martin Richards, Colin Whitby-Strevens, BCPL : The Language and its Compiler, Cambride University Press, 1979.

[44]
Denis M. Ritchie et Ken Thompson, The UNIX Time-Sharing System, Communications of the ACM, 17, 7, Juillet 1974, pp 365--375 (aussi dans The Bell System Technical Journal, 57,6, Juillet-Aout 1978).

[45]
Hartley Rogers, Theory of recursive functions and effective computability, MIT press, 1987, (édition originale McGraw-Hill, 1967).

[46]
A. Sainte-Laguë, Les réseaux (ou graphes), Mémoire des Sciences Mathématiques (18), 1926.

[47]
Bob Sedgewick, Algorithms, 2nd edition, Addison-Wesley, 1988. En français: Algorithmes en langage C, trad. par Jean-Michel Moreau, InterEditions, 1991.

[48]
Ravi Sethi, Programming Languages, Concepts and Constructs, Addison Wesley, 1989.

[49]
Bjarne Stroustrup, The C++ Programming Language, Addison Wesley, 1986.

[50]
Robert E. Tarjan, Depth First Search and linear graph algorithms, Siam Journal of Computing, 1, pages 146-160, 1972.

[51]
Chuck P. Thacker, Ed M. McCreight, Butler W. Lampson, R. F. Sproull, D. R. Boggs, Alto: A Personal Computer, Xerox-PARC, CSL-79-11, 1979 (aussi dans Computer Structures: Readings and Examples, 2nd edition, par Siewoiorek, Bell et Newell).

[52]
Pierre Weis, The Caml Reference Manual, version 2-6.1, Rapport technique 121, INRIA, Rocquencourt, 1990.

[53]
Pierre Weis, Xavier Leroy, Le langage Caml, InterEditions, 1993.

Previous Next Contents