Higher-order positive set constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2471, Issue , 2002, Pages 473-489

  Goubault Larrecq, Jean ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED DEDUCTION; FIRST ORDER; HIGHER-ORDER; LAMBDA TERMS; ORDERED RESOLUTION; PUSHDOWN PROCESS; SATISFIABILITY; SET CONSTRAINTS;

COMPUTER CIRCUITS;

EID: 84947786510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_32     Document Type: Conference Paper

References (23)

1. [1] A. Aiken, Dexter Kozen, Moshe Vardi, and E. L. Wimmers. The complexity of set constraints. In CSL’93, pages 1–17. Springer-Verlag LNCS 832, 1993.
2. [2] Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth through Proof. Computer Science and Applied Mathematics. Academic Press, 1986.
3. [3] Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Set constraints are the monadic class. In LICS’93, pages 75–83. IEEE Computer Society Press, 1993.
4. [4] Henk Barendregt. The Lambda Calculus, Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984.
5. [5] Bruno Bogaert and Sophie Tison. Equality and disequality constraints on direct subterms in tree automata. In Alain Finkel and Matthias Jantzen, editors, STACS’92, pages 161–172. Springer Verlag LNCS 577, 1992.
6. [6] Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Proving. Computer Science Classics. Academic Press, 1973.
7. [7] Witold Charatonik. Set constraints in some equational theories. Inf. and Computation, 142(1):40–75, 1998.
8. [8] Witold Charatonik and Andreas Podelski. Set constraints with intersection. In Glynn Winskel, editor, LICS’97, pages 362–372, 1997.
9. [9] Hubert Comon and Yan Jurski. Higher-order matching and tree automata. In M. Nielsen and W. Thomas, editors, CSL’97, pages 157–176. Springer-Verlag LNCS 1414, 1997.
10. 10] Christian Fermüller, Alexander Leitsch, Ulrich Hustadt, and Tamel Tammet. Resolution Decision Procedures, chapter 25, pages 1791–1849. Volume II of Robinson and Voronkov [22], 2001.
11. [11] Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer Verlag, 1990.
12. [12] Thom Frühwirth, Ehud Shapiro, Moshe Y. Vardi, and Eyal Yardeni. Logic programs as types for logic programs. In LICS’91, 1991.
13. [13] Ferenc Gécseg and Magnus Steinby. Tree languages. In Grzegorz Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1–68. Springer Verlag, 1997.
14. [14] Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types, volume 7. Cambridge University Press, 1989.
15. [15] Jean Goubault-Larrecq and Kumar Neeraj Verma. Alternating two-way AC-tree automata. Submitted, 2002.
16. [16] Gérard P. Huet. A unification algorithm for typed λ-calculus. TCS, 1:27–57, 1975.
17. [17] William H. Joyner Jr. Resolution strategies as decision procedures. J. ACM, 23(3):398–417, 1976.
18. [18] Harry R. Lewis. Complexity results for classes of quantificational formulas. J. Comp. Sys. Sciences, 21:317–353, 1980
19. [19] Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1(4):497–536, 1991.
20. [20] Gopalan Nadathur and Dale Miller. An overview of λ-Prolog. In R. Kowalski and K. Bowen, editors, 5th Intl. Conf. Logic Programming, pages 810–827. MIT Press, 1988.
21. [21] Leszek Pacholski and Andreas Podelski. Set constraints—a pearl in research on constraints. In Gert Smolka, editor, CP’97. Springer Verlag LNCS 1330, 1997.
22. [22] J. Alan Robinson and Andrei Voronkov, editors. Handbook of Automated Reasoning. North-Holland, 2001.
23. [23] Wayne Snyder and Jean Gallier. Higher order unification revisited: Complete sets of tranformations. J. Symb. Comp., 8(1 & 2):101–140, 1989.