Introduction to higher order categorical logic
Introduction to higher order categorical logic
Categories of partial morphisms and the λp-calculus
Proceedings of a tutorial and workshop on Category theory and computer programming
Abstract and concrete categories
Abstract and concrete categories
HASCASL: Towards Integrated Specification and Development of Functional Programs
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Broader Class of Trees for Recursive Type Definitions for HOL
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Strongly typed heterogeneous collections
Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Categorical models for Abadi and Plotkin's logic for parametricity
Mathematical Structures in Computer Science
Monad-independent Dynamic Logic in HasCasl
Journal of Logic and Computation
The HASCASL prologue: categorical syntax and semantics of the partial λ-calculus
Theoretical Computer Science
Monad-independent Hoare logic in HasCasl
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
The heterogeneous tool set, HETS
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Type class polymorphism in an institutional framework
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
| Hi-index | 0.00 |
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 decribe 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 generalizing corresponding results from topos theory.