Paper Info
Title
Generic proofs for combinator-based generic programs.
Abstract
Generic programming can bring important benefits to software engi- neering. In particular, it reduces the burden of verification, since generic proofs can be instantiated at many types. Reasoning about programs that use type classes does not enjoy the benefits of generic reasoning, as it requires providing proofs for an arbitrary number of type instances. This makes the process very impracti- cal. We describe a useful method to reason about a class of programs that use type classes, based on the idea that generic functions implemented using overloading can also be expressed polytypically. We demonstrate the method on functions from the 'scrap-your-boilerplate' library, a collection of combinators for generic programming that has been proposed and implemented recently.
Year
Venue
Keywords
2004
Trends In Functional Programming
software engineering,generating function,generic programming
Field
DocType
Citations 
Programming language,Combinatory logic,Computer science,Theoretical computer science,Mathematical proof
Conference
9
PageRank 
References 
Authors
0.95
2
1
Name
Order
Citations
PageRank
Fermín Reig1141.77