andrejbauer

Are all functions continuous?

Mathematical background

Brouwer's statement "all functions are continuous" can be formulated without reference to topology as follows.

Definition: A functional f : (N → N) → N is continuous at a : N → N when there exists m : N such that, for all b : N → N, if ∀ k < m, a k = b k then f a = f b.

stedolan

OCaml GC Pacing

Current OCaml GC logic

I'm going to make the following simplifying assumptions:

• There aren't many custom_alloc_custom_mem blocks (caml_dependent_size ~= 0)

• There aren't many caml_alloc_custom blocks with nonzero mem/max

VictorTaelin

Company:

• HOC: Towards an Optimal Computer: why interaction paradigm can improve computers.
• HOC: Can we build an optimal processor?: like above, but as a tweet.
• HOC: Complete Historical Overview: the lore behind HOC's creation.

Theory:

• Interaction Combinators - Y.Lafont 1997: a concurrent model of computation
• Symmetric Interaction Combinators - Damiano Mazza 2009: a symmetric variant (used by HVM)
• The Optimal Implementation of Functional Programming Languages - best book to learn
• [BOHM](https://www.cambridge.org/core/services/aop-cambridge-core/content/