Skip to main content Accessibility help
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 1 - Introduction

  • Dale Miller, INRIA Saclay-Île-de-France
  • Book:
    Proof Theory and Logic Programming
    Published online:
    01 December 2025
    Print publication:
    18 December 2025, pp 1-8

  • Summary

    This chapter introduces the idea that computation can be viewed and reasoned about through the lens of proof theory. It highlights the historical context of defining computation, noting the equivalence of formal systems like lambda-calculus and Turing machines. The chapter discusses the benefits of using logic to specify computations, emphasizing the universally accepted descriptions of logics, which can ensure the precision of meaning for logic programs. It also outlines the book’s structure, dividing it into two parts: the first covering the proof-theoretic foundations of logic programming languages, and the second exploring their applications. The chapter concludes with bibliographic notes.