Pragmatic reconstruction of λProlog

Journal of Logic Programming

Volumn 41, Issue 1, 1999, Pages 67-102

  Belleannée, Catherine ^a   Brisset, Pascal ^b   Ridoux, Olivier ^a  

^a CAMPUS DE BEAULIEU   (France)

^b ENAC   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROLOG (PROGRAMMING LANGUAGE);

HARROP FORMULA; HORN FORMULA;

LOGIC PROGRAMMING;

EID: 0032653648     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10038-9     Document Type: Article

References (60)

1. H. Andréka, I. Németi, The generalised completeness of Horn predicate-logic as a programming language, DAI Research Report 21, University of Edinburgh, 1976; Acta Cybernetica 4 (1978) 3-10.
2. H. Barendregt, Introduction to generalized type systems, J. Functional Programming 1 (2) (1991) 125-154.
3. C. Belleannée, Vers un démonstrateur de théorèmes adaptatif, Thèse, Université de Rennes 1, 1991.
4. C. Böhm, A. Berarducci, Automatic synthesis of typed λ-programs on term algebras, Theoretical Computer Science 39 (1985) 135-154.
5. P. Brisset, O. Ridoux, The architecture of an implementation of λProlog: Prolog/Mali, in: Workshop on λProlog, Philadelphia, 1992, Revised version in ILPS Workshop on Implementation Techniques for Logic Programming Languages, 1994.
6. P. Brisset, O. Ridoux, The compilation of λProlog and its execution with MALI, Publication Interne 687, IRISA, 1992.
7. P. Brisset, O. Ridoux, Naïve reverse can be linear, in: K. Furukawa (Ed.), 8th Int. Conf. Logic Programming, MIT Press, 1991, pp. 857-870.
8. A. Church, A formulation of the simple theory of types, J. Symbolic Logic 5 (1) (1940) 56-68.
9. J. Cohen, Constraint logic programming languages, CACM 33 (7) (1990) 52-68.
10. B. Coüasnon, P. Brisset, I. Stéphan, Using logic programming languages for optical music recognition, in: A. Marien (Ed.), Third Conf., The Practical Application of Prolog, Alinmead Software Ltd, Paris, France, 1995, pp. 115-134.
11. M. Dalrymple, S.M. Shieber, F.C.N. Pereira, Ellipsis and higher-order unification, Linguistics and Philosophy 14 (1991) 399-452.
12. 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 34 (1972) 381-392.
13. C.M. Elliott, Higher-order unification with dependent function types, in: N. Derschowitz (Ed.), Third Int. Conf. Rewriting Techniques and Applications, LNCS 355, Springer, Berlin, 1989, pp. 121-136.
14. C.M. Elliott, F. Pfenning, A semi-functional implementation of a higher-order logic programming language, in: P. Lee (Ed.), Topics in Advanced Language Implementation, MIT Press, 1991, pp. 289-325.
15. A. Felty, Implementing tactics and tacticals in a higher-order logic programming language, J. Automated Reasoning 11 (1) (1993) 43-81.
16. A. Felty, Specifying and implementing theorem provers in a higher-order logic programming language. Ph.D. Dissertation, Dept. of Computer and Information Science, University of Pennsylvania, 1989.
17. J.H. Gallier, Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper and Row, 1986.
18. J.-Y. Girard, Linear logic, Theoretical Computer Science 50 (1987) 1-102.
19. M. Hagiya, Synthesis of rewrite programs by higher-order and semantic unification, New Generation Computing 8 (4) (1991) 403-420.
20. J. Hannan, Extended natural semantics, J. Functional Programming 3 (2) (1993) 123-152.
21. J. Hannan, D. Miller, From operational semantics to abstract machines, Mathematical Structures in Computer Science 4 (2) (1992) 415-459.
22. R. Harrop, Concerning formulas of the types A→BVC, A→(Ex)B(x) in intuitionistic formal systems, J. Symbolic Logic 25 (1) (1960) 23-27.
23. J.S. Hodas, D.A. Miller, Logic programming in a fragment of intuitionistic linear logic, Information and Computation 110 (2) (1994) 327-365.
24. A. Horn, On sentences which are true of direct unions of algebras, J. Symbolic Logic 16 (1) (1951).
25. W.A. Howard, The formulae-as-types notion of construction, in: J.P. Seldin, J.R. Hindley (Eds.), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London, 1980, pp. 479-490.
26. G. Huet, A unification algorithm for typed λ-calculus, Theoretical Computer Science 1 (1975) 27-57.
27. T.K. Lakshman, U.S. Reddy, Typed Prolog: a semantic reconstruction of the Mycroft-O'Keefe type system, in: V. Saraswat, K. Ueda (Eds.), Eighth Int. Logic Programming Symp., MIT Press, 1991, pp. 202-217.
28. S. Le Huitouze, P. Louvet, O. Ridoux, Logic grammars and λProlog, in: D.S. Warren (Ed.), 10th Int. Conf. Logic Programming, MIT Press, 1993, pp. 64-79.
29. C.C. Liang, Object-level Substitution, Unification and Generalization in Meta-Logic, Ph.D. Thesis, University of Pennsylvania, Department of Computer and Information Science, 1995.
30. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
31. D. Miller, A multiple-conclusion meta-logic, in: Symp. Logic in Computer Science, 1994, pp. 272-281.
32. D.A. Miller, Abstract syntax and logic programming, in: A. Voronkov (Ed.), Second Russian Conf. Logic Programming, LNCS 592, Springer, Berlin, 1991.
33. D.A. Miller, Lexical scoping as universal quantification, in: G. Levi, M. Martelli (Eds.), 6th Int. Conf. Logic Programming, MIT Press, 1989, pp. 268-283.
34. D.A. Miller, A logic programming language with lambda-abstraction, function variables, and simple unification, in: P. Schroeder-Heister (Ed.), Int. Workshop on Extensions of Logic Programming, LNAI 475, Springer, New York, 1989; Also in J. Logic and Computation 1 (4) (1991) 497-536.
35. D.A. Miller, A logic programming language with lambda-abstraction, function variables, and simple unification, in: P. Schroeder-Heister (Ed.), Int. Workshop on Extensions of Logic Programming, LNAI 475, Springer, New York, 1989; Also in J. Logic and Computation 1 (4) (1991) 497-536.
36. D.A. Miller, A logical analysis of modules in logic programming, J. Logic Programming 6 (1/2) (1989) 79-108.
37. D.A. Miller, A proposal for modules in λProlog, in: R. Dyckhoff (Ed.), Int. Workshop Extensions of Logic Programming, LNAI 798, Springer, 1993, pp. 206-221.
38. D.A. Miller, A theory of modules for logic programming, in: Symp. Logic Programming, Salt Lake City, UT, USA, 1986, pp. 106-115.
39. D.A. Miller, Unification of simply typed lambda-terms as logic programming, in: K. Furukawa (Ed.), Eighth Int. Conf. Logic Programming, MIT Press, 1991, pp. 255-269.
40. D.A. Miller, Unification under a mixed prefix, J. Symbolic Computation 14 (1992) 321-358.
41. D.A. Miller, G. Nadathur, Higher-order logic programming, in: E. Shapiro (Ed.), Third Int. Conf. Logic Programming, LNCS 225, Springer, 1986, pp. 448-462.
42. D.A. Miller, G. Nadathur, A logic programming approach to manipulating formulas and programs, in: S. Haridi (Ed.), IEEE Symp. Logic Programming, San Francisco, CA, USA, 1987, pp. 379-388.
43. D.A. Miller, G. Nadathur, F. Pfenning, A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51 (1991) 125-157, Revised version of Ref. [43].
44. D.A. Miller, G. Nadathur, A. Scedrov, Hereditary Harrop formulas and uniform proof systems, in: D. Gries (Ed.), Second Symp. Logic in Computer Science, Ithaca, NY, 1987, pp. 98-105.
45. R. Milner, A theory of type polymorphism in programming, J. Computer and System Sciences 17 (1978) 348-375.
46. R. Montague, The proper treatment of quantification in ordinary English, in: R.M. Thomason (Ed.), Formal Philosophy, Yale University Press, New Haven, CO, 1974.
47. G. Nadathur, A higher-order logic as the basis for logic programming, Ph.D. Thesis, University of Pennsylvania, 1987.
48. G. Nadathur, D.A. Miller, Higher-order Horn clauses, JACM 37 (4) (1990) 777-814.
49. G. Nadathur, D.A. Miller, An overview of λProlog, in: K. Bowen, R. Kowalski (Eds.), Symp. Logic Programming, Seattle, WA, 1988, pp. 810-827.
50. L. Naish, Negation and Control in Prolog, LNCS 238, Springer, Berlin, 1986.
51. T. Nicholson, N. Foo, A denotational semantics for Prolog, ACM Trans, Programming Languages and Systems 11 (4) (1989) 650-665.
52. S.-H. Nienhuys-Cheng, R. de Wolf, Foundations of Inductive Logic programming, LNAI 1228, Springer, Berlin, 1997.
53. R. Pareschi, D.A. Miller, Extending definite clause grammars with scoping constructs, in: D.H.D. Warren, P. Szeredi (Eds.), Seventh Int. Conf. Logic Programming, MIT Press, 1990, pp. 373-389.
54. C.S. Peirce, in: C. Hartshorne, P. Weiss (Eds.), Collected Papers of Charles Saunders Peirce, 2nd ed., Harvard University Press, 1960.
55. F. Pfenning, Unification and anti-unification in the calculus of constructions, in: Symp. Logic in Computer Science, 1991, pp. 74-85.
56. B. Pierce, S. Dietzen, S. Michaylov, Programming in higher-order typed lambda-calculi, Research Report CMU-CS-89-111, School of Computer Science, Carnegie Mellon University, 1989.
57. O. Ridoux, Engineering transformations of attributed grammars in λProlog, in: M. Maher (Ed.), Joint Int. Conf. and Symp. Logic Programming, MIT Press, 1996, pp. 244-258.
58. αβ), in: A. Podelski (Ed.), Constraint Programming: Basics and Trends, Selected papers of the 22nd Spring School in Theoretical Computer Science, LNCS 910, Springer, Châtillon/Seine, France, 1995, pp. 209-230.
59. L. Sterling, E. Shapiro, The Art of Prolog, 1st ed., MIT Press, 1986.
60. S.-Å. Tärnlund, Horn clause computability, BIT 17 (1977) 215-226.