Index: libcfa/src/concurrency/kernel.hfa
===================================================================
--- libcfa/src/concurrency/kernel.hfa	(revision 68f36f466e0d4b6c66374329d439152ca1c1f7ea)
+++ libcfa/src/concurrency/kernel.hfa	(revision 0f89d4f6038337e8a92e6d44876066ca3eae85f5)
@@ -118,5 +118,5 @@
 static inline void  ?{}(processor & this, const char name[]) { this{name, *mainCluster }; }
 
-static inline Link(processor) * getNext( processor * this ) { return &this->link; }
+static inline Link(processor) * ?`next( processor * this ) { return &this->link; }
 
 //-----------------------------------------------------------------------------
Index: libcfa/src/containers/stackLockFree.hfa
===================================================================
--- libcfa/src/containers/stackLockFree.hfa	(revision 68f36f466e0d4b6c66374329d439152ca1c1f7ea)
+++ libcfa/src/containers/stackLockFree.hfa	(revision 0f89d4f6038337e8a92e6d44876066ca3eae85f5)
@@ -31,5 +31,5 @@
 }; // Link
 
-forall( otype T | { Link(T) * getNext( T * ); } ) {
+forall( otype T | { Link(T) * ?`next( T * ); } ) {
 	struct StackLF {
 		Link(T) stack;
@@ -43,6 +43,6 @@
 		void push( StackLF(T) & this, T & n ) with(this) {
 			for () {									// busy wait
-				*getNext( &n ) = stack;					// atomic assignment unnecessary, or use CAA
-			  if ( __atomic_compare_exchange_n( &stack.atom, &getNext( &n )->atom, (Link(T))@{ {&n, getNext( &n )->count + 1} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) break; // attempt to update top node
+				*( &n )`next = stack;					// atomic assignment unnecessary, or use CAA
+			  if ( __atomic_compare_exchange_n( &stack.atom, &( &n )`next->atom, (Link(T))@{ {&n, ( &n )`next->count + 1} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) break; // attempt to update top node
 			} // for
 		} // push
@@ -53,5 +53,5 @@
 				t = stack;								// atomic assignment unnecessary, or use CAA
 			  if ( t.top == 0p ) return 0p;				// empty stack ?
-			  if ( __atomic_compare_exchange_n( &stack.atom, &t.atom, (Link(T))@{ {getNext( t.top )->top, t.count} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) return t.top; // attempt to update top node
+			  if ( __atomic_compare_exchange_n( &stack.atom, &t.atom, (Link(T))@{ {( t.top )`next->top, t.count} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) return t.top; // attempt to update top node
 			} // for
 		} // pop
@@ -62,9 +62,9 @@
 				T * next = link->top;
 				if( next == node ) {
-					link->top = getNext( node )->top;
+					link->top = ( node )`next->top;
 					return true;
 				}
 				if( next == 0p ) return false;
-				link = getNext(next);
+				link = (next)`next;
 			}
 		}
Index: libcfa/src/heap.cfa
===================================================================
--- libcfa/src/heap.cfa	(revision 68f36f466e0d4b6c66374329d439152ca1c1f7ea)
+++ libcfa/src/heap.cfa	(revision 0f89d4f6038337e8a92e6d44876066ca3eae85f5)
@@ -208,5 +208,5 @@
 
 #if BUCKETLOCK == LOCKFREE
-static inline Link(HeapManager.Storage) * getNext( HeapManager.Storage * this ) { return &this->header.kind.real.next; }
+static inline Link(HeapManager.Storage) * ?`next( HeapManager.Storage * this ) { return &this->header.kind.real.next; }
 static inline void ?{}( HeapManager.FreeHeader & ) {}
 static inline void ^?{}( HeapManager.FreeHeader & ) {}
@@ -665,5 +665,5 @@
 		#else
 		for ( HeapManager.Storage * p = top( freeLists[i].freeList ); p != 0p; /* p = getNext( p )->top */) {
-			typeof(p) temp = getNext( p )->top;			// FIX ME: direct assignent fails, initialization works
+			typeof(p) temp = ( p )`next->top;			// FIX ME: direct assignent fails, initialization works
 			p = temp;
 		#endif // BUCKETLOCK
@@ -901,5 +901,5 @@
 			return oaddr;
 		} // if
-	
+
 		// change size, DO NOT preserve STICKY PROPERTIES.
 		free( oaddr );