AbstractC++ template metaprogramming is often regarded as a functional language, however, nowadays metaprogram libraries are not implemented in functional programming style. In this paper we discuss a compile-time graph-rewriting engine based on the properties of the functional language Clean. The most important property imported from the functional paradigm is the lazy evaluation strategy. With the help of the engine it is possible to embed lazy functional-style code into C++ programs, and transform it into template metaprograms. We present the implemented lazy evaluation strategy by examples including also infinite lists
Template metaprogramming is an emerging new direction in C++ programming for executing algorithms in...
The goal of this thesis is to create a suitable standard for evaluating lazy evaluation techniques, ...
AbstractMore and more C++ applications use template metaprograms directly or indirectly by using lib...
AbstractC++ template metaprogramming is often regarded as a functional language, however, nowadays m...
Template metaprogramming is an emerging new direction of gen-erative programming: with the clever de...
This paper describes the Boost C++ template metaprogramming library (MPL), an extensible compile-tim...
AbstractMore and more C++ applications use template metaprograms directly or indirectly by using lib...
The template system of C++ is expressive enough to allow the programmer to write programs which are ...
Domain specific languages embedded in C++ (EDSLs) often use the techniques of template metaprogrammi...
Abstract. Template metaprogramming (TMP) is an emerging new di-rection in C++ programming for execut...
We propose a new extension to the purely functional programming language Haskell that supports compi...
Any partial recursive function can be computed at compile time, using C++ templates to define primi...
Partial evaluation is a high-level optimization technique that, given a program text and some of its...
In the recent years a multitude of functional language implementations has been developed, whereby t...
Template metaprograms have become an essential part of today’s C++ programs: with proper template de...
Template metaprogramming is an emerging new direction in C++ programming for executing algorithms in...
The goal of this thesis is to create a suitable standard for evaluating lazy evaluation techniques, ...
AbstractMore and more C++ applications use template metaprograms directly or indirectly by using lib...
AbstractC++ template metaprogramming is often regarded as a functional language, however, nowadays m...
Template metaprogramming is an emerging new direction of gen-erative programming: with the clever de...
This paper describes the Boost C++ template metaprogramming library (MPL), an extensible compile-tim...
AbstractMore and more C++ applications use template metaprograms directly or indirectly by using lib...
The template system of C++ is expressive enough to allow the programmer to write programs which are ...
Domain specific languages embedded in C++ (EDSLs) often use the techniques of template metaprogrammi...
Abstract. Template metaprogramming (TMP) is an emerging new di-rection in C++ programming for execut...
We propose a new extension to the purely functional programming language Haskell that supports compi...
Any partial recursive function can be computed at compile time, using C++ templates to define primi...
Partial evaluation is a high-level optimization technique that, given a program text and some of its...
In the recent years a multitude of functional language implementations has been developed, whereby t...
Template metaprograms have become an essential part of today’s C++ programs: with proper template de...
Template metaprogramming is an emerging new direction in C++ programming for executing algorithms in...
The goal of this thesis is to create a suitable standard for evaluating lazy evaluation techniques, ...
AbstractMore and more C++ applications use template metaprograms directly or indirectly by using lib...