An n-ary zipWith in Haskell

Forfattere

  • Daniel Fridlender
  • Mia Indrika

DOI:

https://doi.org/10.7146/brics.v5i38.19483

Resumé

The aim of this note is to present an alternative definition of the
zipWith family in the Haskell Library Report [5]. Because of the difficulties in defining a well-typed function with a variable number of arguments, [5] presents a family of zipWith functions. It provides zip functions zipWith2, zipWith3, . . . , zipWith7. For each n, zipWithn zips n lists with a n-ary function. Defining a single zipWith function with a variable number of arguments seems to require dependent types. Inspired by [3], we show, however, how to define such a function in Haskell by means of a binary operator for grouping its arguments. For comparison, we also give definitions of zipWith in languages with dependent types.

Downloads

Publiceret

1998-06-08

Citation/Eksport

Fridlender, D., & Indrika, M. (1998). An n-ary zipWith in Haskell. BRICS Report Series, 5(38). https://doi.org/10.7146/brics.v5i38.19483

Nummer

Nr. 38 (1998): RS-38 An n-ary zipWith in Haskell

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).