1 / 3

Denotational Proof Languages (DPLs)

Denotational Proof Languages (DPLs). DPLs are languages for writing proofs and proof tactics in arbitrary logics Novel syntax and semantics (based on the abstraction on assumption bases ) ensure: Readability and writability Efficient proof checking Guaranteed soundness

liseli
Download Presentation

Denotational Proof Languages (DPLs)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Denotational Proof Languages (DPLs) • DPLs are languages for writing proofs and proof tactics in arbitrary logics • Novel syntax and semantics (based on the abstraction on assumption bases) ensure: • Readability and writability • Efficient proof checking • Guaranteed soundness • Powerful mechanisms for expressing complex proof tactics and tacticals

  2. Wide applicability • DPLs have been designed and implemented for: • Classical logics (both first- and higher-order) • Intuitionist logics • Modal and temporal logics • Program logics (Hoare-Floyd logics) • Type systems

  3. Athena • A DPL for classical first-order logic • Uses natural deduction • Incorporates a higher-order functional programming language with algebraic data types • Supports induction, recursion, pattern matching • Other logics (e.g. modal logic) can be rapidly prototyped by implementing them on top of Athena

More Related