PolyP—a polytypic programming language extension. Many functions have to be written over and over again for different datatypes, either because datatypes change during the development of programs, or because functions with similar functionality are needed on different datatypes. Examples of such functions are pretty printers, debuggers, equality functions, unifiers, pattern matchers, rewriting functions, etc. Such functions are called polytypic functions. A polytypic function is a function that is defined by induction on the structure of user-defined datatypes. This paper extends a functional language (a subset of Haskell) with a construct for writing polytypic functions. The extended language type checks definitions of polytypic functions, and infers the types of all other expressions using an extension of Jones’ theories of qualified types and higher-order polymorphism. The semantics of the programs in the extended language is obtained by adding type arguments to functions in a dictionary passing style. ...

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 24 articles )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Lee, Gyesik; Oliveira, Bruno C.D.S.; Cho, Sungkeun; Yi, Kwangkeun: GMeta: a generic formal metatheory framework for first-order representations (2012)
  2. Cunha, Alcino; Visser, Joost: Transformation of structure-shy programs with application to XPath queries and strategic functions (2011)
  3. Chadwick, Bryan; Lieberherr, Karl: A functional approach to generic programming using adaptive traversals (2010)
  4. Frisby, Nicolas; Kimmell, Garrin; Weaver, Philip; Alexander, Perry: Constructing language processors with algebra combinators (2010)
  5. Johann, Patricia; Ghani, Neil: A principled approach to programming with nested types in Haskell (2010)
  6. Abel, Andreas: Type-based termination of generic programs (2009)
  7. Bove, Ana; Dybjer, Peter: Dependent types at work (2009)
  8. Hinze, Ralf; Löh, Andres: Generic programming in 3D (2009)
  9. Jay, Barry: Pattern calculus. Computing with functions and structures (2009)
  10. Morris, Peter; Altenkirch, Thorsten; Ghani, Neil: A universe of strictly positive families (2009)
  11. Backhouse, Roland; Doornbos, Henk: Datatype-generic termination proofs (2008)
  12. Bringert, Björn; Ranta, Aarne: A pattern for almost compositional functions (2006)
  13. Abel, Andreas; Matthes, Ralph; Uustalu, Tarmo: Iteration and coiteration schemes for higher-order and nested datatypes (2005)
  14. Weirich, Stephanie; Huang, Liang: A design for type-directed programming in Java (2005)
  15. Norell, Ulf; Jansson, Patrik: Prototyping generic programming in Template Haskell (2004)
  16. Winter, Victor L.; Subramaniam, Mahadevan: The transient combinator, higher-order strategies, and the distributed data problem (2004)
  17. Yang, Zhe: Encoding types in ML-like languages (2004)
  18. Altenkirch, Thorsten; McBride, Conor: Generic programming within dependently typed programming (2003)
  19. Benke, Marcin; Dybjer, Peter; Jansson, Patrik: Universes for generic programs and proofs in dependent type theory (2003)
  20. Alimarine, Artem; Plasmeijer, Rinus: A generic programming extension for Clean (2002)

1 2 next