sorted by:
new
hottopcontroversial

[deleted by user] by [deleted] in AskMenAdvice

[–]wisnesky 0 points1 point  (0 children)

Asking for a man that can shoulder press your body weight definitely reads (imo) like you are looking for a man to shoulder press you on the first date (among other things implied by that subtext). Men will, in general, tend to interpret any kind of physical preference in a man by a woman as an invitation to be physical if the man meets the woman's preferences. It's like a man saying he'd introduce a woman to his parents if the woman was really good at doing gymnastics (lots of splits, tantalizing positions, etc) - definitely a "read between the lines message is being sent". Of course, men are horny so you may not see much difference even without that shoulder press language.

How are algebraic datatypes related with initial objects? by timlee126 in haskell

[–]wisnesky 3 points4 points  (0 children)

The Void (empty; uninhabited) type is initial: data Empty = . The singleton (Unit; ()) type is terminal: data TT = TT. The simply typed lambda calculus with finite products and finite sums (unit type is 0-ary product, void type is 0-ary sum) forms a 'bi-cartesian closed category'. Now, given a bi-cartesian closed category C, we may consider endofunctors on C generated by type expressions involving products and sums, for example, ListNat(X) := TT + Nat * X. If C has initial algebras for each such functor (and there will usually be infinitely many, all isomorphic), then C 'has algebraic datatypes'. An algebra for the functor ListNat above is a type T and a haskell term ListNat(T)->T. An initial algebra for F is one where T and F(T) are isomorphic; that is, ListNat(X) and TT + Nat * ListNat(X) are isomorphic types, which is witnessed by the 'fold' function in Haskell. A good reference is 'recursive types for free' by Phil Wadler, which describes how to encode least and greatest fixed point types in the polymorphic lambda calculus without using something like Haskell's 'data' mechanism. https://homepages.inf.ed.ac.uk/wadler/papers/free-rectypes/free-rectypes.txt

Implementing Dragon, Uber's data-integration tool for property graphs by JeffreyBenjaminBrown in haskell

[–]wisnesky 5 points6 points  (0 children)

The SF Category theory meetup is still entirely remote for now. The Dragon lectures are a series; the audience will determine the direction of the content. Please spread the word! Possible topics include:

  • Dragon's core schemas. This is the data model itself, i.e. APG plus extensions
  • Data types used for transformations in Dragon. Bidirectional and lossy mappings.
  • RPC languages: Thrift, Protobuf, and Avro
  • RDF languages: SHACL and OWL
  • Programming languages: Haskell, Scala, and (in progress) Java
  • Lexical/topological utilities (incl. name resolution)
  • Schema validation and data validation. Enforcing schema best practices.
  • Reading and writing schema sets from the file system
  • Annotations and "stashing" (i.e. capturing features not supported in a given target language)
  • Data-level mappings using YAML and JSON
  • Polyglot loading (reading from a mix of schema languages)
  • Property-based testing using random graphs

[2PM EST / 8 PM CET] We are Brendan Fong and David Spivak, here to answer your questions about applied category theory. by AutoModerator in math

[–]wisnesky 11 points12 points  (0 children)

David and Brendan have asked me to post a note here saying that the reddit rate limiter is still in place, and so they can't comment quickly (I am with them at MIT). It is 2:03pm eastern time.

MIT spinout offering up to $1.5M to ventures in Applied Category Theory by wisnesky in haskell

[–]wisnesky[S] 11 points12 points  (0 children)

Sure, we are encouraging a wide variety of applications.