Theorem Proving in Higher Order Logics

DOI10.1007/11541868zbMath1152.68521OpenAlexW2484880499MaRDI QIDQ5477652

No author found.

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

Related Items

A Purely Definitional Universal Domain ⋮ Imperative Functional Programming with Isabelle/HOL ⋮ Secure Microkernels, State Monads and Scalable Refinement ⋮ First-Class Type Classes ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Effect polymorphism in higher-order logic (proof pearl)

Uses Software

• Isabelle
• Isabelle/HOL