Menu Close
  • Categories
  • Tags
  • About
Close
    • Type Unknown
    • Categories
    • Tags
    • Search

    Posts By Tag

    • C++ 5
    • Fortran 3
    • Metamath 1
    • array programming 3
    • computer vision 1
    • constexpr 1
    • folds 1
    • metaprogramming 4
    • retrogaming 1
    • templates 2
    • videogames 1

    C++

    • C++20 Compile-time Metamath Proof Verification using C'est Nov 14, 2020
    • Swapping the Contents of n Variables Jan 08, 2019
    • The Maximum Score in Super Don Quix-ote Jun 24, 2015
    • Building, say, indices<6,4,2,0,-2,-4> Dec 03, 2012
    • A compile-time FFT in C++11 Sep 02, 2012

    Fortran

    • Diagonal Selection Feb 06, 2011
    • Scanners! Sep 06, 2010
    • Fragrant Fortran Feb 23, 2010

    Metamath

    • C++20 Compile-time Metamath Proof Verification using C'est Nov 14, 2020

    array programming

    • Diagonal Selection Feb 06, 2011
    • Scanners! Sep 06, 2010
    • Fragrant Fortran Feb 23, 2010

    computer vision

    • The Maximum Score in Super Don Quix-ote Jun 24, 2015

    constexpr

    • C++20 Compile-time Metamath Proof Verification using C'est Nov 14, 2020

    folds

    • Swapping the Contents of n Variables Jan 08, 2019

    metaprogramming

    • C++20 Compile-time Metamath Proof Verification using C'est Nov 14, 2020
    • Swapping the Contents of n Variables Jan 08, 2019
    • Building, say, indices<6,4,2,0,-2,-4> Dec 03, 2012
    • A compile-time FFT in C++11 Sep 02, 2012

    retrogaming

    • The Maximum Score in Super Don Quix-ote Jun 24, 2015

    templates

    • Building, say, indices<6,4,2,0,-2,-4> Dec 03, 2012
    • A compile-time FFT in C++11 Sep 02, 2012

    videogames

    • The Maximum Score in Super Don Quix-ote Jun 24, 2015

    Back to Top

    About

    The blog of Dr. Paul Keir.

    Theme Simple Texture developed by Yi Zeng, powered by Jekyll.

    Back to Top