Algebraic approaches to program semantics
Algebraic approaches to program semantics
Notions of computation and monads
Information and Computation
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Algebra of programming
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Advanced Functional Programming, Second International School-Tutorial Text
CSL '92 Selected Papers from the Workshop on Computer Science Logic
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Implementing collection classes with monads
Mathematical Structures in Computer Science
Algebra of Program Termination
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Algebra of program termination
Algebraic and coalgebraic methods in the mathematics of program construction
Ideal models for pointwise relational and state-free imperative programming
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Journal of Functional Programming
Containers: constructing strictly positive types
Theoretical Computer Science - Applied semantics: Selected topics
Meeting a fanclub: a lattice of generic shape selectors
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Formal polytypic programs and proofs
Journal of Functional Programming
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
A datastructure for iterated powers
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A program derivation is said to be polytypic if some of its parameters are data types. Often these data types are container types, whose elements store data. Polytypic program derivations necessitate a general, non-inductive definition of ‘container (data) type’. Here we propose such a definition: a container type is a relator that has membership. It is shown how this definition implies various other properties that are shared by all container types. In particular, all container types have a unique strength, and all natural transformations between container types are strong.