bollu

29 ms·

241.
by bollu 8y ago
Self plug: Here's a Rust implementation of [one of the Virtual machines described in the book (TIM)]( https://github.com/bollu/timi ) I worked hard on the UI, and I hope it shows. Exploring the states through the UI
242.
by bollu 8y ago
Whatever clang-format and clang-tidy says! Seriously, using automated tools just takes away all of the bikeshedding revolving this issue.
243.
by bollu 8y ago
This is not going to save you either. To have this be efficient, the compiler needs to prove many things: for example, that the end iterator and the current iterator come from the same base object. Compilers don't do this, because comp
244.
by bollu 8y ago
Please don't quote the incompleteness theorem without knowing it's precise statement. Far too many people do this to make absurd claims. In particular, the tradeoff between soundness and completeness only holds for those mathemati
245.
by bollu 8y ago
Polymage is a good example: http://mcl.csa.iisc.ac.in/polymage.html#examples Python embedded DSL for image processing / general matrix munging
246.
by bollu 8y ago
The determinant story of "distortion of unit volume" only makes sense AFAICT if you're in R^n. What does the determinant mean when you're considering linear functions from 2^n to 3^n? There's no geometric interpret
247.
The ideas I picked up in 2018(github.com)
2 points by bollu 8y ago|0 comments
248.
by bollu 8y ago
If you've ever tried encoding proofs in a proof assistant such as Coq (which is what the INRIA folks used to encode the four color theorem and the Fiet-Thompson theorem), you'll realise just how painful it is --- I speak as someon
249.
by bollu 8y ago
As a follow up, there are ways to detect high level patterns (such as matmul). Polly, LLVM's polyhedral loop optimiser does this [for matmul]( https://polly.llvm.org/docs/Performance.html ). We plan on generalising
250.
by bollu 8y ago
The style of coinductive reasoning is very different. In general, in induction, one has a base case and an inductive case. Hence, you can only build "finite" objects (since you start with the base case and you can apply the induct
251.
Making GHC an order of magnitude faster with one neat trick(pixel-druid.com)
59 points by bollu 9y ago|18 comments
252.
Show HN: Papers I read and loved in 2017 (compilers and programming languages)(pixel-druid.com)
1 points by bollu 9y ago|0 comments
253.
by bollu 9y ago
[teleport]( https://github.com/bollu/teleport ) is a cute CLI tool written by me to explain haskell program construction.
254.
by bollu 9y ago
Most compiler tutorials show how to write a compiler, but now how to write an optimising compiler. In fact, it's not that much harder, and is a nice walkthrough in some very cool ideas in graph theory, dataflow analysis,etc. Which is
255.
Show HN: Simplexhc, a Haskell to LLVM compiler(pixel-druid.com)
5 points by bollu 9y ago|1 comments
256.
by bollu 9y ago
If I may piggy back on this: I've been writing a tiny optimising compiler in Haskell, to show off the problems and cool ideas that modern compiler toolchains like LLVM have: I'm covering SSA, Scalar evolution, and Register Alloc
257.
by bollu 9y ago
In fact, LLVM does use polyhedral compilation :) it's just disabled by default. There's a module called Polly in LLVM which performs polyhedral optimisations! Yep, tableGen is nice but would be overkill for this tutorial project.
258.
by bollu 9y ago
Shameless plug: I've been writing a series that's WIP about writing a tiny optimising compiler - https://github.com/bollu/tiny-optimising-compiler . It tries to model as much as possible, and the aim is to s
259.
by bollu 9y ago
I've been writing an llvm-lite in haskell to show of the main optimisation ideas of LLVM [here]( https://github.com/bollu/tiny-optimising-compiler ). Thought someone maybe interested :)
260.
by bollu 9y ago
Q(x_1, x_2) is the smallest field containing Q, x_1, x_2. So, it's a subfield of the reals, assuming x_1, x_2 \in R
261.
Show HN: Simplexhc – Haskell to LLVM compiler (design phase)(pixel-druid.com)
55 points by bollu 9y ago|14 comments
262.
by bollu 10y ago
Something that Polymer and Material (IIRC) get right is that when you click multiple times on buttons, new ripples are created each time. In Propeller, the old ripple just "vanishes" and a new ripple is created. I don't know,
263.
Show HN: TIMi-Visual Interpreter for lazy functional language in Rust(github.com)
2 points by bollu 10y ago|0 comments
264.
by bollu 10y ago
because 1. it's a nicer UI that does the same thing. 2. the goal of the tool was to be minimal, useful, and a way to show off Haskell's ability to be able to write real world code that beginners can understand. 3. (personal opinio
265.
by bollu 10y ago
what advantage does `eshell` have? And yes, the primary goal of writing this was to have a small CLI app in Haskell , but I've found that I use teleport a decent amount now to quickly zip between common folders
266.
by bollu 10y ago
oh, interesting! I don't have a deep understanding of how bash auto-completion works, I'll read through this to adapt it. I'm glad you liked it :)
267.
Show HN: Teleport: Simple command line app tutorial written in Haskell(bollu.github.io)
76 points by bollu 10y ago|28 comments
268.
Show HN: RealityCheck: Proof of concept ST plugin to live edit Python code(github.com)
2 points by bollu 10y ago|0 comments
269.
by bollu 10y ago
Location: Hyderabad, India Remote: Yes Willing to relocate: Yes Technologies: Functional Programming, Haskell, C++, Python, Rust, Graphics, Compilers Resume: https://drive.google.com/open?id=0B_CmqmRQ2-AzMTI0U3FLSzQ3Qk...
270.
by bollu 10y ago
Where is this from? Seems like an intriguing read

More ›