A colored version of the λ-calculus

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

Volumn 1249, Issue , 1997, Pages 291-305

  Hutter, Dieter ^a   Kohlhase, Michael ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CALCULATIONS; COLOR; SEMANTICS; THEOREM PROVING;

FORMALISATION; GOAL-ORIENTED; HIGHER-ORDER UNIFICATION; INDUCTIVE THEOREM PROVING; LAMBDA CALCULUS; NATURAL LANGUAGE SEMANTICS; PATTERN UNIFICATION; SIMPLY TYPED LAMBDA CALCULUS;

DIFFERENTIATION (CALCULUS);

EID: 35048867096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_30     Document Type: Conference Paper

References (19)

1. +93] A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: a heuristic for guiding inductive proofs. AI, 62:185-253, 1993.
2. [Bun88] A. Bundy. The use of explicit plans to guide inductive proofs. 9th CADE, Springer, LNCS 310, Argonne, Illinois, USA, 1988.
3. [CH94] J. Cleve and D. Hutter. A methodology for equational reasoning. Hawaii International Conference on System Sciences 27 Volume III, IEEE Computer Society Press, 1994.
4. [Chu40] Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
5. [Dig81] Vincent J. Digricoli. The efficacy of RUE resolution, experimental results and heuristic theory. In Ann Drinan, editor, 7th ICJA7,Vancouver, Canada, Morgan Kaufmann, 1981.
6. [Dow92] Gilles Dowek. Third order matching is decidable. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS-7), pages 2- 10. IEEE Computer Society Press, 1992.
7. [GK96] Claire Gaxdent and Michael Kohlhase. Higher-order coloured unification and natural language semantics. Proceedings ACI96, Santa Cruz 1996.
8. [Gar] Claire Gardent. Sloppy identity. Proceedings LACI96, Springer Verlag forthcoming.
9. [Hes91] Jane Hesketh. Using Middle-Out Reasoning to Guide Induction. PhD thesis, University of Edinburgh, 1991.
10. [HK95] Dieter Hutter and Michael Kohlhase. A colored version of the lambda calculus. Seki-95-05, University of Saarland, Saarbruecken, Germany, 1995.
11. [Hut90] Dieter Hutter. Guiding induction proofs. 10th CADE, Springer, LNCS 449, Kaiserslautern, Germany, 1990.
12. [Hut96] Dieter Hutter. Using rippling for equational reasoning. 20. Jahrestagung Künstliche Intelligenz, Springer LNAI 1137, Dresden, Germany, 1996.
13. [IB96] Andrew Ireland and Alan Bundy. Productive use of failure in inductive proof. Special Issue of the Journal of Automated Reasoning, 16(1/2), 1996.
14. [Kra94] Ina Kraan. Proof Planning for Logic Program Synthesis. PhD thesis, University of Edinburgh, 1994.
15. [Mil92] Dale Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14:321-358, 1992.
16. [Mon74] R. Montague. The proper treatment of quantification in ordinary english. In R. Montague, editor, Formal Philosophy. Selected Papers. Yale University Press, New Haven, 1974.
17. [Mor69] James B. Morris. E-resolution: Extension of resolution to include the equality relation. 1st IJCAI, 1969
18. [SG96] A. Smaill and I. Green. Higher-order annotated terms for proof search. TPHOLs '96, 1996
19. [WNB92] Toby Walsh, A. Nunes, and Alan Bundy. The use of proof plans to sum series. 11th CADE, Saratoga Spings, USA, Springer LNCS 607, 1992.