HNHacker News
TopNewBestAskShowJobs

wisnesky

188 karma · joined July 23, 2016

http://wisnesky.net
submissionscomments
wisnesky··on Computational Category Theory in Python III: Monoids, Groups, and Preorders
Honestly; I'm not sure; I'm a working computer scientist, not a working mathematician, and I use a proof assistant (Coq) all the time to have confidence that the proofs I write are correct (and more and more this is a requirement for publication in CS conferences). I want HoTT to succeed because it would turn some the axioms I must assume in the current Coq proof assistant into theorems, with significant implications for 'proof engineering' at scale (eg, verifying an OS kernel or compiler or database). When I read the math over flow post my emotional response is gladness that I can't accidentally conflate a topological space with an infinity groupoid. Many of the HoTT researchers are mathematicians (including the late Vladimir Voevodsky); presumably, the HoTT book (which I understand is available online) can give you a better answer than I can from the perspective of a working mathematician.
wisnesky··on Computational Category Theory in Python III: Monoids, Groups, and Preorders
Much of theoretical computer science uses categorical methods, for example, as semantics for type theory. In that field, such techniques are often more natural than set-theoretic ones due to issues of computability, decidability, etc. So at the very least, much of that research as originally written would be inaccessible to a non category theorist. Whether that field counts as mathematics and if it does whether it is worth missing out on depends on taste of course, but an example would be 'homotopy type theory' https://homotopytypetheory.org
wisnesky··on Applied Category Theory (2019) [video]
We're using applied category theory quite heavily in the design and implementation of the categorical query language CQL: https://www.categoricaldata.net . There category theory gave us algorithms that are missing from SQL (such as for left Kan extensions) and the ability to do extended compile time checking of queries against data integrity constraints; for most of CQL internals, it's unclear how you could make it work without category theory.
wisnesky··on The third wave of open source migration
You must be referring to the "love-hate" relationship between Amazon and open source software as described eg here?

https://www.zdnet.com/article/amazon-and-commercial-open-sou...

"Vendors developing those open source products started accusing AWS of strip mining, i.e., reaping the benefits of the products, without contributing back to their development."

wisnesky··on How did software get so reliable without proof?
In 2020, software is reliable?
wisnesky··on Math is an insurance policy
Your point is well-taken, and being overlooked, so here it is explicitly: to implement "wet. messy business logic" is, by definition, to implement "a complex algorithm".
wisnesky··on Learn Coq in Y Minutes
Yes, Coq is pronounced like "cock" in English. C'est la vie
wisnesky··on We do not use foreign keys (2016)
Many people on this thread have asked if there is a rigorous way to migrate data between relational schemas that contain non-trivial foreign keys, and the answer is yes: In the open-source categorical query language CQL, data migrations necessarily respect foreign keys - a property guaranteed by the mathematics of category theory and the automated theorem prover that ships with CQL. http://categoricaldata.net
wisnesky··on We do not use foreign keys (2016)
I agree, whether or not a given data model has foreign keys is a math question with a correct answer (up to isomorphism of the data model); if it does, where in a system they should or should not be enforced is an entirely separate, implementation (vs semantic) level issue.
wisnesky··on Learning How to Prove: From the Coq Proof Assistant to Textbook Style
Kevin Redwine: Inference Rules Plus Proof-Search Strategies Equals Programs (2009). http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152....

In the programming-language community many authors communicate algorithms through the use of inference rules. To get from rules to working code requires careful thought and effort. If the rules change or the author wants to use a different algorithm, the effort required to fix the code can be disproportionate to the size of the change in the rules. This thesis shows that it is possible to generate working code automatically from inference rules as they appear in publications. The method of this generation is found in the combination of two domain-specific languages: Ruletex and MonStr. Ruletex formally describes inference rules; MonStr connects the rules to an algorithm. Ruletex descriptions are embedded in LATEX, the language that researchers use to publish their work, so that the author commands complete control of the rules ’ appearance. Moreover the generated code enjoys several nice properties: Existing code written in a general-purpose programming language can interoperate with Ruletex code, correctness of rules is decoupled from performance and termination of code, and implementations are conceptually simple, consisting only of λ-calculus with pattern matching. The main technical contribution of this work is the design of MonStr, the executionstrategy language used to form an algorithm out of rules. MonStr specifications provide an important guarantee: a valid strategy cannot affect partial correctness, although it can affect termination, completeness, and efficiency.

wisnesky··on Linguistics Using Category Theory (2018)
No, those result numbers do not include quotation marks. With the quotes I show the same results as you.
wisnesky··on Linguistics Using Category Theory (2018)
I'm showing 1M and 200K Google results for those phrases, respectively.
wisnesky··on PartiQL: One query language for all your data
I'd be happy to showcase our recent progress. But let's connect offline, so as not to hijack the conversation. Feel free to drop me a line at ryan@conexus.ai.
wisnesky··on Seven Sketches in Compositionality: An Invitation to Applied Category Theory
Absolutely, and I would encourage you to contact us offline first to discuss related work in this space - there is indeed a lot, because the category of CQL schemas forms a BCCC and for each schema S, the category of S-databases forms a topos, briefly described here: https://www.categoricaldata.net/cql/haskell.pdf. So CQL is expressive enough to interpret the STLC and higher-order logic in a few different ways.
wisnesky··on Seven Sketches in Compositionality: An Invitation to Applied Category Theory
There is up to $1.5M USD available for start-ups who want to solve business problems with category theory: https://conexus.ai/ventures and there is an open-source implementation of the data migration sketch from that book here: http://categoricaldata.net
wisnesky··on Catlab.jl: Experimental framework for applied category theory
Here is a short course on applied category theory: https://ocw.mit.edu/courses/mathematics/18-s097-applied-cate...
wisnesky··on From Design Patterns to Category Theory (2017)
Indeed, we (David Spivak et al) are (among other things) trying to apply those seven sketches in applied category theory to business problems and are soliciting proposals for up to $1.5M in venture funding from interested start-ups to do so: https://conexus.ai/ventures. Individuals interested in applying CT are also encouraged to apply to get matched with a venture.
wisnesky··on We Can Do Better Than SQL
Check out http://categoricaldata.net for a categorical approach to database theory that uses a labeled null semantics from type theory.
wisnesky··on We Can Do Better Than SQL
In CQL (http://categoricaldata.net), which generalizes relational theory with category theory, you can annotate schemas with equations and have them checked at runtime, or at compile time with an automated theorem prover (e.g., to establish that a query into a schema with a constraint will always materialize an instance that satisfies that constraint). One example is de-normalization: https://www.categoricaldata.net/denorm.php
wisnesky··on We Can Do Better Than SQL
Category theory can do better than relational database theory: the open-source categorical query language CQL extends SQL with generalizations of abstractions such as schema mappings and queries while supporting automated theorem proving and fixing foundational semantic issues such as null handling.

http://categoricaldata.net

wisnesky··on How category theory is applied
Sure, here is an example that uses sigma to compute an equivalence relation:

http://cql.conexus.ai/quotient.php

wisnesky··on How category theory is applied
Yes, for example the dual of join (called 'sigma'), which only exists for databases in categorical normal form. There are many academic papers and an open-source project ('categorical query language') here: http://www.categoricaldata.net.
wisnesky··on Applied Category Theory
David Spivak has a company, http://conexus.ai, that is applying category theory to data migration as described in 7 sketches. It will soon be expanding and soliciting proposals to fund applied category theory start-ups in many domains, as well as providing some example proposal ideas. Watch http://ventures.conexus.ai over the coming weeks for details.
wisnesky··on Databases from finite categories
This line of work has been continued in the FQL project: http://categoricaldata.net/fql.html . The SQL analogy is discussed in the Relational Foundations paper there.
wisnesky··on Category Theory for the Sciences
The FQL project uses ologs for data integration. There are many papers and presentations at http://categoricaldata.net/fql.html .
← PreviousPage 2 of 2