DOCSLIB.ORG

Meta-Meta-Programming Generating C++ Template Metaprograms with Racket Macros

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Meta-Meta-Programming Generating C++ Template Metaprograms with Racket Macros Meta-Meta-Programming Generating C++ Template Metaprograms with Racket Macros Michael Ballantyne Chris Earl Matthew Might University of Utah University of Utah University of Utah [email protected] [email protected] [email protected] Abstract processor macros scale poorly as our code generation needs Domain specific languages embedded in C++ (EDSLs) often become more complex. use the techniques of template metaprogramming and ex- For the implementation of Nebo, an EDSL we’ve pub- pression templates. However, these techniques can require lished on previously [4, 5], we instead chose to implement verbose code and introduce maintenance and debugging a code generator for C++ in Racket. It allows us to describe challenges. This paper presents a tool written in Racket for the implementation of the interface functions once and sub- generating C++ programs, paying particular attention to the sequently generate the C++ code for many operators. For ex- challenges of metaprogramming. The code generator uses ample, we write the following to generate both the interface Racket’s macros to provide syntax for defining C++ meta- functions and expression template objects for the operators functions that is more concise and offers more opportunity +, *, and others besides: for error checking than that of native C++. (build-binary-operator 'SumOp '+ (add-spaces 'operator '+)) 1. Introduction (build-binary-operator 'ProdOp '* Embedded domain specific languages (EDSLs) in C++ have (add-spaces 'operator '*)) proven to be an effective way to introduce new programming (build-binary-logical-operator 'AndOp '&& abstractions to fields like scientific computing. implement- (add-spaces 'operator '&&)) ing C++ EDSLs with a popular technique known as expres- (build-unary-logical-function 'NotOp '! sion templates [16] requires many similar function defini- (add-spaces 'operator '!)) tions and operator overloads. The code below shows part of (build-extremum-function 'MaxFcn '> 'max) the implementation for the operators + and * from one such Note that our EDSL provides several types of operator, each EDSL. with different syntactic rules. Our code generator allows template<typename LHS, typename RHS> these operators to cleanly share much of their implementa- typename BinExprRetType<SumOp, LHS, RHS>::result tion. operator+(const LHS & lhs, const RHS & rhs) { Given that we use our code generator to eliminate repetion return binExpr<SumOp>(lhs, rhs); in interface functions, it would be natural to also generate } other components of our EDSL implementation for which the C++ code is difficult to understand and maintain. For template<typename LHS, typename RHS> example, to provide syntax checking for our EDSL we use typename BinExprRetType<MultOp, LHS, RHS>::result template metaprogramming [14] to compute functions from operator*(const LHS & lhs, const RHS & rhs) { types to types, known as metafunctions. The C++ imple- return binExpr<MultOp>(lhs, rhs); mentation of one such metafunction is shown in Figure 1. } Racket’s metaprogramming abilities allow us to write the same metafunction through the following code: The details of these implementations are beyond the (define/meta (join-location l1 l2) scope of this paper, but we need to produce this kind of [('SingleValue 'SingleValue) 'SingleValue] function for each operator in our EDSL, and they’re all quite [('SingleValue l) l] similar. In this case, each differs only by the symbol for the [(l 'SingleValue) l] operator (+, *) and the name of the class that implements it [(l l) l]) (SumOp, MultOp). Expression template EDSL implementa- tions often use C preprocessor macros to reduce this dupli- This paper discusses the design and implementation of cation [9, 15]. However, as we discuss in Section 3.4, pre- our code generator. Specifically, our contributions are: template<typename L1, typename L2 > rhs <<= divX( interpX(alpha) * gradX(phi) ) struct JoinLocation; + divY( interpY(alpha) * gradY(phi) ); template< > phi <<= phi + deltaT * rhs; struct JoinLocation<SingleValue, SingleValue > { SingleValue typedef result; phi <<= cond( left, 10.0 ) }; ( right, 0.0 ) ( top || bottom, 5.0 ) template<typename L > ( phi ); struct JoinLocation<SingleValue, L > { L typedef result; Figure 2. Iteration of the solution to the 2D heat equation }; with Nebo template<typename L > cialization of generic code to achieve more general program struct JoinLocation<L, SingleValue > { transformations. [16]. C++ objects can be used to implement L typedef result; the abstract syntax tree of an embedded domain specific lan- }; guage, while functions and overloaded operators that con- struct those tree elements define its grammar and type sys- template<typename L > tem. This technique is referred to as expression templates struct JoinLocation<L, L > { (ET) for reasons we’ll see shortly. L typedef result; }; 2.1 Deforestation As an example, consider pointwise addition of vectors: Figure 1. C++ metafunction std::vector<int> a, b, c, d; d = a + b + c; • A strategy for generating C++ EDSL implementations A straightforward way to implement such syntax in C++ with a Racket code generator (Section 3). Our code gen- would be to overload the + operator to loop over the vectors erator is publicly available at https://github.com/ it receives as arguments and construct a new vector with the michaelballantyne/fulmar. It allows EDSL devel- result. Given more than one instance of such an operator on opers to use Racket as an expressive metaprogramming the right hand side of an assignment, however, this approach language while EDSL users continue to write in C++. We allocates memory proportional to the size of the vectors for show that this approach makes iterative development of each operator call. EDSLs easier (Section 3.3). Instead, each + operator call can construct an object with • A EDSL in Racket that corresponds to C++ metafunc- an eval(int i) method that evaluates the operation at a tions, with concise syntax and integration with our code single index. The object is an instance of a templated class generation approach (Section 4). Syntactic correctness of parameterized by the types of its arguments, which may the definition and use of the metafunctions is checked at be either std::vector or themselves represent parts of a Racket runtime as the C++ implementation of the EDSL computation like the type of a + b above. The loop over is generated. (Section 4.5). The syntax of the EDSL in indices doesn’t happen until the = assignment operator is Racket elucidates the relationship between Scheme-style invoked; it calls the eval method on the right hand side for pattern matching and C++ template metaprogramming each index in turn and updates the vector on the left hand (Section 4.3). side. • Discussion of the tradeoffs of using the Racket-based The templated classes for the objects representing a com- code generator as opposed to preprocessor macros in putation are referred to as expression templates. This par- the context of expression template based C++ EDSLs ticular use of the delayed evaluation they offer corresponds (Section 3.4). to the deforestation optimizations that Haskell compilers use to remove temporaries from composed list functions [8]. Be- cause the C++ compiler lacks such optimizations, C++ pro- 2. Expression Templates grammers pursuing high performance achieve the same ef- C++ provides limited means to transform code at compile fect with expression templates. time through preprocessor macros and the template system. While the template system was originally designed as a 2.2 Accelerator Portability with Nebo generic programming mechanism, C++ programmers have Another application of expression templates allows compi- devised ways to use the object system and compile-time spe- lation of a single code base for multiple architectures, in- cluding accelerators like GPUs and Intel’s Xeon Phi [2]. Our Code generation for our C++ EDSL presents a unique C++ EDSL, Nebo, is of this variety [4]. Figure 2 shows a set of requirements. The purpose of the EDSL is to offer simple use of Nebo. Client code using Nebo is compiled with programmers new abstractions within C++ by transform- variants for both CPU and GPU execution, with the decision ing the expressions they provide at C++ compile time, so of which to use being delayed until runtime. we can only use the code generator to produce the imple- To implement accelerator portability, expression tem- mentation of the language. Users of the language are deliv- plate objects have parallel objects implementing the com- ered C++ header files containing the template metaprograms putation on each device. For the deforestation example the that operate on expressions written the EDSL. Furthermore, EDSL implementation might include SumOpEvalCPU and the EDSL integrates with runtime support code for mem- SumOpEvalGPU classes. The initial expression template ob- ory management and threading maintained by C++ program- ject constructed by operators and representing the abstract mers. The C++ we generate needs to be human readable so operator has methods that construct these parallel trees. those programmers can understand and debug the interaction Once the assignment operation has selected a device on of the EDSL with the code they maintain. which to execute the expression, it calls such a method to Because we’re generating C++ source code, we’re re- obtain the appropriate code variant. sponsible for: Expression templates for accelerator portability form an extension of the technique used for deforestation. Use of an • Source code
Load more

Recommended publications
  • C++ Metastring Library and Its Applications⋆
    C++ Metastring Library and its Applications! Zal´anSz˝ugyi, Abel´ Sinkovics, Norbert Pataki, and Zolt´anPorkol´ab Department of Programming Languages and Compilers, E¨otv¨osLor´andUniversity P´azm´any P´eter s´et´any 1/C H-1117 Budapest, Hungary {lupin, abel, patakino, gsd}@elte.hu Abstract. C++ template metaprogramming is an emerging direction of generative programming: with proper template definitions wecanenforce the C++ compiler to execute algorithms at compilation time. Template metaprograms have become essential part of today’s C++ programs of industrial size; they provide code adoptions, various optimizations, DSL embedding, etc. Besides the compilation time algorithms, template metaprogram data-structures are particularly important. From simple typelists to more advanced STL-like data types there are a variety of such constructs. Interesting enough, until recently string, as one of the most widely used data type of programming, has not been supported. Al- though, boost::mpl::string is an advance in this area, it still lacks the most fundamental string operations. In this paper, we analysed the pos- sibilities of handling string objects at compilation time with a metastring library. We created a C++ template metaprogram library that provides the common string operations, like creating sub-strings, concatenation, replace, and similar. To provide real-life use-cases we implemented two applications on top of our Metastring library. One use case utilizes com- pilation time inspection of input in the domain of pattern matching al- gorithms, thus we are able to select the more optimal search method at compilation time. The other use-case implements safePrint, a type-safe version of printf –awidelyinvestigatedproblem.Wepresentboththe performance improvements and extended functionality we haveachieved in the applications of our Metastring library.
    [Show full text]
  • 13 Templates-Generics.Pdf
    CS 242 2012 Generic programming in OO Languages Reading Text: Sections 9.4.1 and 9.4.3 J Koskinen, Metaprogramming in C++, Sections 2 – 5 Gilad Bracha, Generics in the Java Programming Language Questions • If subtyping and inheritance are so great, why do we need type parameterization in object- oriented languages? • The great polymorphism debate – Subtype polymorphism • Apply f(Object x) to any y : C <: Object – Parametric polymorphism • Apply generic <T> f(T x) to any y : C Do these serve similar or different purposes? Outline • C++ Templates – Polymorphism vs Overloading – C++ Template specialization – Example: Standard Template Library (STL) – C++ Template metaprogramming • Java Generics – Subtyping versus generics – Static type checking for generics – Implementation of Java generics Polymorphism vs Overloading • Parametric polymorphism – Single algorithm may be given many types – Type variable may be replaced by any type – f :: tt => f :: IntInt, f :: BoolBool, ... • Overloading – A single symbol may refer to more than one algorithm – Each algorithm may have different type – Choice of algorithm determined by type context – Types of symbol may be arbitrarily different – + has types int*intint, real*realreal, ... Polymorphism: Haskell vs C++ • Haskell polymorphic function – Declarations (generally) require no type information – Type inference uses type variables – Type inference substitutes for variables as needed to instantiate polymorphic code • C++ function template – Programmer declares argument, result types of fctns – Programmers
    [Show full text]
  • Functional Programming with C++ Template Metaprograms
    Functional Programming with C++ Template Metaprograms Zolt´an Porkol´ab E¨otv¨os Lor´and University, Faculty of Informatics Dept. of Programming Languages and Compilers P´azm´any P´eter s´et´any 1/C H-1117 Budapest, Hungary [email protected] Abstract. Template metaprogramming is an emerging new direction of generative programming: with the clever definitions of templates we can enforce the C++ compiler to execute algorithms at compilation time. Among the application areas of template metaprograms are the expres- sion templates, static interface checking, code optimization with adap- tion, language embedding and active libraries. However, as this feature of C++ was not an original design goal, the language is not capable of elegant expression of template metaprograms. The complicated syn- tax leads to the creation of code that is hard to write, understand and maintain. Despite that template metaprogramming has a strong rela- tionship with functional programming paradigm, language syntax and the existing libraries do not follow these requirements. In this paper we give a short and incomplete introduction to C++ templates and the ba- sics of template metaprogramming. We will enlight the role of template metaprograms, some important and widely used idioms and techniques. 1 Introduction Templates are key elements of the C++ programming language [3, 32]. They enable data structures and algorithms to be parameterized by types, thus cap- turing commonalities of abstractions at compilation time without performance penalties at runtime [37]. Generic programming [28, 27, 17] is a recently popu- lar programming paradigm, which enables the developer to implement reusable codes easily. Reusable components { in most cases data structures and algo- rithms { are implemented in C++ with the heavy use of templates.
    [Show full text]
  • A Tool for the Evaluation of the Complexity of Programs Using C++ Templates
    COMPUTATION TOOLS 2011 : The Second International Conference on Computational Logics, Algebras, Programming, Tools, and Benchmarking A Tool for the Evaluation of the Complexity of Programs Using C++ Templates Nicola Corriero, Emanuele Covino and Giovanni Pani Dipartimento di Informatica Università di Bari Italy Email: (corriero|covino|pani)@di.uniba.it Abstract—We investigate the relationship between C++ tem- template <int X> class pow<0,X> plate metaprogramming and computational complexity, show- {public: enum {result=1};}; ing how templates characterize the class of polynomial-time computable functions, by means of template recursion and specialization. Hence, standard C++ compilers can be used as The command line int z=pow<3,5>::result, produces at a tool to certify polytime-bounded programs. compile time the value 125, since the operator A::B refers to Keywords-Partial evaluation; C++ template metaprogram- the symbol B in the scope of A; when reading the command ming; polynomial-time programs. pow<3,5>::result, the compiler triggers recursively the template for the values <2,5>, <1,5>, until it eventually I. INTRODUCTION hits <0,5>. This final case is handled by the partially According to [7], template metaprograms consist of specialized template pow<0,X>, that returns 1. Instructions classes of templates operating on numbers and types as like enum{result = function<args>::result;} represent the a data. Algorithms are expressed using template recursion step of the recursive evaluation of function, and produce the as a looping construct and template specialization as a intermediate values. This computation happens at compile conditional construct. Template recursion involves the use time, since enumeration values are not l-values, and when of class templates in the construction of its own member one pass them to the recursive call of a template, no static type or member constant.
    [Show full text]
  • Subroutines and Control Abstraction8
    Subroutines and Control Abstraction8 8.4.4 Generics in C++, Java, and C# Though templates were not officially added to C++ until 1990, when the language was almost ten years old, they were envisioned early in its evolution. C# generics, likewise, were planned from the beginning, though they actually didn’t appear until the 2.0 release in 2004. By contrast, generics were deliberately omitted from the original version of Java. They were added to Java 5 (also in 2004) in response to strong demand from the user community. C++Templates EXAMPLE 8.69 Figure 8.13 defines a simple generic class in C++ that we have named an Generic arbiter class in arbiter. The purpose of an arbiter object is to remember the “best instance” C++ it has seen of some generic parameter class T. We have also defined a generic chooser class that provides an operator() method, allowing it to be called like a function. The intent is that the second generic parameter to arbiter should be a subclass of chooser, though this is not enforced. Given these definitions we might write class case_sensitive : chooser<string> { public: bool operator()(const string& a, const string& b){returna<b;} }; ... arbiter<string, case_sensitive> cs_names; // declare new arbiter cs_names.consider(new string("Apple")); cs_names.consider(new string("aardvark")); cout << *cs_names.best() << "\n"; // prints "Apple" Alternatively, we might define a case_insensitive descendant of chooser, whereupon we could write Copyright c 2009 by Elsevier Inc. All rights reserved. 189 CD_Ch08-P374514 [11:51 2009/2/25] SCOTT: Programming Language Pragmatics Page: 189 379–215 190 Chapter 8 Subroutines and Control Abstraction template<class T> class chooser { public: virtual bool operator()(const T& a, const T& b) = 0; }; template<class T, class C> class arbiter { T* best_so_far; C comp; public: arbiter() { best_so_far = 0; } void consider(T* t) { if (!best_so_far || comp(*t, *best_so_far)) best_so_far = t; } T* best() { return best_so_far; } }; Figure 8.13 Generic arbiter in C++.
    [Show full text]
  • Compile-Time Symbolic Differentiation Using C++ Expression Templates
    Abstract Template metaprogramming is a popular technique for implementing compile time mechanisms for numerical computing. We demonstrate how expression templates can be used for compile time symbolic differentiation of algebraic expressions in C++ computer programs. Given a positive integer N and an algebraic function of multiple variables, the compiler generates executable code for the Nth partial derivatives of the function. Compile-time simplification of the derivative expressions is achieved using recursive tem- plates. A detailed analysis indicates that current C++ compiler technology is already sufficient for practical use of our results, and highlights a number of issues where further improvements may be desirable. arXiv:1705.01729v1 [cs.SC] 4 May 2017 1 Compile-Time Symbolic Differentiation Using C++ Expression Templates Drosos Kourounis1, Leonidas Gergidis2, Michael Saunders3, Andrea Walther4, and Olaf Schenk1 1Università della Svizzera italiana 2University of Ioannina 3Stanford University 4University of Paderborn 1 Introduction Methods employed for the solution of scientific and engineering problems often require the evaluation of first or higher-order derivatives of algebraic functions. Gradient methods for optimization, Newton’s method for the solution of nonlinear systems, numerical solu- tion of stiff ordinary differential equations, stability analysis: these are examples of the major importance of derivative evaluation. Computing derivatives quickly and accurately improves both the efficiency and robustness of such numerical algorithms. Automatic differentiation tools are therefore increasingly available for the important programming languages; see www.autodiff.org. There are three well established ways to compute derivatives: Numerical derivatives. These use finite-difference approximations [22]. They avoid the difficulty of very long exact expressions, but introduce truncation errors and this usually affects the accuracy of further computations.
    [Show full text]
  • Application of Model-Driven Engineering and Metaprogramming to DEVS Modeling & Simulation
    Application of Model-Driven Engineering and Metaprogramming to DEVS Modeling & Simulation Luc Touraille To cite this version: Luc Touraille. Application of Model-Driven Engineering and Metaprogramming to DEVS Model- ing & Simulation. Other. Université Blaise Pascal - Clermont-Ferrand II, 2012. English. NNT : 2012CLF22308. tel-00914327 HAL Id: tel-00914327 https://tel.archives-ouvertes.fr/tel-00914327 Submitted on 5 Dec 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. D.U.: 2308 E.D.S.P.I.C: 594 Ph.D. Thesis submitted to the École Doctorale des Sciences pour l’Ingénieur to obtain the title of Ph.D. in Computer Science Submitted by Luc Touraille Application of Model-Driven Engineering and Metaprogramming to DEVS Modeling & Simulation Thesis supervisors: Prof. David R.C. Hill Dr. Mamadou K. Traoré Publicly defended on December 7th, 2012 in front of an examination committee composed of: Reviewers: Prof. Jean-Pierre Müller, Cirad, Montpellier Prof. Gabriel A. Wainer, Carleton University, Ottawa Supervisors: Prof. David R.C. Hill, Université Blaise Pascal, Clermont-Ferrand Dr. Mamadou K. Traoré, Université Blaise Pascal, Clermont- Ferrand Examiners Dr. Alexandre Muzy, Università di Corsica Pasquale Paoli, Corte Prof.
    [Show full text]
  • Object-Oriented Programming for Scientific Computing Template Metaprogramming
    Object-Oriented Programming for Scientific Computing Template Metaprogramming Ole Klein Interdisciplinary Center for Scientific Computing Heidelberg University [email protected] 18. Juli 2017 Ole Klein (IWR) Object-Oriented Programming 18. Juli 2017 1 / 42 Template Metaprogramming Calculating the Square Root We can calculate the square root of N as follows, using nested intervals: #include<iostream> template<std::size_t N, std::size_t L = 1, std::size_t H = N> struct Sqrt { enum{ mid = (L+H+1)/2 }; enum{ value = (N<mid*mid) ? (std::size_t)Sqrt<N,L ,mid-1>::value : (std::size_t)Sqrt<N,mid,H >::value }; }; template<std::size_t N, std::size_t M> struct Sqrt<N,M,M> { enum{ value = M }; }; int main() { std::cout << Sqrt<9>::value <<" " << Sqrt<42>::value << std::endl; } Ole Klein (IWR) Object-Oriented Programming 18. Juli 2017 2 / 42 Template Metaprogramming Template Instantiations • Calculating Sqrt<9> first leads to the execution of: Sqrt<9,1,9>::value = (9<25) ? Sqrt<9,1,4>::value : Sqrt<9,5,9>::value = Sqrt<9,1,4>::value • As a result Sqrt<9,1,4> is calculated next: Sqrt<9,1,4>::value = (9<9) ? Sqrt<9,1,2>::value : Sqrt<9,3,4>::value = Sqrt<9,3,4>::value • The next recursion step is then: Sqrt<9,3,4>::value = (9<16) ? Sqrt<9,3,3>::value : Sqrt<9,4,3>::value = Sqrt<9,3,3>::value = 3 \item This produces the desired result. Ole Klein (IWR) Object-Oriented Programming 18. Juli 2017 3 / 42 Template Metaprogramming Template Instantiations • However, there is a problem with the ternary operator <condition> ? <true-path> : <false-path> • The compiler generates not just the relevant part, but also the one that won't be used and isn't needed.
    [Show full text]
  • Variadic Templates for C++0X
    Vol. 7, No. 2, Special Issue OOPS Track at SAC 2007, February 2008 Variadic Templates for C++0x Douglas Gregor, Department of Computer Science, Indiana University, USA Jaakko J¨arvi, Department of Computer Science, Texas A&M University, USA Generic functions and classes typically accept a fixed number of type arguments. How- ever, generic functions and classes that accept a variable number of type arguments have proven to be a very useful, even though there is no support for this feature in C++. Numerous foundational libraries rely on clever template and preprocessor tricks to emulate such variable-length templates. By several measures these emulations are inadequate. This paper describes variadic templates, an extension to the C++ lan- guage that significantly improves existing implementations of widely used C++ libraries in terms of code size, quality of error diagnostics, compilation speed, and generality. Furthermore, variadic templates enable new applications, such as type-safe imple- mentations of functions like printf, and improved support for generic mixin classes. Variadic templates are part of the upcoming ISO C++ Standard, dubbed C++0x, and we have integrated variadic templates into the GNU C++ compiler. 1 INTRODUCTION Many situations call for generic functions that accept an arbitrary number of param- eters or generic classes that can be instantiated with any number of type arguments. An example of the former kind is a type-safe, secure version of the printf function in C. A parametrized class representing tuple objects is an example of the latter kind. Both of these above scenarios can be supported with variadic templates, an extension to C++ for types parametrized with a varying number of arguments.
    [Show full text]
  • Introduction to Template Metaprogramming Hans Dembinski, MPIK Heidelberg CORSIKA Workshop, Karlsruhe, Germany (17-20 June 2019)
    Introduction to template metaprogramming Hans Dembinski, MPIK Heidelberg CORSIKA Workshop, Karlsruhe, Germany (17-20 June 2019) 1 Technical note This is a HTML talk, you can click on any blue text, it is a link. 2 About me Cosmic ray/HEP physicist now in LHCb Trying to solve the Muon Puzzle in air showers Active in the Boost C++ and Scikit-HEP Python communities My OSS projects Boost::Histogram iminuit (maintainer) pyhepmc 3 Take-home message Template metaprogramming (TMP) is about computing with types Not as scary as it sounds Useful for library writers Used to look like arcane magic in pre-C++11, getting better Uses Avoid code repetition (DRY = Don’t Repeat Yourself) Static function/method dispatch Mixins (CRTP = Curriously-Reoccuring-Template-Pattern) Compile-time arithmetic calculations (but use constexpr) 4 C++ is strongly-typed language Strongly-typed? Every variable has distinct type Functions/methods/operators only work on matching types Detect errors at compile-time rather than run-time int add(int a, int b) { return a + b; } int main() { // this is an error, because int add(int, const char*) is not defined int x = add(1, "1"); } Some implicit type conversions allowed float → double , but also int → char and int → unsigned ⚠ Question: What does static_cast<unsigned>(-1) do? 5 … but type-safety can lead to code repetition Sometimes same code, except for the types // urgh, have to write two almost identical functions for `int` and `double` int add(int a, int b) { return a + b; } double add(double a, double b) { return a + b;
    [Show full text]
  • The Connection Between C++ Template Metaprogramming and Functional Programming
    The connection between C++ template metaprogramming and functional programming Doctoral dissertation 2013 Abel´ Sinkovics [email protected] Thesis advisor: Zolt´an Porkol´ab, PhD E¨otv¨os Lor´and University, Faculty of Informatics, 1117 Budapest, P´azm´any P´eter s´et´any 1/C ELTE IK Doctoral School Doctoral program: Az informatika alapjai ´es m´odszertana Head of the doctoral school: Dr. Andr´as Bencz´ur, academicer Head of the doctoral program: Dr. J´anos Demetrovics, academicer The Project is supported by the European Union and co-financed by the European Social Fund (grant agreement no. TAMOP 4.2.1./B-09/1/KMR-2010-0003). 2 Contents I Introduction 6 I.1 Motivation............................ 8 I.2 Structureofthedissertation . 8 I.3 Contributions .......................... 10 II Introductiontotemplatemetaprogramming 12 II.1 Firstexample:factorial. 12 II.2 Templatemetafunctions . 13 II.3 Boxedvalues........................... 14 II.4 Selectionconstructs . 15 II.5 Higherordermetafunctions. 17 II.6 Connectiontofunctionallanguages . 18 III Functionallanguageelements 19 III.1 Laziness ............................. 19 III.1.1 Laziness and recursive metafunctions . 21 III.1.2 Template metaprogramming values . 24 III.1.3 Changing the evaluation strategy of expressions . 27 III.2 Currying............................. 34 III.3 Algebraicdatatypes . 38 III.3.1 Laziness ......................... 39 III.3.2 Currying......................... 40 III.4 Typeclasses ........................... 41 III.5 Angle-bracket expressions as first class citizens . .... 45 III.5.1 Syntaxes......................... 45 III.5.2 Variables......................... 46 III.5.3 Letexpressions . 47 III.5.4 Lambdaexpressions . 55 III.5.5 Recursiveletexpressions . 61 2 III.6 Patternmatching . 64 III.6.1 Usingsyntaxesforpatternmatching . 65 III.6.2 Letexpressions . 68 III.6.3 Caseexpressions .
    [Show full text]
  • Adaptive Object-Modeling Patterns, Tools and Applications
    · Adaptive Object-Modeling Patterns, Tools and Applications December Scientific Supervision by Ademar Aguiar, Assistant Professor Department of Informatics Engineering In partial fulfillment of requirements for the degree of Doctor of Philosophy in Computer Science by the MAPi Joint Doctoral Programme Contact Information: Hugo Sereno Ferreira Faculdade de Engenharia da Universidade do Porto Departamento de Engenharia Informática Rua Dr. Roberto Frias, s/n - Porto Portugal Tel.: + Fax.: + Email: [email protected] URL: http://www.fe.up.pt/ hugosf is thesis was typeset on an Apple® MacBook® Pro running Mac OS® X . using the free LATEX typesetting system, originally developed by Leslie Lamport based on TEX created by Donald Knuth. e body text is set in Minion Pro, a late Renaissance-era type originally designed by Robert Slimbach. Other fonts include Sans and Typewriter from the Computer Modern family, and Courier, a monospaced font originally designed by Howard Kettler at IBM and later redrawn by Adrian Frutiger. Typographical decisions were based on the recommendations given in e Elements of Typographic Style by Robert Bringhurst (), and graphical guidelines were inspired in e Visual Display of Quantitative Information by Edward Tue (). is colophon has exactly one hundred and twenty-two () words, excluding all numbers and symbols. “Adaptive Object-Modeling: Patterns, Tools and Applications” ISBN 978-989-96899-0-9 Copyright © – by Hugo Sereno Ferreira. All rights are reserved. 9 789899 689909 is work was partially funded by and , .. as a doctoral scholarship, ref. ///. …to Helena is page was intentionally le mostly blank. Abstract e field of Soware Engineering () could be regarded as in crisis since the early days of its birth.
    [Show full text]