/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

 cukic.co
Template meta-programming: Some testing and debugging tricks | Ivan ?uki?
| | www.fluentcpp.com
How to Define a Variadic Number of Arguments of the Same Type - Part 1 - Fluent C++
2.2 parsecs away

Travel
| | Variadic templates allow any number of template parameters of any type. In this article we see how to do a variadic number of parameters of the SAME type.
| | entangledlogs.com
Notes on Generic Programming - II: Generic Programming | Entangled Logs
2.7 parsecs away

Travel
| | Generic Programming: Generating part of programs Introduction Generic Programming: Programming with generic parameters to avoid unnecessary code duplication and encourage code reuse. Polymorphism is also another technique to solve code reuse Puts implicit constraints on the generic types that are to be fulfilled by concrete types. template T adder(T LHS, T RHS) { return LHS + RHS; } struct Foo { inv Val = 0; } Foo f = adder(Foo{}, Foo{}): In this code snippet, we assume that Foo meets the requirement tha...
| | www.cppstories.com
C++17 in details: Templates - C++ Stories
2.6 parsecs away

Travel
| | For C++17 everyone wanted to have concepts, and as you know, we didn't get them. But does it mean C++17 doesn't improve templates/template meta-programming? Far from that! In my opinion, we get excellent features. Read more for details. Intro Do you work a lot with templates and meta-programming? With C++17 we get a few nice improvements: some are quite small, but also there are notable features as well!
| | kuruczgy.com
Introduction to dependent types and the Curry-Howard isomorphism
21.0 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...