Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		bannalia.blogspot.com Bannalia: trivial notes on themes diverse: Objects, slots, functors, duality
\|	\|	eyakubovich.github.io Iterating over a text file	4.8 parsecs away Travel
\|	\|	It's a simple task - you want iterate over all the lines in a file and perform an action on each one. In Python it's as simple as:for line in open("somefile.txt"): print lineHow about C++11. How hard can it be? This stackoverflow post gives us a starting point. We...	4.8 parsecs away Travel
\|	\|	migocpp.wordpress.com CUDA Runtime Templates \| migo::blog	4.9 parsecs away Travel
\|	\|	The CUDA C/C++ platform allows different programming modes for invoking code on a GPU device. Probably the more familiar and definitely simpler way is writing a single .cu file which contains both the kernel function and the host wrapper with "<<< >>>" invocation syntax. The NVCC compiler would transparently embed compiled device code and all...	4.9 parsecs away Travel
\|	\|	www.foonathan.net Tricks with Default Template Arguments	5.4 parsecs away Travel
\|	\|	Just like regular function parameters, template parameters can also have default parameters. For class templates, this behaves mostly just like default function arguments: if you pass fewer template arguments than required, default template arguments are used to fill the remaining places. However, for function templates, it gets more complicated as template parameters for functions can be deduced by the normal function arguments. This leads to some interesting side-effects. In particular, default argumen...	5.4 parsecs away Travel
\|	\|	kuruczgy.com Introduction to dependent types and the Curry-Howard isomorphism	29.5 parsecs away Travel
\|		[AI summary] The article explores the intersection of functional programming and logic through the lens of dependent types. It begins with foundational concepts like type constructors and inductive types, then delves into the Curry-Howard isomorphism, which links programs to mathematical proofs. The discussion covers how types represent propositions, functions as implications, and inductive types as proof strategies. Examples include defining logical relations like less than or equal to and equality, and demonstrating how to prove properties like universal quantification and mathematical identities. The article concludes with an overview of resources for further study in proof assistants like Coq and Idris, emphasizing the practical applications of dependent...	29.5 parsecs away Travel