Sökning: "equational reasoning"

Hittade 4 avhandlingar innehållade orden equational reasoning.

  1. 1. Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them

    Författare :Nils Anders Danielsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; partial; inductive; coinductive; non-strict; equational reasoning; lifted; infinite; functional programming;

    Sammanfattning : This thesis consists of two parts. Both concern reasoning about non-strict functional programming languages with partial and infinite values and lifted types, including lifted function spaces.The first part is a case study in program verification: We have written a simple parser and a corresponding pretty-printer in Haskell. LÄS MER

  3. 2. Theory Exploration for Programs and Proofs

    Författare :Sólrún Einarsdóttir; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Theorem Proving; Automated Reasoning; Theory Exploration; Property-Based Testing; Functional Programming; Conjecture Generation; Artificial Intelligence; Coinduction;

    Sammanfattning : We have built two theory exploration systems, Cohipster and RoughSpec . Theory exploration is a method of automatically conjecturing properties about the functions and structures that appear in a computer program or a formalization of a mathematical theory. LÄS MER

  4. 3. Call-by-name, Call-by-need, and McCarthy's Amb

    Författare :Andrew Keith Moran; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This dissertation examines the behaviour of McCarthy's amb in both a call-by-name and call-by-need context. Instead of following the usual denotational approach, we choose to explore the operational alternative. The languages involved are higher-order, and contain algebraic datatypes. LÄS MER

  5. 4. Lightweight verification of functional programs

    Författare :Nicholas Smallbone; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We have built several tools to help with testing and verifying functional programs. All three tools are based on QuickCheck properties. Our goal is to allow programmers to do more with QuickCheck properties than just test them. LÄS MER