Best viewed in 24pt and full-screen

Références

Abadi et al. 91

M. ABADI, L. CARDELLI, P.-L. CURIEN ET J.-J. LfEVY, Explicit substitutions, J. Functional Programming, vol. 1, n. 4, 1991, p. 375-416.

Abramson et Dahl 89

H. ABRAMSON ET V. DAHL, Logic grammars, Springer-Verlag, Berlin, 1989, Symbolic computation -- Artificial Intelligence.

Aho et al. 86

A.V. AHO, R. SETHI ET J.D. ULLMAN, Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986.

Aït-Kaci 91

H. AÏT-KACI, Warren's Abstract Machine: A Tutorial Reconstruction, MIT Press, 1991.

Andréka et Németi 76

H. ANDRéKA ET I. NéMETI, The Generalised Completeness of Horn Predicate-Logic as a Programming Language, DAI Research Report n. 21, University of Edinburgh, 1976.

Apt et Bol 94

K. APT ET R. BOL, Logic Programming and Negation, Journal of Logic Programming, vol. 19 & 20, 1994, p. 9-72.

Barendregt et Hemerik 90

H. BARENDREGT ET K. HEMERIK, Types in Lambda Calculi and Programming Languages, European Symp. on Programming, LNCS 432, N. Jones ed., p. 1-35, Springer-Verlag, 1990.

Barendregt 81

H. BARENDREGT, The Lambda Calculus: Its Syntax and Semantics, European Symp. on Programming, J. Barwise, D. Kaplan, H.J. Keisler, P. Suppes et A.S. Troelstra ed., North-Holland, 1981.

Barendregt 90

H.P. BARENDREGT, Functional Programming and Lambda Calculus, p. 321-363, Handbook of Theoretical Computer Science, J. Van Leeuwen ed., Elsevier, 1990.

Barendregt 91

H. BARENDREGT, Introduction to Generalized Type Systems, J. Functional Programming, vol. 1, n. 2, 1991, p. 125-154.

Battani et Meloni 73

G. BATTANI ET H. MELONI, Interpréteur du langage de programmation Prolog, rapport technique, Marseille, France, Groupe d'Intelligence Artificielle, 1973.

Beckert et Posegga 95

B. BECKERT ET J. POSEGGA, : Lean, Tableau-based Deduction, J. Automated Reasoning, vol. 11, n. 1, 1995, p. 43-81.

Beckert et Posegga 96

B. BECKERT ET J. POSEGGA, Logic Programming as a Basis for Lean Automated Deduction, J. Logic Programming, vol. 28, n. 3, 1996, p. 231-236.

Bekkers et al. 84

Y. BEKKERS, B. CANET, O. RIDOUX ET L. UNGARO, A Memory Management Machine for Prolog Interpreters, 2nd Int. Conf. Logic Programming, S-Å. Tärnlund ed., Uppsala University, p. 343-351, 1984.

Bekkers et al. 86

Y. BEKKERS, B. CANET, O. RIDOUX ET L. UNGARO, MALI: A Memory with a Real-Time Garbage Collector for Implementing Logic Programming Languages, 3rd Symp. Logic Programming, IEEE, 1986.

Bekkers et al. 88

Y. BEKKERS, B. CANET, O. RIDOUX ET L. UNGARO, MALI: A Memory for Implementing Logic Programming Languages, Programming of Future Generation Computers, K. Fuchi et M. Nivat ed., North-Holland, 1988.

Bekkers et al. 92

Y. BEKKERS, O. RIDOUX ET L. UNGARO, Dynamic Memory Management for Sequential Logic Programming Languages, Int. Worshop on Memory Management, LNCS 637, Y. Bekkers et J. Cohen ed., p. 82-102, Springer-Verlag, 1992.

Belleannée et al. 95

C. BELLEANNÉE, P. BRISSET ET O. RIDOUX, Une reconstruction pragmatique de Prolog, Technique et science informatiques, Hermès, vol. 14, n. 9, 1995, p. 1131-1164.

Belleannée 91

C. BELLEANNÉE, Vers un démonstrateur de théorèmes adaptatif, Thèse, Université de Rennes 1, 1991.

Benhamou et Touraïvane 95

F. BENHAMOU ET TOURAÏVANE, Prolog IV: langage et algorithmes, Journées Francophones de Programmation Logique, p. 51-65, Teknea, Dijon, France, 1995.

Bevemyr et Lindgren 94

J. BEVEMYR ET T. LINDGREN, A Simple and Efficient Copying Garbage Collector for Prolog, 6th Int. Symp. Programming Languages Implementation and Logic Programming, LNCS 844, p. 88-92, Springer-Verlag, 1994.

Beyssade et al. 95

C. BEYSSADE, P. ENJALBERT ET C. LEFÈVRE, Cooperating Logical Agents, Intelligent Agents II, Agent Theories, Architectures and Languages, LNAI 1037, M. Wooldridge, J. P. Müller et M. Tambe ed., p. 299-314, Springer-Verlag, 1995.

Böhm et Berarducci 85

C. BÖHM ET A. BERARDUCCI, Automatic Synthesis of Typed -Programs on Term Algebras, Theoretical Computer Science, vol. 39, 1985, p. 135-154.

Bonner et McCarty 90

A.J. BONNER ET L.T. MCCARTY, Adding Negation-as-Failure to Intuitionistic Logic Programming, 2nd North American Conf. Logic Programming, S. Debray et M. Hermenegildo ed., p. 681-703, MIT Press, 1990.

Borras et al. 89

P. BORRAS, D. CLEMENT, TH. DESPEYROUX, J. INCERPI, G. KAHN, B. LANG ET V. PASCUAL, CENTAUR: The System, ACM SIGSOFT/SIGPLAN Conf. Software Engineering Symposium on Practical Software Development Environments, p. 14-24, SIGPLAN Notices, (ACM), Boston, MA, 1989.

Bossi et al. 96

A. BOSSI, M. BUGLIESI, M. GABBRIELLI, G. LEVI ET M.C. MEO, Differential logic programs: Programming methodologies and semantics, Science of Computer Programming, n. 27, 1996, p. 217-262.

Brisset et al.

P. BRISSET, S. LE HUITOUZE ET O. RIDOUX, Prolog/Mali Reference Manual, .

Brisset et Ridoux 91

P. BRISSET ET O. RIDOUX, Naïve Reverse Can Be Linear, 8th Int. Conf. Logic Programming, K. Furukawa ed., p. 857-870, MIT Press, 1991.

Brisset et Ridoux 92a

P. BRISSET ET O. RIDOUX, The Architecture of an Implementation of Prolog: Prolog/Mali, Workshop on Prolog, Philadelphia, 1992.

Brisset et Ridoux 92b

P. BRISSET ET O. RIDOUX, The Compilation of Prolog and its execution with MALI, Publication Interne n. 687, IRISA, 1992.

Brisset et Ridoux 93

P. BRISSET ET O. RIDOUX, Continuations in Prolog, 10th Int. Conf. Logic Programming, D.S. Warren ed., p. 27-43, MIT Press, 1993.

Brisset et Ridoux 94

P. BRISSET ET O. RIDOUX, The Architecture of an Implementation of Prolog: Prolog/Mali, ILPS'94 Workshop on Implementation Techniques for Logic Programming Languages, 1994.

Brisset 89

P. BRISSET, Implémentation d'un langage de programmation logique d'ordre supérieur avec MALI, Rapport de recherche n. 1119, INRIA, 1989.

Brisset 92

P. BRISSET, Compilation de Prolog, Thèse, Université de Rennes 1, 1992.

Bruynooghe et Janssens 88

M. BRUYNOOGHE ET G. JANSSENS, An Instance of Abstract Interpretation Integrating Type and Mode Inferencing, 5th Int. Conf. and Symp. Logic Programming, K.A. Bowen et R.A. Kowalski ed., p. 669-683, 1988.

Bruynooghe 82

M. BRUYNOOGHE, Adding Redundancy to Obtain More Reliable and More Readable Prolog Programs, 1st Int. Conf. Logic Programming, M. Van Caneghem ed., Marseille, France, 1982.

Chabert et al. 94

J.-L. CHABERT, E. BARBIN, M. GUILLEMOT, A. MICHEL-PAJUS, J. BOROWCZYK, A. DJEBBAR ET J.-C. MARTZLOFF, Histoires d'algorithmes, Du caillou à la puce, Belin, 1994.

Chassin de Kergommeaux et Codognet 94

J. CHASSIN DE KERGOMMEAUX ET P. CODOGNET, Parallel Logic Programming Systems, ACM Computing Surveys, vol. 26, n. 3, September 1994, p. 295-336.

Chen et Warren 93

W. CHEN ET D.S. WARREN, Query evaluation under the well-founded semantics, 12th ACM Symp. Principles of Database Systems, 1993.

Church 36

A. CHURCH, An unsolvable problem of elementary number theory, American J. Mathematics, vol. 58, n. 1, 1936, p. 345-363.

Church 40

A. CHURCH, A Formulation of the Simple Theory of Types, J. Symbolic Logic, vol. 5, n. 1, 1940, p. 56-68.

Clark 78

K.L. CLARK, Negation as failure, p. 293-322, Logic and Data Bases, H. Gallaire et J. Minker ed., Plenum Press, New-York, USA, 1978.

Clocksin et Mellish 81

W.F. CLOCKSIN ET C.S. MELLISH, Programming in Prolog, Springer-Verlag, 1981, 1st edition.

Clocksin et Mellish 94

W.F. CLOCKSIN ET C.S. MELLISH, Programming in Prolog, Springer-Verlag, 1994, 4th edition.

Clocksin 88

W.F. CLOCKSIN, A Technique for Translating Clausal Specifications of Numerical Methods into Efficient Programs, J. Logic Programming, vol. 5, 1988, p. 231-242.

Codd 70

E.F. CODD, A relational model of data for large shared data banks, CACM, vol. 13, n. 6, Jun. 1970, p. 377-387.

Cohen et Hickey 87

J. COHEN ET T.J. HICKEY, Parsing and Compiling Using Prolog, ACM Transactions on Programming Languages and Systems, vol. 9, n. 2, April 1987, p. 125-163.

Cohen 88

J. COHEN, A View of the Origins and Development of Prolog, CACM, vol. 31, n. 1, 1988, p. 38-43.

Cohen 90

J. COHEN, Constraint Logic Programming Languages, CACM, vol. 33, n. 7, 1990, p. 52-68.

Colmerauer et al. 79

A. COLMERAUER, H. KANOUI ET M. VAN CANEGHEM, Etude et réalisation d'un système Prolog, rapport technique, G.I.A. Université Aix-Marseille, May 1979.

Colmerauer et al. 82

A. COLMERAUER, H. KANOUI ET M. VAN CANEGHEM, Prolog, bases théoriques et développements actuels, Technique et science informatiques, Hermès, vol. 2, n. 4, 1982.

Colmerauer 70

A. COLMERAUER, Les systèmes-Q ou un formalisme pour analyser et synthétiser des phrases sur ordinateur, Publication Interne n. 43, Canada, Département d'Informatique, Université de Montréal, 1970.

Colmerauer 78

A. COLMERAUER, Metamorphosis Grammars, Natural Language Communication with Computers, L. Bolc ed., p. 133-187, Springer-Verlag, 1978.

Colmerauer 82

A. COLMERAUER, Prolog and Infinite Trees, p. 231-251, Logic Programming, K.L. Clark et S-Å. Tärnlund ed., Academic Press, New-York, 1982.

Colmerauer 90

A. COLMERAUER, An Introduction to Prolog III, CACM, vol. 33, n. 7, 1990.

Comini et al. 95

M. COMINI, G. LEVI ET G. VITIELI, Declarative Diagnosis Revisited, 12th Int. Logic Programming Symp., J. Lloyd ed., MIT Press, 1995.

Consel et Khoo 91

C. CONSEL ET S.C. KHOO, Semantics-Directed Generation of a Prolog Compiler, 3rd Int. Work. Programming Languages Implementation and Logic Programming, LNCS 528, J. Mauszynski et M. Wirsing ed., Springer-Verlag, 1991.

Coquand et Huet 88

T. COQUAND ET G. HUET, The calculus of constructions, Information and Computation, vol. 76, n. 2/3, 1988, p. 95-120.

Coüasnon et al. 95

B. COÜASNON, P. BRISSET ET I. STÉPHAN, Using Logic Programming Languages for Optical Music Recognition, 3rd Conf. The Practical Application of Prolog, A. Marien ed., p. 115-134, Alinmead Software Ltd, Paris, France, 1995.

Coüasnon 96

B. COÜASNON, Segmentation et reconnaissance de documents guidées par la connaissance a priori : application aux partitions musicales, Thèse, Université de Rennes 1, 1996.

Coupet-Grimal et Ridoux 95

S. COUPET-GRIMAL ET O. RIDOUX, On the Use of Advanced Logic Programming Languages in Computational Linguistics, J. Logic Programming, vol. 24, n. 1&2, 1995, p. 121-159.

Coupet-Grimal 88

S. COUPET-GRIMAL, Deux arguments pour les arbres infinis en Prolog, Thèse, Université d' Aix-Marseille 2, 1988.

Coupet-Grimal 91

S. COUPET-GRIMAL, Prolog infinite trees and automata, RAIRO Informatique Théorique et Applications, vol. 25, n. 5, 1991, p. 397-418.

Curry et al. 68

H.B. CURRY, R. FEYS ET W. CRAIG, Combinatory Logic, North-Holland, Amsterdam, 1968.

Dalrymple et al. 91

M. DALRYMPLE, S.M. SHIEBER ET F.C.N. PEREIRA, Ellipsis and Higher-Order Unification, Linguistics and Philosophy, vol. 14, 1991, p. 399-452.

de Bruijn 72

N.G. DE BRUIJN, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem, Indagationes Mathematicae, vol. 34, 1972, p. 381-392.

Deransart et al. 91

P. DERANSART, FERRAND G. ET M. TÉGUIA, NSTO Programs (Not Subject to Occur-Check), 8th Int. Logic Programming Symp., V. Saraswat et K. Ueda ed., p. 533-550, MIT Press, 1991.

Deransart et al. 96

P. DERANSART, A.A. ED-DBALI ET L. CERVONI, Prolog: The Standard, Springer-Verlag, 1996.

Devienne et al. 96

PH. DEVIENNE, P. LEBÈGUE, A. PARRAIN, J.-C. ROUTIER ET J. WüRTZ, Smallest Horn Clause Programs, J. Logic Programming, vol. 27, n. 3, 1996, p. 227-267.

Deville 90

Y. DEVILLE, Logic programming: systematic program development, Addison-Wesley, 1990.

Di Cosmo 95

R. DI COSMO, Isomorphisms of Types: from -calculus to information retrieval and language design, Birkhäuser, 1995, Progress in theoretical computer science.

Dieudonné et al. 78

J. DIEUDONNÉ, P. DUGAC, W.J. ET F. ELLISON, J. GUÉRINDON, M. GUILLAUME, G. HIRSH, CHR. HOUZEL, P. LIBERMANN, M. LOÈVE ET J.-L. VERLEY, Abrégé d'histoire des mathématiques, 1700-1900, Hermann, 1978, Tome II.

Dijkstra 68

E.W. DIJKSTRA, Goto Statement Considered Harmful, CACM, vol. 11, 1968, p. 147-.

Dowek et al. 95

G. DOWEK, T. HARDIN ET C. KIRCHNER, Higher-order unification via explicit substitutions, Symp. Logic in Computer Science, D. Kozen ed., p. 366-374, 1995, Extended abstract.

Dubois et al. 95

C. DUBOIS, F. ROUAIX ET P. WEIS, Extensional polymorphism, 22th ACM Symp. Principles of Programming Languages, p. 118-129, 1995.

Ducassé et Noyé 94

M. DUCASSÉ ET J. NOYÉ, Logic Programming Environments: Dynamic Program Analysis and Debugging, J. Logic Programming, vol. 19 & 20, 1994, p. 351-384.

Earley 70

J. EARLEY, An Efficient Context-Free Parsing Algorithm, CACM, vol. 13, n. 2, Feb. 1970, p. 94-102.

Elliott et Pfenning 91

C.M. ELLIOTT ET F. PFENNING, A Semi-Functional Implementation of a Higher-Order Logic Programming Language, p. 289-325, Topics in Advanced Language Implementation, P. Lee ed., MIT Press, 1991.

Elliott 89

C.M. ELLIOTT, Higher-order Unification with Dependent Function Types, 3rd Int. Conf. Rewriting Techniques and Applications, LNCS 355, N. Derschowitz ed., p. 121-136, Springer-Verlag, 1989.

Felty et Miller 88

A. FELTY ET D.A. MILLER, Specifying Theorem Provers in a Higher-Order Logic Programming Language, CADE-88, LNCS 310, E. Lusk et R. Overbeek ed., p. 61-80, Springer-Verlag, 1988.

Felty et Miller 90

A. FELTY ET D.A. MILLER, Encoding a Dependent-Type -Calculus in a Logic Programming Language, Rapport de recherche n. 1259, Inria, 1990.

Felty 87

A. FELTY, Implementing Theorem Provers in Logic Programming, Dissertation Proposal n. MS-CIS-87-109, University of Pennsylvania, 1987.

Felty 89

A. FELTY, Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language, PhD dissertation, Dept. of Computer and Information Science, University of Pennsylvania, 1989.

Felty 93

A. FELTY, Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language, J. Automated Reasoning, vol. 11, n. 1, 1993, p. 43-81.

Ferrand et Deransart 93

G. FERRAND ET P. DERANSART, Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs, J. Logic Programming, vol. 17, n. 2/3-4, novembre 1993, p. 265-278.

Ferrand et Lallouet 95

G. FERRAND ET A. LALLOUET, A compositional proof method of partial correctness for normal logic programs, 12th Int. Logic Programming Symp., J. Lloyd ed., p. 209-223, MIT Press, 1995.

Fitting 98

M. FITTING, Revisited, J. Logic and Computation, vol. 8, n. 1, 1998, p. 33-47.

Gallier 86

JEAN H. GALLIER, Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper & Row, 1986.

Gallier 91

J. GALLIER, Constructive Logics. Part I: A Tutorial on Proof Systems and Typed Lambda Calculi, rapport technique, Paris, France, DEC PRL, 5 1991.

Giannesini et Cohen 84

F. GIANNESINI ET J. COHEN, Parser Generation and Grammar Manipulations using Prolog's Infinite Trees, J. Logic Programming, Oct. 1984, p. 253-265.

Giordano et Olivetti 92

L. GIORDANO ET NICOLA OLIVETTI, Negation as Failure in Intuitionistic Logic Programming, Joint Int. Conf. and Symp. Logic Programming, K. Apt ed., p. 431-445, MIT Press, 1992.

Girard et al. 89

J.-Y. GIRARD, Y. LAFONT ET P. TAYLOR, Proofs and Types, Cambridge University Press, 1989, Cambridge Tracts in Theoretical Computer Science, volume 7.

Girard 72

J.-Y. GIRARD, Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur, Thèse de doctorat d'état, Université de Paris VII, 1972.

Gorlick et al. 90

M. GORLICK, C. KESSELMAN, D. MAROTTA ET D. PARKER, Mockingbird: A Logical Methodology for Testing, J. Logic Programming, vol. 8, n. 1-2, 1990, p. 95-119.

Gottlob 94

GEORG GOTTLOB, Complexity and expressive power of disjunctive logic programming, 11th Int. Logic Programming Symp., M. Bruynooghe ed., p. 23-42, 1994.

Gries 79

D. GRIES, The Schorr-Waite Graph Marking Algorithm, Acta Informatica, n. 3, 1979, p. 223-232.

Halbswachs 93

N. HALBSWACHS, Synchronous Programming of Reactive Systems, Kluwer Academic Press, 1993.

Hannan et Miller 92

J. HANNAN ET D. MILLER, From Operational Semantics to Abstract Machines, Mathematical Structures in Computer Science, vol. 4, n. 2, 1992, p. 415-459.

Hanus 89a

M. HANUS, Horn Clause Programs with Polymorphic Types: Semantics and Resolution, TAPSOFT'89, LNCS 352, p. 225-240, Springer-Verlag, 1989.

Hanus 89b

M. HANUS, Polymorphic Higher-Order Programming in Prolog, 6th Int. Conf. Logic Programming, G. Levi et M. Martelli ed., p. 382-397, MIT Press, 1989.

Hanus 91

M. HANUS, Horn Clause Programs with Polymorphic Types: Semantics and Resolution, Theoretical Computer Science, vol. 89, 1991, p. 63-106.

Harper et al. 87

R. HARPER, F. HONSELL ET G. PLOTKIN, A Framework for Defining Logics, p. 194-204, 2nd Symp. Logic in Computer Science, Ithaca, NY, IEEE, 1987.

Harrop 56

R. HARROP, On Disjunctions and Existential Statements in Intuitionistic Systems of Logic, Math. Annalen., 1956, p. 347-361.

Harrop 60

R. HARROP, Concerning formulas of the types ABC, A(Ex)B(x) in intuitionistic formal systems, J. Symbolic Logic, vol. 25, n. 1, 1960, p. 27-23.

Herbrand 68

J. HERBRAND, Écrits logiques, Presses Universitaires de France, 1968.

Hill et Lloyd 94

P.M. HILL ET J.W. LLOYD, The Gödel Programming Language, MIT Press, 1994.

Hill et Topor 92

P.M. HILL ET R.W. TOPOR, A Semantics for Typed Logic Programs, p. 1-62, Types in Logic Programming, F. Pfenning ed., MIT Press, 1992.

Hindley et Seldin 86

J.R. HINDLEY ET J.P. SELDIN, Introduction to Combinators and -Calculus, Cambridge University Press, 1986.

Hodas et Miller 94

J.S. HODAS ET D.A. MILLER, Logic Programming in a Fragment of Intuitionistic Linear Logic, Information and Computation, vol. 110, n. 2, 1994, p. 327-365.

Horn 51

A. HORN, On Sentences Which Are True of Direct Unions of Algebras, J. Symbolic Logic, vol. 16, n. 1, 1951.

Howard 80

W.A. HOWARD, The Formulae-as-types Notion of Construction, p. 479-490, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.P. Seldin et J.R. Hindley ed., Academic Press, London, 1980.

Huet et al. 97

G. HUET, G. KAHN ET CH. PAULIN-MOHRING, The Coq Proof Assistant, A Tutorial, Version 6.1, rapport technique n. 0204, Inria, 1997.

Huet 75

G. HUET, A Unification Algorithm for Typed -Calculus, Theoretical Computer Science, vol. 1, 1975, p. 27-57.

Huet 76

G. HUET, Résolution d'équations dans les langages d'ordre 1,2..., Thèse de doctorat d'état, Université de Paris VII, 1976.

Hui Bon Hoa 94

A. HUI BON HOA, Intuitionistic Implication and Resolution, 11th Int. Logic Programming Symp., M. Bruynooghe ed., p. 409-423, 1994.

Hui Bon Hoa 97

A. HUI BON HOA, Principe de résolution pour un langage de programmation en logique avec contraintes de portée, Thèse de doctorat, Université de Paris VII, 1997.

Issarny et Bidan 96

V. ISSARNY ET CH. BIDAN, Aster: A Framework for Sound Customization of Distributed Runtime Systems, 16th Int. Conf. Distributed Computing Systems, 1996.

Jaffar et Lassez 86

J. JAFFAR ET J.-L. LASSEZ, Constraint Logic Programming, rapport technique n. 86/74, Victoria, Australia, Monash University, juin 1986.

Kfoury et al. 93

A.J. KFOURY, J. TIURYN ET P. URZYCZYN, The Undecidability of the Semi-Unification Problem, Information and Computation, vol. 102, n. 1, 1993, p. 83-101.

Kleene 71

S.C. KLEENE, Introduction to Metamathematics, North-Holland, Amsterdam, 1971, 6th reprint.

Kowalski et Van Emden 76

R. KOWALSKI ET M. VAN EMDEN, The Semantics of Predicate Logic as a Programming Language, JACM, vol. 23, n. 4, Oct. 1976, p. 733-743.

Kowalski 74

R. KOWALSKI, Predicate Logic as a Programming Language, Information Processing 74, IFIP, J.L. Rosenfeld ed., p. 569-574, North-Holland, 1974.

Lakshman et Reddy 91

T.K. LAKSHMAN ET U.S. REDDY, Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Keefe Type System, 8th Int. Logic Programming Symp., V. Saraswat et K. Ueda ed., p. 202-217, MIT Press, 1991.

Lalement 90

R. LALEMENT, Logique, réduction, résolution, Masson, 1990, Études et recherches en informatique.

Le Huitouze et al. 93a

S. LE HUITOUZE, P. LOUVET ET O. RIDOUX, Les grammaires logiques et Prolog, Journées Francophones sur la Programmation en Logique, p. 93-108, Teknea, Nîmes, France, 1993, Version française de [Le Huitouze et al. 93b].

Le Huitouze et al. 93b

S. LE HUITOUZE, P. LOUVET ET O. RIDOUX, Logic Grammars and Prolog, 10th Int. Conf. Logic Programming, D.S. Warren ed., p. 64-79, MIT Press, 1993.

Le Huitouze 88

S. LE HUITOUZE, Mise en uvre de Prolog II/MALI, Thèse, Université de Rennes 1, 1988.

Le Huitouze 90a

S. LE HUITOUZE, A New Data Structure for Implementing Extensions to Prolog, 2nd Int. Work. Programming Languages Implementation and Logic Programming, LNCS 456, P. Deransart et J. Mauszynski ed., p. 136-150, Springer-Verlag, 1990.

Le Huitouze 90b

S. LE HUITOUZE, Une nouvelle structure de données pour l'implémentation des extensions de Prolog, Séminaire de Programmation Logique de Trégastel, p. 71-88, CNET, France, 1990, Version française de [Le Huitouze 90a].

Leivant 83

D. LEIVANT, Reasoning about Functional Programs and Complexity Classes Associated with Type Discipline, 24th Foundations of Computer Science, p. 160-169, IEEE, 1983.

Lloyd 87

J.W. LLOYD, Foundations of Logic Programming, Springer-Verlag, Berlin, 1987, Symbolic computation -- Artificial Intelligence.

Lloyd 88

J.W. LLOYD, Fondements de la programmation logique, Eyrolles, 1988, Traduction française de [Lloyd 87].

Louvet et Ridoux 96

P. LOUVET ET O. RIDOUX, Parametric Polymorphism for Typed Prolog and Prolog, 8th Int. Symp. Programming Languages Implementation and Logic Programming, LNCS 1140, p. 47-61, Springer-Verlag, Aachen, Germany, 1996.

Louvet 96

P. LOUVET, Programmation en logique et typage d'ordre supérieur, Thèse, Université de Rennes 1, 1996.

Malésieux et al. 98

F. MALéSIEUX, O. RIDOUX ET P. BOIZUMAULT, Abstract compilation of Prolog, Joint Int. Conf. and Symp. Logic Programming, J. Jaffar ed., MIT Press, 1998, À paraître.

Manthey et Bry 88

R. MANTHEY ET F. BRY, SATCHMO: A theorem prover implemented in Prolog, 9th Int. Conf. Automated Deduction, E.L. Lusk et R.A. Overbeek ed., p. 415-434, Argonne, IL, 1988.

McPhee 95

R. MCPHEE, Implementing Ruby in a Higher-Order Logic Programming Language, rapport technique, Oxford University Computing Laboratory, 1995.

Miller et al. 87

D.A. MILLER, G. NADATHUR ET A. SCEDROV, Hereditary Harrop Formulas and Uniform Proof Systems, 2nd Symp. Logic in Computer Science, D. Gries ed., p. 98-105, Ithaca, NY, 1987.

Miller et al. 91

D.A. MILLER, G. NADATHUR, F. PFENNING ET A. SCEDROV, Uniform Proofs as a Foundation for Logic Programming, Annals of Pure and Applied Logic, vol. 51, 1991, p. 125-157.

Miller et Nadathur 86a

D. MILLER ET G. NADATHUR, Some Uses of Higher-Order Logic in Computational Linguistics, 24th Annual Meeting of the Association for Computational Linguistics, p. 247-255, 1986.

Miller et Nadathur 86b

D.A. MILLER ET G. NADATHUR, Higher-Order Logic Programming, 3rd Int. Conf. Logic Programming, LNCS 225, E. Shapiro ed., p. 448-462, Springer-Verlag, 1986.

Miller et Nadathur 87

D.A. MILLER ET G. NADATHUR, A Logic Programming Approach to Manipulating Formulas and Programs, IEEE Symp. Logic Programming, S. Haridi ed., p. 379-388, San Francisco, CA, USA, 1987.

Miller 83

D.A. MILLER, Proofs in Higher-Order Logic, Phd thesis, Carnegie Mellon University, 1983.

Miller 86

D.A. MILLER, A Theory of Modules for Logic Programming, Symp. Logic Programming, p. 106-115, Salt Lake City, UT, USA, 1986.

Miller 89a

D.A. MILLER, Lexical Scoping as Universal Quantification, 6th Int. Conf. Logic Programming, G. Levi et M. Martelli ed., p. 268-283, MIT Press, 1989.

Miller 89b

D.A. MILLER, A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification, Int. Workshop on Extensions of Logic Programming, LNAI 475, P. Schroeder-Heister ed., Springer-Verlag, New York, 1989.

Miller 89c

D.A. MILLER, A Logical Analysis of Modules in Logic Programming, J. Logic Programming, vol. 6, n. 1-2, 1989, p. 79-108.

Miller 91a

D.A. MILLER, Abstract Syntax and Logic Programming, 2nd Russian Conf. Logic Programming, LNCS 592, A. Voronkov ed., Springer-Verlag, 1991.

Miller 91b

D.A. MILLER, A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification, J. Logic and Computation, vol. 1, n. 4, 1991, p. 497-536.

Miller 91c

D.A. MILLER, Logics for Logic Programming, Tutorial 8th Int. Conf. Logic Programming, Paris, France, INRIA, 1991.

Miller 91d

D.A. MILLER, Unification of Simply Typed Lambda-Terms as Logic Programming, 8th Int. Conf. Logic Programming, K. Furukawa ed., p. 255-269, MIT Press, 1991.

Miller 92

D.A. MILLER, Unification under a Mixed Prefix, J. Symbolic Computation, vol. 14, 1992, p. 321-358.

Miller 93

D.A. MILLER, A Proposal for Modules in Prolog, Int. Workshop Extensions of Logic Programming, LNAI 798, R. Dyckhoff ed., p. 206-221, Springer-Verlag, 1993.

Miller 94

D. MILLER, A Multiple-Conclusion Meta-Logic, Symp. Logic in Computer Science, p. 272-281, 1994.

Milner 78

R. MILNER, A Theory of Type Polymorphism in Programming, J. Computer and System Sciences, vol. 17, 1978, p. 348-375.

Mishra 84

P. MISHRA, Towards a theory of types in Prolog, IEEE Int. Symp. Logic Programming, p. 289-298, Atlantic City, NJ, USA, 1984.

Mitchell 84

J.C. MITCHELL, Type inference and type containment, Semantics of Data Type, LNCS 173, G. Kahn, D.B. MacQueen et G. Plotkin ed., p. 257-277, Springer-Verlag, 1984.

Momigliano 92

A. MOMIGLIANO, Minimal Negation and Hereditary Harrop Formulas, 2nd Int. Symp. Logical Foundation of Computer Science, LNCS 620, A.Nerode et M. Taitslin ed., p. 326-335, Springer-Verlag, 1992.

Montague 74

R. MONTAGUE, The proper treatement of quantification in ordinary English, Formal Philosophy, R.M. Thomason ed., Yale University Press, New Haven, Co, USA, 1974.

Mycroft et O'Keefe 84

A. MYCROFT ET R.A. O'KEEFE, A Polymorphic Type System for Prolog, Artificial Intelligence, vol. 23, 1984, p. 295-307.

Mycroft 84

A. MYCROFT, Polymorphic Type Schemes and Recursive Definitions, Int. Symp. Programming, LNCS 167, M. Paul et B. Robinet ed., p. 295-307, Springer-Verlag, 1984.

Nadathur et Jayaraman 89

G. NADATHUR ET B. JAYARAMAN, Towards a WAM Model for Prolog, 1st North American Conf. Logic Programming, E.L. Lusk et R.A. Overbeek ed., p. 1180-1198, MIT Press, 1989.

Nadathur et Miller 88

G. NADATHUR ET D.A. MILLER, An Overview of Prolog, Symp. Logic Programming, K. Bowen et R. Kowalski ed., p. 810-827, Seattle, Washington, USA, 1988.

Nadathur et Pfenning 92

G. NADATHUR ET F. PFENNING, The Type System of a Higher-Order Logic Programming Language, p. 245-283, Types in Logic Programming, F. Pfenning ed., MIT Press, 1992.

Nadathur et Wilson 90

G. NADATHUR ET D.S. WILSON, A Representation of Lambda Terms Suitable for Operations on Their Intensions, ACM Conf. Lisp and Functional Programming, p. 341-348, ACM Press, 1990.

Nadathur 87

G. NADATHUR, A Higher-Order Logic as the Basis for Logic Programming, Phd thesis, University of Pennsylvania, 1987.

Nicholson et Foo 89

T. NICHOLSON ET N. FOO, A Denotational Semantics for Prolog, ACM Transactions on Programming Languages and Systems, vol. 11, n. 4, 1989, p. 650-665.

Nipkow 90

T. NIPKOW, Higher-Order Unification, Polymorphism, and Subsorts, Technical Report n. 210, University of Cambridge, Computer Laboratory, 1990.

Noyé 94a

J. NOYÉ, Backtrackable updates, ILPS'94 Workshop on Implementation Techniques for Logic Programming Languages, 1994.

Noyé 94b

J. NOYÉ, Élagage de contexte, retour arrière superficiel, coupure et autres : une étude approfondie de la WAM, Thèse, Université de Rennes 1, 1994.

O'Keefe 85

R.A. O'KEEFE, Towards an algebra for constructing logic programs, 2nd Symp. Logic Programming, J. Cohen et J. Conery ed., IEEE, Boston, MA, USA, 1985.

O'Keefe 90

R.A. O'KEEFE, The Craft of Prolog, MIT Press, 1990.

Pareschi et Miller 90

R. PARESCHI ET D.A. MILLER, Extending Definite Clause Grammars with Scoping Constructs, 7th Int. Conf. Logic Programming, D.H.D. Warren et P. Szeredi ed., p. 373-389, MIT Press, 1990.

Paulson 86

L.C. PAULSON, Natural Deduction as Higher-Order Resolution, J. Logic Programming, vol. 3, 1986, p. 237-258.

Peirce 60

C. S. PEIRCE, Collected Papers of Charles Saunders Peirce, C. Hartshorne et P. Weiss ed., Harvard University Press, 1960, 2nd ed.

Pereira et Warren 80

F.C.N. PEREIRA ET D.H.D. WARREN, Definite Clauses for Language Analysis, Artificial Intelligence, vol. 13, 1980, p. 231-278.

Pereira et Warren 83

F.C.N. PEREIRA ET D.H.D. WARREN, Parsing as Deduction, 21th Annual Meeting of the Association for Computational Linguistics, p. 137-144, 1983.

Pettorossi et Proietti 96

A. PETTOROSSI ET M. PROIETTI, Rules and Strategies for Transforming Functional and Logic Programs, ACM Computing Surveys, vol. 28, n. 2, 1996, p. 360-414.

Pfenning 91

F. PFENNING, Unification and Anti-Unification in the Calculus of Constructions, Symp. Logic in Computer Science, p. 74-85, 1991.

Pierce et al. 89

B. PIERCE, S. DIETZEN ET S. MICHAYLOV, Programming in Higher-Order Typed Lambda-Calculi, Research Report n. CMU-CS-89-111, School of Computer Science, Carnegie Mellon University, 1989.

Press et al. 88

W.H. PRESS, B.P. FLANNERY, S.A. TEUKOLSKY ET W.T. VETTERLONG, Numerical Recipes, Cambridge University Press, 1988.

Proietti 96

M. PROIETTI (éd.), Logic program synthesis and transformation, Springer, 1996, 5th Int. workshop LOPSTR, LNCS 1048.

Pym 92

D. PYM, A Unification Algorithm for the -Calculus, Int. J. Foundations of Computer Science, vol. 3, n. 3, 1992, p. 333-378.

Revesz 88

G. REVESZ, Lambda-Calculus, Combinators and Functional Programming, Cambridge University Press, 1988, Cambridge Tracts in Theoretical Computer Science, volume 4.

Reynolds 74

J. REYNOLDS, Towards a Theory of Type Structure, Colloque sur la Programmation, LNCS 19, p. 408-425, Springer-Verlag, 1974.

Ridoux et Tonneau 90

O. RIDOUX ET H. TONNEAU, Une mise en uvre de l'unification d'expressions booléennes, Séminaire de Programmation Logique de Trégastel, p. 551-570, CNET, France, 1990.

Ridoux 86

O. RIDOUX, Gestion de mémoire temps-réel des langages de programmation relationnelle, Thèse, Université de Rennes 1, 1986.

Ridoux 87

O. RIDOUX, Deterministic and Stochastic Modelling of Parallel Garbage Collection -- Towards Real-Time Criteria, 14th Int. Symp. Computer Architecture, p. 128-136, IEEE, 1987.

Ridoux 89

O. RIDOUX, Programming with MALI -- Unification of Ordered Terms, Rapport de recherche n. 1058, INRIA, 1989.

Ridoux 91

O. RIDOUX, MALIv06: Tutorial and Reference Manual, Publication Interne n. 611, IRISA, 1991.

Ridoux 92

O. RIDOUX, The Compilation of Prolog with MALI, Logic Programming Winter School and Seminar, p. 233-283, Brno, Czechoslovakia, 1992.

Ridoux 95

O. RIDOUX, Imagining CLP, Constraint Programming: Basics and Trends. Selected papers of the 22nd Spring School in Theoretical Computer Science. LNCS 910, A. Podelski ed., p. 209-230, Springer-Verlag, Châtillon/Seine, France, 1995.

Ridoux 96

O. RIDOUX, Engineering Transformations of Attributed Grammars in Prolog, Joint Int. Conf. and Symp. Logic Programming, M. Maher ed., p. 244-258, MIT Press, 1996.

Robinson 65

J.A. ROBINSON, A Machine-Oriented Logic Based on the Resolution Principle, JACM, vol. 12, n. 1, 1965, p. 23-41.

Rollins et Wing 91

E.J. ROLLINS ET J.M. WING, Specifications as Search Keys for Software Libraries, 8th Int. Conf. Logic Programming, K. Furukawa ed., p. 173-187, MIT Press, 1991.

Rosser 84

J.B. ROSSER, Highlights of the History of the Lambda-Calculus, Annals of the History of Computing, vol. 6, n. 4, 1984.

Roussel 75

P. ROUSSEL, Prolog : manuel de référence et d'utilisation, rapport technique, G.I.A. Université Aix-Marseille, 1975.

Schoenig et Ducassé 96

S. SCHOENIG ET M. DUCASSÉ, A Backward Slicing Algorithm for Prolog, 3rd Int. Static Analysis Symp., R. Cousot et D. Schmidt ed., Springer-Verlag, 1996.

Schorr et Waite 67

H. SCHORR ET W. WAITE, An Efficient Machine-Independent Procedure for Garbage Collection in Various List Structures, CACM, vol. 10, n. 8, 1967, p. 501-506.

Shapiro 83

E.Y. SHAPIRO, Algorithmic Programming Debugging, MIT Press, 1983.

Snyder et Gallier 89

W. SNYDER ET J. GALLIER, Higher-Order Unification Revisited: Complete Sets of Transformations, J. Symbolic Computation, vol. 8, 1989, p. 101-140.

Somogyi et al. 96

Z. SOMOGYI, F. HENDERSON, T. CONWAY, A. BROMAGE, T. DOWD, D. JEFFERY, P. ROSS, P. SCHACHTE ET S. TAYLOR, Status of the Mercury system, JICSLP'96 Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, 1996.

Sterling et Shapiro 86

L. STERLING ET E. SHAPIRO, The Art of Prolog, MIT Press, 1986.

Sterling et Shapiro 90

L. STERLING ET E. SHAPIRO, L'art de Prolog, Masson, 1990, Traduction française de [Sterling et Shapiro 86].

Stickel 88

M.E. STICKEL, A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler, Journal of Automated Reasoning, vol. 4, n. 4, 1988, p. 353-380.

Tärnlund 77

S-Å. TÄRNLUND, Horn Clause Computability, BIT, vol. 17, 1977, p. 215-226.

Van Caneghem 86

M. VAN CANEGHEM, L'anatomie de Prolog II, InterÉditions, Paris, 1986.

Van Hentenryck 89

P. VAN HENTENRYCK, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1989.

Wadler 90

P.L. WADLER, Comprehending Monads, ACM Conf. Lisp and Functional Programming, p. 61-78, ACM Press, 1990.

Warren 77

D.H.D. WARREN, Implementing Prolog -- Compiling Logic Programs, Vol. 1 and 2, DAI Research Report n. 39, 40, University of Edinburgh, 1977.

Warren 82

D.H.D. WARREN, Perpetual Processes -- An Unexploited Prolog Technique, Logic Programming Newsletter, n. 3, 1982.

Warren 83a

D.H.D. WARREN, An Abstract Prolog Instruction Set, Technical Note n. 309, Stanford, Ca, SRI International, 1983.

Warren 83b

D.S. WARREN, Using -calculus to represent meanings in logic grammars, 21st Annual Meeting of the Association for Computational Linguistics, p. 51-56, Cambridge, Ma, USA, 1983.

Warren 92

D.S. WARREN, Memoing for Logic Programs, CACM, vol. 35, n. 3, 1992, p. 94-111.

Warren 93

D.S. WARREN, Computing the Well-Founded Semantics of Logic Programs, J. Logic Programming, vol. 17, n. 2-4, 1993.

Wells 94

J.B. WELLS, Typability and Type Checking in the Second-Order -Calculus Are Equivalent and Undecidable, Symp. Logic in Computer Science, p. 176-185, 1994.

Yardeni et Shapiro 87

E. YARDENI ET E. SHAPIRO, A Type System for Logic Programs, Concurrent Prolog: collected papers, E. Shapiro ed., p. 211-244, MIT Press, Cambridge, 1987.

Zobel 87

J. ZOBEL, Derivation of Polymorphic Types for Prolog Programs, 4th Int. Conf. Logic Programming, J.L. Lassez ed., p. 817-838, MIT Press, 1987.