Sökning: "coinductive"
Hittade 3 avhandlingar innehållade ordet coinductive.
1. Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them
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
2. Theory Exploration for Programs and Proofs
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
3. Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction
Sammanfattning : This thesis discusses intuitionistic least and greatest fixedpoint logics, i.e., intuitionistic systems of logic with primitive predicate-valued operators on predicate transformers that send monotone predicate transformers to their least and greatest fixedpoints, predicates being quasiordered by inclusion. LÄS MER