Search for dissertations about: "inductive and coinductive types"
Found 2 swedish dissertations containing the words inductive and coinductive types.
-
1. Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them
Abstract : 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. READ MORE
-
2. Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction
Abstract : 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. READ MORE