A Federation
  • Communities
  • Create Post
  • Create Community
  • heart
    Support Lemmy
  • search
    Search
  • Login
  • Sign Up
☆ Yσɠƚԋσʂ ☆@lemmy.mlM to Lisp Community@lemmy.mlEnglish · 1 year ago

The evolution of a Scheme programmer

erkin.party

external-link
message-square
5
fedilink
12
external-link

The evolution of a Scheme programmer

erkin.party

☆ Yσɠƚԋσʂ ☆@lemmy.mlM to Lisp Community@lemmy.mlEnglish · 1 year ago
message-square
5
fedilink
alert-triangle
You must log in or register to comment.
  • davel [he/him]@lemmy.ml
    link
    fedilink
    English
    arrow-up
    3
    ·
    1 year ago
    ;; Heard about the Y-combinator and went down a rabbithole
    

    side-eye-1 https://en.wikipedia.org/wiki/To_Mock_a_Mockingbird side-eye-2

    • ☆ Yσɠƚԋσʂ ☆@lemmy.mlOPM
      link
      fedilink
      English
      arrow-up
      4
      arrow-down
      1
      ·
      1 year ago

      haha it’s definitely a very different way to think about computing :)

  • LalSalaamComrade@lemmy.ml
    link
    fedilink
    English
    arrow-up
    3
    ·
    edit-2
    6 months ago

    deleted by creator

    • ☆ Yσɠƚԋσʂ ☆@lemmy.mlOPM
      link
      fedilink
      English
      arrow-up
      2
      arrow-down
      1
      ·
      1 year ago

      I would guess most of them would have roughly the same performance. Ultimately, it’s just going to be O(n) iteration, and since it’s generator it’s not mutating anything. :)

      • LalSalaamComrade@lemmy.ml
        link
        fedilink
        English
        arrow-up
        1
        ·
        edit-2
        6 months ago

        deleted by creator

        • ☆ Yσɠƚԋσʂ ☆@lemmy.mlOPM
          link
          fedilink
          English
          arrow-up
          3
          arrow-down
          1
          ·
          1 year ago

          Monads are mostly a popular pattern in Haskell because encapsulating side effects within monads allows the type system to enforce their proper usage. They’re not necessary for immutability or state management in general. It’s just a way to enforce discipline more than anything.

          The way immutability is implemented is using persistent data structures. The idea is that you do structural sharing for the common data when creating changes, so you don’t have to pay the price of a full copy of the data structure. In terms of performance, this approach works pretty well in most cases. It’s more expensive than direct mutation, but far cheaper than a deep copy making it a good compromise for the general case.

  • gscacco@mastodon.social
    link
    fedilink
    arrow-up
    2
    ·
    1 year ago

    @yogthos

Lisp Community@lemmy.ml

lisp@lemmy.ml

Subscribe from Remote Instance

Create a post
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !lisp@lemmy.ml

A community for the Lisp family of programming languages.

Lisp (historically LISP) is a family of programming languages with a long history and a distinctive, fully parenthesized prefix notation. Originally specified in 1958, Lisp is the second-oldest high-level programming language. Only Fortran is older, by one year.

History

  • History of Lisp - John McCarthy’s history of 12 February 1979.
  • History of LISP at the Computer Histroy Museum

Associations and meetings

  • Association of Lisp Users
  • European Lisp Symposium

Resources - TODO

Related communities (dialects) - TODO

Visibility: Public
globe

This community can be federated to other instances and be posted/commented in by their users.

  • 1 user / day
  • 11 users / week
  • 19 users / month
  • 58 users / 6 months
  • 1 local subscriber
  • 769 subscribers
  • 136 Posts
  • 121 Comments
  • Modlog
  • mods:
  • dinomug@lemmy.ml
  • __z@lemmy.ml
  • ☆ Yσɠƚԋσʂ ☆@lemmy.ml
  • cadar@lemmy.ml
  • BE: 0.19.8
  • Modlog
  • Instances
  • Docs
  • Code
  • join-lemmy.org