Skip to content
  • Home Home Home, current page.
  • Moments Moments Moments, current page.

Saved searches

  • Remove
  • In this conversation
    Verified accountProtected Tweets @
Suggested users
  • Verified accountProtected Tweets @
  • Verified accountProtected Tweets @
  • Language: English
    • Bahasa Indonesia
    • Bahasa Melayu
    • Català
    • Čeština
    • Dansk
    • Deutsch
    • English UK
    • Español
    • Filipino
    • Français
    • Hrvatski
    • Italiano
    • Magyar
    • Nederlands
    • Norsk
    • Polski
    • Português
    • Română
    • Slovenčina
    • Suomi
    • Svenska
    • Tiếng Việt
    • Türkçe
    • Ελληνικά
    • Български език
    • Русский
    • Српски
    • Українська мова
    • עִבְרִית
    • العربية
    • فارسی
    • मराठी
    • हिन्दी
    • বাংলা
    • ગુજરાતી
    • தமிழ்
    • ಕನ್ನಡ
    • ภาษาไทย
    • 한국어
    • 日本語
    • 简体中文
    • 繁體中文
  • Have an account? Log in
    Have an account?
    · Forgot password?

    New to Twitter?
    Sign up
BrandonBloom's profile
Brandon Bloom
Brandon Bloom
Brandon Bloom
@BrandonBloom

Tweets

Brandon Bloom

@BrandonBloom

CTO of @LegalpadIO

Seattle, WA
brandonbloom.name
Joined May 2008

Tweets

  • © 2018 Twitter
  • About
  • Help Center
  • Terms
  • Privacy policy
  • Cookies
  • Ads info
Dismiss
Previous
Next

Go to a person's profile

Saved searches

  • Remove
  • In this conversation
    Verified accountProtected Tweets @
Suggested users
  • Verified accountProtected Tweets @
  • Verified accountProtected Tweets @

Promote this Tweet

Block

  • Tweet with a location

    You can add location information to your Tweets, such as your city or precise location, from the web and via third-party applications. You always have the option to delete your Tweet location history. Learn more

    Your lists

    Create a new list


    Under 100 characters, optional

    Privacy

    Copy link to Tweet

    Embed this Tweet

    Embed this Video

    Add this Tweet to your website by copying the code below. Learn more

    Add this video to your website by copying the code below. Learn more

    Hmm, there was a problem reaching the server.

    By embedding Twitter content in your website or app, you are agreeing to the Twitter Developer Agreement and Developer Policy.

    Preview

    Why you're seeing this ad

    Log in to Twitter

    · Forgot password?
    Don't have an account? Sign up »

    Sign up for Twitter

    Not on Twitter? Sign up, tune into the things you care about, and get updates as they happen.

    Sign up
    Have an account? Log in »

    Two-way (sending and receiving) short codes:

    Country Code For customers of
    United States 40404 (any)
    Canada 21212 (any)
    United Kingdom 86444 Vodafone, Orange, 3, O2
    Brazil 40404 Nextel, TIM
    Haiti 40404 Digicel, Voila
    Ireland 51210 Vodafone, O2
    India 53000 Bharti Airtel, Videocon, Reliance
    Indonesia 89887 AXIS, 3, Telkomsel, Indosat, XL Axiata
    Italy 4880804 Wind
    3424486444 Vodafone
    » See SMS short codes for other countries

    Confirmation

     

    Welcome home!

    This timeline is where you’ll spend most of your time, getting instant updates about what matters to you.

    Tweets not working for you?

    Hover over the profile pic and click the Following button to unfollow any account.

    Say a lot with a little

    When you see a Tweet you love, tap the heart — it lets the person who wrote it know you shared the love.

    Spread the word

    The fastest way to share someone else’s Tweet with your followers is with a Retweet. Tap the icon to send it instantly.

    Join the conversation

    Add your thoughts about any Tweet with a Reply. Find a topic you’re passionate about, and jump right in.

    Learn the latest

    Get instant insight into what people are talking about now.

    Get more of what you love

    Follow more accounts to get instant updates about topics you care about.

    Find what's happening

    See the latest conversations about any topic instantly.

    Never miss a Moment

    Catch up instantly on the best stories happening as they unfold.

    Brandon Bloom‏ @BrandonBloom Oct 13

    Is there a such thing as "unifiable data structures"? That is, data structures that have their normal operations with reasonable performance guarantees, but support efficient unification? What keywords should I be searching for?

    10:23 AM - 13 Oct 2018
    • 1 Retweet
    • 10 Likes
    • Mikhail Ksenzov 1000 years of COBOL FROCKetnia Amir Mikhak Robert (eval 'eye) P. Levy Brian T. Rice Sibelius Seraphini 💻🐴Ngnghm Kórédé
    6 replies 1 retweet 10 likes
      1. New conversation
      2. Jurgen Vinju‏ @jurgenvinju Oct 13
        Replying to @BrandonBloom

        Maybe you're looking for "maximal sharing" and hash-consing because these can bring structural equality tests into O(1); used in term rewriting for theorem provers. Maximal sharing data structures are a branch of persistent data structures, due to the required immutability.

        1 reply 0 retweets 2 likes
      3. Brandon Bloom‏ @BrandonBloom Oct 13
        Replying to @jurgenvinju

        I'm familiar with maximal sharing and it's definitely a relevant technique, but I want something more. Consider a hash table with unknown values or a vector with holes in it. Can these permit unify operations? Still have efficient lookup? Concat? push/pop? etc.

        1 reply 0 retweets 2 likes
      4. Jurgen Vinju‏ @jurgenvinju Oct 13
        Replying to @BrandonBloom

        Mmmm.. interesting. Every studied Steven Ekers' work on pattern matching modulo associativity and commutativity and idempotency? An ACI cons tree _is_ a set. Good reads! Maybe relevant; how to efficiently (and safely) backtrack, via Pierre Etienne Moreau's backtracking library.

        2 replies 0 retweets 1 like
      5. Brandon Bloom‏ @BrandonBloom Oct 13
        Replying to @jurgenvinju

        Interesting, I may take a peek at that.

        0 replies 0 retweets 0 likes
      6. End of conversation
      1. New conversation
      2. deech‏ @deech Oct 13
        Replying to @BrandonBloom

        Probably some name clashing going on but I know unification from logic programming, is that what you mean?

        1 reply 0 retweets 0 likes
      3. Brandon Bloom‏ @BrandonBloom Oct 13
        Replying to @deech

        I mean that I have two values that represent incomplete information and I want to get out a new value that represents the union of the information in both; aborting on contradiction.

        0 replies 0 retweets 2 likes
      4. End of conversation
      1. New conversation
      2. Kevin Clancy‏ @kevinclancy_ Oct 13
        Replying to @BrandonBloom

        I think you want state-based CRDTs: https://hal.inria.fr/inria-00555588/document …

        1 reply 0 retweets 1 like
      3. Brandon Bloom‏ @BrandonBloom Oct 13
        Replying to @kevinclancy_

        Hm, CRDTs hadn't occurred to me as relevant here, but I guess they could be. I'll do some re-reading & think on it. Thanks.

        0 replies 0 retweets 0 likes
      4. End of conversation
      1. New conversation
      2. \reversemathwitch‏ @KirinDave Oct 13
        Replying to @BrandonBloom

        Haskell has a good library for this. It leverages traversability. It's not impossible to port this with by-hand runtime metaprogramming methods for general structures so long as you can change the type guarantees. Golang 2 will probably be able to do it. http://hackage.haskell.org/package/unification-fd-0.10.0.1/docs/Control-Unification.html …

        2 replies 0 retweets 3 likes
      3. Brandon Bloom‏ @BrandonBloom Oct 13
        Replying to @KirinDave

        By "data structures", I mean something more interesting than records. I mean abstract data types with procedures having useful semantics and acceptable performance. ie maps, vectors, etc. That library lets you make types unifiable, but says nothing about procedures on them.

        2 replies 0 retweets 2 likes
      4. Joseph Abrahamson‏ @sdbo Oct 14
        Replying to @BrandonBloom @KirinDave

        So you want all of the maps out of your type to also be unified in some sort of way? If two types both support a map named q then q(unify(x, y)) = unify(q(x), q(y))?

        2 replies 0 retweets 0 likes
      5. \reversemathwitch‏ @KirinDave Oct 14
        Replying to @sdbo @BrandonBloom

        I've thought a bunch about this since he replied. It seems to me like what it'd end up being is a way to inject bindings into a tree, and to directly model how unassigned variables interact with it at the insert/remove level of the data structure.

        2 replies 0 retweets 0 likes
      6. Joseph Abrahamson‏ @sdbo Oct 14
        Replying to @KirinDave @BrandonBloom

        Oh sure, I definitely imagine this being done in a binding context. It’s first-order unification I believe.

        0 replies 0 retweets 1 like
      7. End of conversation
      1. New conversation
      2.  💻 🐴Ngnghm‏ @Ngnghm Oct 13
        Replying to @BrandonBloom

        There is of course the union-find algorithm, that you can generalize to a point. Also important is, when a contradiction is found, exhibit a shortest / most localized subset of inferences (as opposed to declarations) that leads to contradiction.

        1 reply 0 retweets 1 like
      3. 1 more reply
      1. New conversation
      2. Varun Gandhi‏ @theindigamer Oct 13
        Replying to @BrandonBloom

        Monoidal containers? http://hackage.haskell.org/package/monoidal-container … For maps, the values (when both maps have the same key) are combined with the mappend operation.

        1 reply 0 retweets 0 likes
      3. Varun Gandhi‏ @theindigamer Oct 13
        Replying to @theindigamer @BrandonBloom

        Oops, wrong link. Here's a correct link:http://hackage.haskell.org/package/monoidal-containers …

        0 replies 0 retweets 0 likes
      4. End of conversation

    Loading seems to be taking a while.

    Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.

      Promoted Tweet

      false

      • © 2018 Twitter
      • About
      • Help Center
      • Terms
      • Privacy policy
      • Cookies
      • Ads info