1. Forum
  2. Usenet
  3. COMP.LANG.PYTHON

  • is [comprehension] the right word???

    From Hen Hanna@21:1/5 to All on Mon Feb 20 17:06:26 2023
    is [comprehension] the right word???

    i swear i never heard the word before
    getting into Python a few years ago.


    What was it called in the Lisp (Scheme) world ????

    ok... in Common Lisp, (and MacLisp) it was Loop and Collect

    https://en.wikipedia.org/wiki/List_comprehension#History

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Paul Rubin@21:1/5 to Hen Hanna on Mon Feb 20 17:45:19 2023
    Hen Hanna <[email protected]> writes:
    is [comprehension] the right word???

    Yes, it comes from math, particularly set theory. An expression like

    { n | n:integer, n mod 2 = 0 }

    is called a set comprehension, and then one there denotes the set of all
    even integers. Axioms saying that the above denotes a legitimate set
    are called comprehension axioms. In ZFC (an axiomitization of set
    theory widely used in math), there is an infinite schema of such axioms.

    The Haskell language used a notation inspired by this for "list comprehensions", and Python list (and later dictionary etc.)
    comprehensions were inspired by Haskell's version.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hen Hanna@21:1/5 to Paul Rubin on Mon Feb 20 18:23:56 2023
    On Monday, February 20, 2023 at 5:45:39 PM UTC-8, Paul Rubin wrote:
    Hen Hanna <[email protected]> writes:
    is [comprehension] the right word???
    Yes, it comes from math, particularly set theory. An expression like

    { n | n:integer, n mod 2 = 0 }

    is called a set comprehension, and then one there denotes the set of all even integers. Axioms saying that the above denotes a legitimate set
    are called comprehension axioms. In ZFC (an axiomitization of set
    theory widely used in math), there is an infinite schema of such axioms.

    The Haskell language used a notation inspired by this for "list comprehensions", and Python list (and later dictionary etc.)
    comprehensions were inspired by Haskell's version.


    thanks... my curiosity was re-aroused today
    when i learned that....

    In Italian .... they say: [compresi] as in...


    Ho 5 libri di Eco, compresi quei 3 che vedete lì.

    Ho 5 libri di Eco, inclusi 3 che non sono disponibili nella traduzione giapponese.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Michael Torrie@21:1/5 to Hen Hanna on Mon Feb 20 21:17:35 2023
    On 2/20/23 18:06, Hen Hanna wrote:
    is [comprehension] the right word???

    i swear i never heard the word before
    getting into Python a few years ago.

    Seems as though the term was borrowed from formal mathematics set theory.

    A simple search reveals that the term "list comprehension" predates
    Python. Back to 1977 to be exact. The term was first coined by Phil
    Wadler in the late 70s or early 80s.

    https://en.wikipedia.org/wiki/List_comprehension

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to Paul Rubin on Tue Feb 21 05:35:41 2023
    Paul Rubin <[email protected]d> writes:
    Yes, it comes from math, particularly set theory. An expression like
    { n | n:integer, n mod 2 = 0 }
    is called a set comprehension,

    This notation also is known as "set-builder notation",
    and an early use can be found in Paul Bernays'
    "Axiomatic set theory" (1958, Dover reprint), on page 46
    (according to the Web).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Hen Hanna@21:1/5 to Paul Rubin on Wed Feb 22 12:25:30 2023
    On Monday, February 20, 2023 at 5:45:39 PM UTC-8, Paul Rubin wrote:
    Hen Hanna <[email protected]> writes:
    is [comprehension] the right word???

    Yes, it comes from math, particularly set theory. An expression like

    { n | n:integer, n mod 2 = 0 }

    is called a set comprehension, and then one there denotes the set of all even integers. Axioms saying that the above denotes a legitimate set
    are called comprehension axioms. In ZFC (an axiomitization of set
    theory widely used in math), there is an infinite schema of such axioms.

    The Haskell language used a notation inspired by this for "list comprehensions", and Python list (and later dictionary etc.)
    comprehensions were inspired by Haskell's version.


    thank you .... i did a search thru Google.Books and found just 1 hit (before 1970).



    The Cambridge History of Later Greek and Early Medieval ... - Page 133 books.google.com › books
    A. H. Armstrong · 1967
    FOUND INSIDE – PAGE 133
    Too powerful , in fact : in 1902 , Russell showed that it is inconsistent , since it implies Russell's Antinomy ( see Russell's letter to Frege in van Heijenoort 1967 ) . Law V is close to what has become known as the Set Comprehension Principle (SCP) .
    .......................

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)