P. Oscar Boykin
P. Oscar Boykin
as part of #193 we need to have a clear algorithm for evaluating staged code. See #323 for the issue around adding type-inference and syntax. It is important to note...
as part of #193 we need to have a syntax and type inference rules. Here is a strawman: ``` def times3(i: Int) -> Code[Int]: ${3.times(i)} six = times3(2)! ``` Inside...
related to #132 without the region on the var, we can't point exactly to it, especially after any transformation of the graph via normalization or optimization.
Many JavaScript based typed languages support anonymous records and type aliases. It seems like these use cases are better for the literal dict/object syntax than just homogenous maps (since I...
One idea would be to have a notion of dependencies, then we could have a command to fetch the dependencies, compile them, and write them into a single protobuf file....
We could optionally take a cache directory as an option, and if given, we could cache compilation of files into packages. We could use a hash of the expressions without...
often (we should be so lucky) one hits a limit of the arg length a program can test. The canonical solution to this is to pass a file and we...
see the sort implementation in #406 and this tweet: https://twitter.com/milessabin/status/1197977313809510400?s=20 see: https://personal.cis.strath.ac.uk/conor.mcbride/TotallyFree.pdf http://casperbp.net/store/intrinsicallytyped.pdf http://www.cs.nott.ac.uk/~pszvc/publications/General_Recursion_MSCS_2005.pdf this tweet: https://twitter.com/jer_gib/status/1053066342180446208 calls the fuel pattern the "Bove-Capretta Method"
Right now, each name is either exported or not. We don't have any mechanism as in java for limited exports. We could have something like: ``` export [ foo, bar...
see #392 One obvious thing I haven't done much work on is that it is much easier to get started if bosatsu CLI is usable without other tools or writing...