Hacker News: avernet

AI and the Human Voice

avernet — Thu, 09 Apr 2026 01:23:19 +0000

Article URL: https://gilest.org/notes/2026/human-ai/

Comments URL: https://news.ycombinator.com/item?id=47698264

Points: 3

# Comments: 0

Grief and the AI split

avernet — Thu, 12 Mar 2026 22:35:08 +0000

Article URL: https://blog.lmorchard.com/2026/03/11/grief-and-the-ai-split/

Comments URL: https://news.ycombinator.com/item?id=47358206

Points: 245

# Comments: 381

Why total fertility rate doesn't reflect the children number women will have

avernet — Wed, 15 Oct 2025 17:47:42 +0000

Article URL: https://ourworldindata.org/total-fertility-rate-births-per-woman

Comments URL: https://news.ycombinator.com/item?id=45596115

Points: 2

# Comments: 0

New comment by avernet in "Useful built-in macOS command-line utilities"

avernet — Wed, 06 Nov 2024 20:24:10 +0000

Someone needs to create a brew formula for `hear`.

New comment by avernet in "Show HN: Repogather – copy relevant files to clipboard for LLM coding workflows"

avernet — Thu, 12 Sep 2024 15:34:44 +0000

And how does repogather do it? From the README, it looks to me like it might provide the content of each file to the LLM to gauge its relevance. But this would seem prohibitively expensive on anything that isn't a very small codebase (the project I'm working on has on the order of 400k SLOC), even with gpt-4o-mini, wouldn't it?

New comment by avernet in "Ask HN: What's the fastest tool for basic CRUD?"

avernet — Mon, 20 Jan 2020 19:34:05 +0000

Yes, Form Builder, in Orbeon Forms, allows you to create a page with form fields, use the provided values to call a REST/CRUD API, and show the result on that page. You can try that out for yourself on demo.orbeon.com, or download the software and run it locally.

There is an open source (LGPL) Community Edition, but the services & actions feature you need for this is only available in the Professional Edition. This being said, if you just need this for your own local testing, you can get a trial license (automatic process, valid 3 months, no limit on number of licenses you get), and have fun with it.

Bias: I'm one of the Orbeon Forms developers ;). ‑Alex

TEDx Portsmouth: How to hack your biology and be in the zone every single day

avernet — Fri, 26 Aug 2016 22:31:52 +0000

Article URL: https://www.youtube.com/watch?v=0xc3XdOiGGI

Comments URL: https://news.ycombinator.com/item?id=12369762

Points: 3

# Comments: 0

Scala vs. Go: The perspective of a developer with experience with both

avernet — Thu, 21 Aug 2014 22:29:34 +0000

Article URL: http://www.quora.com/Go-programming-language/Scala-vs-Go-Could-people-help-compare-contrast-these-on-relative-merits-demerits/answer/Nick-Snyder-1

Comments URL: https://news.ycombinator.com/item?id=8209991

Points: 7

# Comments: 1

New comment by avernet in "Transducers are coming to Clojure"

avernet — Thu, 07 Aug 2014 17:45:32 +0000

Here is a link:

http://www.haskell.org/haskellwiki/Correctness_of_short_cut_...

New comment by avernet in "Transducers are coming to Clojure"

avernet — Thu, 07 Aug 2014 00:13:03 +0000

OK, maybe we're getting somewhere. Let me try to write this `map`, just to see. I'm using Scala, so I can put some types, and have the compiler yell at me if I'm doing something overtly wrong (I need all the help I can get!).

For clarity, let's define a type alias for reducers:

    type Reducer[X, A] = (X, A) ⇒ X

Let's define `map` to match the type definition you provided. And with that type definition, I only see one way in which the function can be implemented. So it must be:

    def map[X, A, B](f: A ⇒ B): (Reducer[X, B] ⇒ Reducer[X, A]) =
        (redB: Reducer[X, B]) ⇒ (x: X, a: A) ⇒ redB(x, f(a))

How can I use this? Let's try the following:

    def addup(zero: Int, a: List[Int]) = a.foldLeft(zero)(_ + _)
    def parseList(a: List[String]) = a.map(_.toInt)

    map(parseList)(addup)(1, List("7", "8"))

This returns 16. OK, parsing the list, and adding up starting from 1. But it doesn't look to me like `map` implements anything like the usual semantic of map. It just converts the data structure, and applies the reducer. What am I missing here?

New comment by avernet in "Transducers are coming to Clojure"

avernet — Wed, 06 Aug 2014 19:21:15 +0000

Providing the signature of this new `map` function (e.g. as in Haskell's fmal http://www.haskell.org/hoogle/?hoogle=fmap), would certainly go a long way towards helping people understand what this `map` does.