diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h b/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
index e1fae9c1958..f75c2e8df07 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
@@ -168,7 +168,7 @@ template <class Base_> struct Kernel_d_interface : public Base_ {
 	  typedef Kernel R_; // for the macro
 	  CGAL_FUNCTOR_INIT_STORE(Compute_squared_radius_d)
 	  typedef FT result_type;
-	  template<class S> FT operator()(CGAL_FORWARDABLE(S) s)const{
+	  template<class S> FT operator()(S&& s)const{
 	    return typename Get_functor<Base, Squared_radius_tag>::type(this->kernel())(CGAL_FORWARD(S,s));
 	  }
 	  template<class I> FT operator()(I b, I e)const{
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/constructors.h b/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/constructors.h
index f61f80a79f0..4ec34b0454d 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/constructors.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/constructors.h
@@ -89,7 +89,7 @@ namespace CGAL {
 
     struct Iterator_and_last {
       template<typename Iter,typename T>
-	result_type operator()(int d,Iter const& f,Iter const& e,CGAL_FORWARDABLE(T) t) const {
+	result_type operator()(int d,Iter const& f,Iter const& e,T&& t) const {
 	  check_dim(d);
 	  CGAL_assertion(d==std::distance(f,e)+1);
 	  result_type a(d);
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h b/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
index ddce8b7ead2..85cdad76330 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
@@ -37,7 +37,7 @@ struct Nth_iterator_element : private Store_kernel<K> {
   Nth_iterator_element(){}
   Nth_iterator_element(K const&k):Store_kernel<K>(k){}
   typedef typename Get_type<K, typename iterator_tag_traits<T>::value_tag>::type result_type;
-  template<class U> result_type operator()(CGAL_FORWARDABLE(U) u, int i) const {
+  template<class U> result_type operator()(U&& u, int i) const {
     typename Get_functor<K, Construct_ttag<T> >::type ci(this->kernel());
     return *cpp0x::next(ci(CGAL_FORWARD(U,u),Begin_tag()),i);
   }
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Types/Segment.h b/NewKernel_d/include/CGAL/NewKernel_d/Types/Segment.h
index cca4b3d6754..feba00c8f2b 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Types/Segment.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Types/Segment.h
@@ -82,7 +82,7 @@ template<class R_> struct Construct_segment : Store_kernel<R_> {
 	}
 	// T should only be std::piecewise_construct_t, but we shouldn't fail if it doesn't exist.
 	template<class T,class U,class V>
-	result_type operator()(CGAL_FORWARDABLE(T),CGAL_FORWARDABLE(U) u,CGAL_FORWARDABLE(V) v)const{
+	result_type operator()(T&&, U&& u, V&& v)const{
 		CP cp(this->kernel());
 		result_type r = {{
 			call_on_tuple_elements<Point>(cp, CGAL_FORWARD(U,u)),
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
index 71e17313ced..c63b8b179af 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
@@ -93,7 +93,7 @@ template<class NT_,class Dim_,class Max_dim_=Dim_> struct Array_vector {
 
 		struct Iterator_and_last {
 			template<typename Iter,typename T>
-                        Vector operator()(unsigned  CGAL_assertion_code(d),Iter const& f,Iter const& e,CGAL_FORWARDABLE(T) t) const {
+                        Vector operator()(unsigned  CGAL_assertion_code(d),Iter const& f,Iter const& e,T&& t) const {
 					CGAL_assertion(d==std::distance(f,e)+1);
 					CGAL_assertion(d<=d_);
 					//TODO: optimize for forward iterators
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h
index 1f2023c0785..74f221ad1de 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h
@@ -73,7 +73,7 @@ template<class NT_,class Dim_,class Max_dim_=Dim_> struct Vector_vector {
 
 		struct Iterator_and_last {
 			template<typename Iter,typename T>
-				Vector operator()(int d,Iter const& f,Iter const& e,CGAL_FORWARDABLE(T) t) const {
+				Vector operator()(int d,Iter const& f,Iter const& e,T&& t) const {
 					CGAL_assertion(d==std::distance(f,e)+1);
 					Vector a;
 					a.reserve(d+1);
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/utils.h b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
index 5afe9c2b844..b467741ffc9 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/utils.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
@@ -31,7 +31,6 @@
 
 #include <type_traits>
 #include <utility>
-#define CGAL_FORWARDABLE(T) T&&
 #define CGAL_FORWARD(T,t) std::forward<T>(t)
 #include <boost/utility/enable_if.hpp>
 #include <boost/preprocessor/repetition.hpp>