Computer Science – Logic in Computer Science
Scientific paper
2008-12-19
LMCS 4 (4:17) 2008
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-4(4:17)2008
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatypes and process types arise as bootstrapped concepts using HasCASL's type class mechanism, and we describe constructions of types of finite and infinite trees that establish the conservativity of datatype and process type declarations adhering to certain reasonable formats. The latter amounts to modifying known constructions from HOL to avoid unique choice; in categorical terminology, this means that we establish that quasitoposes with an internal natural numbers object support initial algebras and final coalgebras for a range of polynomial functors, thereby partially generalising corresponding results from topos theory. Moreover, we present similar constructions in categories of internal complete partial orders in quasitoposes.
No associations
LandOfFree
Bootstrapping Inductive and Coinductive Types in HasCASL does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bootstrapping Inductive and Coinductive Types in HasCASL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bootstrapping Inductive and Coinductive Types in HasCASL will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-727190