Theorem Proving in Higher Order Logics

DOI10.1007/11541868zbMATH Open1152.68464OpenAlexW2484880499MaRDI QIDQ5477644FDOQ5477644

Andrew M. Pitts

Publication date: 6 July 2006

Full work available at URL: https://doi.org/10.1007/11541868

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cited In (3)

• Induction-recursion and initial algebras.
• Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations
• Alpha-structural recursion and induction

   Recommendations

• Alpha-structural recursion and induction 👍 👎
• Alpha-structural induction and recursion for the lambda calculus in constructive type theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Induction-recursion and initial algebras. 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Towards an algebraic theory of recursion 👍 👎
• Structures for structural recursion 👍 👎
• Recursion-Theoretic Hierarchies 👍 👎

This page was built for publication: Theorem Proving in Higher Order Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477644)