fully-homomorphic-encryption VS eff

Secure computing. This includes Fully Homomorphic Encryption AKA FHE, of which there is a language/compiler which just got released and Google's older FHE compiler. FHE is probably more "compiler" than "type system", e.g. Google's compiler works on C++. Also Security Type Systems which include Oblivious data structures and Oblivious ADTs.

I don't have any advice for you, but I do work on homomorphic encryption at Google and we have an FHE compiler project [1] (though it is likely going to change a lot in the coming year). I happen to have a math PhD, so the transition to this field was not a huge stretch, but before that I worked in supply chain optimization for data centers, and just decided this was too exciting to pass up.

[1]: https://github.com/google/fully-homomorphic-encryption/issue...

+1, and some compilers already exist to do that for you. See, e.g., Google's compiler (which I work on). https://github.com/google/fully-homomorphic-encryption

Once the tools are written, you should be able to take a program written in some language foo and transpile it to a FHE version of foo. See Google's C++ to FHE-C++ transpiler. Thus, you can test/debug your application without FHE before transpiling to something that is FHE.

You can swap-out implementations for testing, avoid the crazy N^2 instances issues, etc. They're pretty cool. Currently there are many competing libraries. polysemy and eff both have good examples on their homepages.

Effect systems and Algebraic effects. ocaml has just released a stripped-down effect system. People are also working on Effect systems for Haskell (eff, fused-effects, effet). Koka is a language built with effects first and foremost and it’s rapidly gaining popularity. Unison also has effects.

There are also a few subtle issues that arise with delconts related to semantics of higher order effects (see here and here), but they might be solvable.

Details are in https://github.com/hasura/eff/issues/12 and https://www.reddit.com/r/haskell/comments/pywuqg/unresolved_challenges_of_scoped_effects_and_what/.

You'll get fearless parallel with STM in the mixture, and GHC is getting a work in progress effect system for Haskell, as Delimited continuation primops has been merged.

My last example is algebraic effects, some of which have been made possible in a both practical and efficient way thanks to extremely recent research, and that I can use to implement architectures like Ports and Adapters or Clean Architecture and have very maintainable code. (Extensible Effects — An Alternative to Monad Transformers was published in 2013, Effect Handlers in Scope was published in 2014 and they are behind Polysemy, while there is ongoing work on effects with even better performance, like Eff)

cleff's Eff monad is esentially implemented as a ReaderT IO. [...] This is first done by eff, [...]

Here is link number 1 - Previous text "eff"

Languages such as Koka only support algebraic effects, not scoping operations such as catch and listen. The Effect Handlers in Scope paper introduces scoping operations, which lead to the Haskell libraries fused-effects and polysemy, but they turned out to have some weird semantics. eff is her effort to fix that.

There are a few languages that have algebraic effect systems, most notably Haskell, but these systems are implemented as libraries, not baked into the language (which can have advantages and disadvantages).