LAMBDA-CALCULI FOR INTUITIONISTIC AND CLASSICAL PROOFS
This chapter provides an explanation of natural deduction proof systems and their corresponding lambda-calculi. Beginning with the necessary basics of natural deduction systems for intuitionistic logic and the simply-typed lambda-calculus, the lambda-mu-calculus is then presented, giving both the basic definitions and essential meta-theory, before proceeding with a discussion of the addition of disjunction to lambda-mu.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.