Theorem Proving in Higher Order Logics

DOI10.1007/11541868MaRDI QIDQ5477670zbMATH OpenOpenAlexFDO

Authors Michael Norrish, Konrad Slind

Publication date 6 July 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recommendations

• Proof Pearl: Looping Around the Orbit
• Mechanized metatheory revisited
• Binding structures as an abstract data type
• The locally nameless representation
• Nominal techniques in Isabelle/HOL

Cited in

(2)

• Proof Pearl: Looping Around the Orbit
• THEORETICAL PEARLS

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 Q5477670)