%0 Report %T A Proof-theoretic approach to logic programming %+ Compilation, Programmation en Logique, Environnements Axe Compilation (ChLoƉ-Compilation) %A Suarez, Miguel %Z Projet CHLOE %N RR-1818 %I INRIA %8 1992 %D 1992 %Z Computer Science [cs]/Other [cs.OH]Reports %X We develop the foundations of Horn clause logic programming in a proof-theoretic style. We present a formal unification system for first order terms including a syntactic representation of environments and formalisms for the bottom-up and top down computation of answers in a unified formal setting. In passing, we propose an abstrac unification machine. We also discuss the possibility and implications of representing logic program evaluation strategies in the lambda calculus. %G English %2 https://inria.hal.science/inria-00074854/document %2 https://inria.hal.science/inria-00074854/file/RR-1818.pdf %L inria-00074854 %U https://inria.hal.science/inria-00074854 %~ INRIA %~ INRIA-ROCQ %~ INRIA-RRRT %~ TESTALAIN1 %~ INRIA2 %~ LARA