Various formal systems based on that invented by Church to formalise the properties of functions acting on arguments and being combined to form other functions. This involves “lambda-abstraction”. The function f given by
$$ f(x)\; = \;x\; + \;1 $$
can be written using lambda-abstraction as
$$ f\; = \;{\rm{\lambda }}x.x\; + \;1 $$
so that
$$ f(1)\; = \;({\rm{\lambda }}x.x\; + \;1)(1)\; = \;2 $$
Application is written as juxtaposition, eg. fx for f(x). Terms made up using application and lambda abstraction can be manipulated in various ways, eg. rename bound variables (alpha conversion), and rewrite (λx.fx)a as fa (beta reduction).


Logic Program Logic Programming Lexical Access Vocal Tract Solution Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Hindley, J.R. and Seidin, J.P. Introduction to combinators and the lambda-calculus. Cambridge University Press, Cambridge, England, 1986.Google Scholar
  2. Barendregt, H.P. The lambda calculus, its syntax and semantics, revised edition. North-Holland, Amsterdam and Oxford, 1984MATHGoogle Scholar
  3. Marr, D. Vision: a computational investigaion into the human representation and processing of visual information. W.H. Freeman, New York, 1982.Google Scholar
  4. Peyton Jones, S.L. The Implementation of Functional Programming Languages. Prentice Hall, Englewood Cliffs, London, 1987.MATHGoogle Scholar
  5. Sleeman, D., Langley, P. and Mitchell, T.M. Learning from Solution paths: an approach to the credit assignment problem. AI Magazine, 3(2):48–52, 1982Google Scholar
  6. Kay, M. Morphological and syntactic analysis. In A. Zampolli, editor, Linguistic Structures Processing, pages 131–234 North Holland, Amsterdam and Oxford, 1977.Google Scholar
  7. Kaplan, R.M. and Kay, M. Word recognition. Technical Report, Xerox Palo Alto Research Center, 1982.Google Scholar
  8. J. Carbonell. A computational model of analogical problem solving. In Proceedings IJCAI-81, pages 147–152. International Joint Conference on Artificial Intelligence, 1981.Google Scholar
  9. Clowes, M.B. On seeing things. Artificial Intelligence, 2:79–116, 1971.CrossRefGoogle Scholar
  10. Winston, P.H. and Horn, B.K.P. LISP. First Edition, Addison-Wesley, Reading, Mass., 1981.MATHGoogle Scholar
  11. Wilensky, R. LISP craft. W.W. Norton and Company, New York and London, 1984.Google Scholar
  12. Steele, G.L. Jr. Common Lisp. Digital Press, Burlington, 1984.Google Scholar
  13. Winston, P.H. and Horn, B.K.P. LISP. Second Edition, Addison-Wesley, Reading, Mass., 1984.Google Scholar
  14. Serra, J. Image Analysis and Mathematical Morphology. Academic Press, London, 1982.MATHGoogle Scholar
  15. Baibin, I. and Lecot, K. Logic Programming: A Classified Bibliography. Wildgrass Books, Fitzroy, Australia, 1985.Google Scholar
  16. Hogger, C. Introduction to Logic Programming. Academic Press, London, 1984.MATHGoogle Scholar
  17. Moore, R.C. A formal theory of knowledge and action. In J.R. Hobbs and R.C. Moore, editors, Formal theories ofthe commonsense world, Ablex Pub. Corp., Norwood, 1985.Google Scholar
  18. Konolige, K. A first order formulation of knowledge and action in a multi-agent planning system. In J.E. Hayes, D. Michie and Pao, editors, Machine Intelligence 10. Artificial Intelligence Center, SRI International, Menlo Park, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Alan Bundy
    • 1
  1. 1.Department of Artificial IntelligenceUniversity of EdinburghEdinburghScotland, UK

Personalised recommendations