• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Type-Indexed Data Types (2004)

Cached

  • Download as a PDF

Download Links

  • [www.cs.uu.nl]
  • [www.cs.bonn.edu]
  • [www.informatik.uni-bonn.de]
  • [www.cs.bonn.edu]
  • [www.informatik.uni-bonn.de]
  • [archive.cs.uu.nl]
  • [www.cs.uu.nl]
  • [www.cs.uu.nl]
  • [people.cs.uu.nl]
  • [www.cs.uu.nl]
  • [www.cs.nott.ac.uk]
  • [www.cs.uu.nl]
  • [www.cs.bonn.edu]
  • [www.informatik.uni-bonn.de]

    • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ralf Hinze , Johan Jeuring , Andres Löh
Venue:SCIENCE OF COMPUTER PROGRAMMING
Citations:53 - 19 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3
  • Version 4

Version History

Metadata Version 4

User correction supplied by mph

DatumValueSource
TITLE Type-Indexed Data Types user correction - Legacy Corrections
AUTHOR NAME Ralf Hinze user correction
AUTHOR AFFIL Institut für Informatik III, Universität Bonn user correction
AUTHOR ADDR Römerstraße 164, 53117 Bonn, Germany user correction
AUTHOR NAME Johan Jeuring user correction
AUTHOR AFFIL Institut für Informatik III, Universität Bonn user correction
AUTHOR ADDR Römerstraße 164, 53117 Bonn, Germany user correction
AUTHOR NAME Andres Löh user correction
AUTHOR AFFIL user correction
AUTHOR ADDR user correction
ABSTRACT A polytypic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of polytypic functions are the functions that can be derived in Haskell, such as show , read , and ` '. More advanced examples are functions for digital searching, pattern matching, unification, rewriting, and structure editing. For each of these problems, we not only have to define polytypic functionality, but also a type-indexed data type: a data type that is constructed in a generic way from an argument data type. For example, in the case of digital searching we have to define a search tree type by induction on the structure of the type of search keys. This paper shows how to define type-indexed data types, discusses several examples of type-indexed data types, and shows how to specialize type-indexed data types. The approach has been implemented in Generic Haskell, a generic programming extension of the functional language Haskell. user correction - Legacy Corrections
YEAR 2004 user correction - Legacy Corrections
VENUE SCIENCE OF COMPUTER PROGRAMMING user correction
VENUE TYPE CONFERENCE INFERENCE
PAGES 148--174 INFERENCE
VOLUME 51 INFERENCE
CITATIONS 44 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University