Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Subject "deduction"

Now showing items 1-2 of 2

    • Simplifying transformations for type-alpha certificates 

      Arkoudas, Konstantine (2001-11-13)
      This paper presents an algorithm for simplifying NDL deductions. An array of simplifying transformations are rigorously defined. They are shown to be terminating, and to respect the formal semantis of the language. We also ...

    • Type-omega DPLs 

      Arkoudas, Konstantine (2001-10-16)
      Type-omega DPLs (Denotational Proof Languages) are languages for proof presentation and search that offer strong soundness guarantees. LCF-type systems such as HOL offer similar guarantees, but their soundness relies heavily ...