Arity-generic datatype-generic programming

Authors:
Stephanie Weirich;Chris Casinghino
Affiliations:
University of Pennsylvania, Philadelphia, PA, USA;University of Pennsylvania, Philadelphia, PA, USA
Venue:
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Year:
2010

Citing 20
Cited 6

Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Type checking with universes

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Generic Programming within Dependently Typed Programming

Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming
Do we need dependent types?

Journal of Functional Programming
The view from the left

Journal of Functional Programming
Bibliography

Journal of Functional Programming
Faking it Simulating dependent types in Haskell

Journal of Functional Programming
Universes for generic programs and proofs in dependent type theory

Nordic Journal of Computing
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Putting curry-howard to work

Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Simple unification-based type inference for GADTs

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
RepLib: a library for derivable type classes

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Generics for the masses

Journal of Functional Programming
Type-safe run-time polytypic programming

Journal of Functional Programming
A certified type-preserving compiler from lambda calculus to assembly language

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Constructing strictly positive families

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Applicative programming with effects

Journal of Functional Programming
Polytypic programming in COQ

Proceedings of the ACM SIGPLAN workshop on Generic programming
Polytypic properties and proofs in Coq

Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Generic programming in Ωmega

SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming

The gentle art of levitation

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Generic programming with indexed functors

Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
The right kind of generic programming

Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Generic programming with dependent types

SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Leveling up dependent types: generic programming over a predicative hierarchy of universes

Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming
Closed type families with overlapping equations

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some programs are doubly-generic. For example, map is datatype-generic in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments. For lists, this family includes repeat, map, zipWith, zipWith3, zipWith4, etc. With dependent types or clever programming, one can unify all of these functions together in a single definition. However, no one has explored the combination of these two forms of genericity. These two axes are not orthogonal because the idea of arity appears in Generic Haskell: datatype-generic versions of repeat, map and zipWith have different arities of kind-indexed types. In this paper, we define arity-generic datatype-generic programs by building a framework for Generic Haskell-style generic programming in the dependently-typed programming language Agda 2.