Datatype-Generic reasoning

Authors:
Roland Backhouse
Affiliations:
School of Computer Science and Information Technology, University of Nottingham, Nottingham, England
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 14
Cited 0

Data structures and program transformation

Science of Computer Programming
Theorems for free!

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Reductivity

Science of Computer Programming - Special issue on mathematics of program construction
Algebra of programming

Algebra of programming
A calculational approach to mathematical induction

Theoretical Computer Science
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Polynomial Relators (Extended Abstract)

AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Polytypic Programming

Advanced Functional Programming, Second International School-Tutorial Text
Induction and Recursion on Datatypes

MPC '95 Mathematics of Program Construction
Dependency-style generic haskell

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Container types categorically

Journal of Functional Programming
Polytypic unification

Journal of Functional Programming
Type-indexed data types

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review the allegorical foundations of a methodology of designing datatype-generic programs. The effectiveness of the methodology is demonstrated by an extraordinarily concise proof of the well-foundedness of a datatype-generic occurs-in relation.