diff --git a/source/compiler.c b/source/compiler.c
index d82fd12..7bae866 100644
--- a/source/compiler.c
+++ b/source/compiler.c
@@ -18,7 +18,7 @@ void initCompiler(Compiler* compiler) {
 }
 
 //separated out, so it can be recursive
-static int writeLiteralTypeToCacheOpt(LiteralArray* literalCache, Literal literal, bool skipDuplicationOptimisation) {
+static int writeLiteralTypeToCache(LiteralArray* literalCache, Literal literal) {
 	bool shouldFree = false;
 
 	//if it's a compound type, recurse and store the results
@@ -32,7 +32,7 @@ static int writeLiteralTypeToCacheOpt(LiteralArray* literalCache, Literal litera
 
 		for (int i = 0; i < AS_TYPE(literal).count; i++) {
 			//write the values to the cache, and the indexes to the store
-			int subIndex = writeLiteralTypeToCacheOpt(literalCache, ((Literal*)(AS_TYPE(literal).subtypes))[i], false);
+			int subIndex = writeLiteralTypeToCache(literalCache, ((Literal*)(AS_TYPE(literal).subtypes))[i]);
 
 			Literal lit = TO_INTEGER_LITERAL(subIndex);
 			pushLiteralArray(store, lit);
@@ -45,29 +45,16 @@ static int writeLiteralTypeToCacheOpt(LiteralArray* literalCache, Literal litera
 		literal.type = LITERAL_TYPE_INTERMEDIATE; //NOTE: tweaking the type usually isn't a good idea
 	}
 
-	if (!skipDuplicationOptimisation) {
-		//BUGFIX: check if exactly this literal array exists
-		int index = findLiteralIndex(literalCache, literal);
-		if (index < 0) {
-			index = pushLiteralArray(literalCache, literal);
-		}
-
-		if (shouldFree) {
-			freeLiteral(literal);
-		}
-		return index;
+	//optimisation: check if exactly this literal array exists
+	int index = findLiteralIndex(literalCache, literal);
+	if (index < 0) {
+		index = pushLiteralArray(literalCache, literal);
 	}
-	else {
-		int index = pushLiteralArray(literalCache, literal);
-		if (shouldFree) {
-			freeLiteral(literal);
-		}
-		return index;
-	}
-}
 
-static int writeLiteralTypeToCache(LiteralArray* literalCache, Literal literal) {
-	return writeLiteralTypeToCacheOpt(literalCache, literal, false);
+	if (shouldFree) {
+		freeLiteral(literal);
+	}
+	return index;
 }
 
 static int writeNodeCompoundToCache(Compiler* compiler, ASTNode* node) {
@@ -200,7 +187,7 @@ static int writeNodeCollectionToCache(Compiler* compiler, ASTNode* node) {
 			case AST_NODE_VAR_DECL: {
 				//write each piece of the declaration to the cache
 				int identifierIndex = pushLiteralArray(&compiler->literalCache, node->fnCollection.nodes[i].varDecl.identifier); //store without duplication optimisation
-				int typeIndex = writeLiteralTypeToCacheOpt(&compiler->literalCache, node->fnCollection.nodes[i].varDecl.typeLiteral, false);
+				int typeIndex = writeLiteralTypeToCache(&compiler->literalCache, node->fnCollection.nodes[i].varDecl.typeLiteral);
 
 				Literal identifierLiteral =  TO_INTEGER_LITERAL(identifierIndex);
 				pushLiteralArray(store, identifierLiteral);
@@ -214,7 +201,7 @@ static int writeNodeCollectionToCache(Compiler* compiler, ASTNode* node) {
 
 			case AST_NODE_LITERAL: {
 				//write each piece of the declaration to the cache
-				int typeIndex = writeLiteralTypeToCacheOpt(&compiler->literalCache, node->fnCollection.nodes[i].atomic.literal, false);
+				int typeIndex = writeLiteralTypeToCache(&compiler->literalCache, node->fnCollection.nodes[i].atomic.literal);
 
 				Literal typeLiteral = TO_INTEGER_LITERAL(typeIndex);
 				pushLiteralArray(store, typeLiteral);
diff --git a/source/parser.c b/source/parser.c
index bb165e3..75e97a8 100644
--- a/source/parser.c
+++ b/source/parser.c
@@ -418,7 +418,7 @@ static Opcode unary(Parser* parser, ASTNode** nodeHandle) {
 		//temp handle to potentially negate values
 		parsePrecedence(parser, &tmpNode, PREC_TERNARY); //can be a literal
 
-		//check for negative literals (optimisation)
+		//optimisation: check for negative literals
 		if (tmpNode->type == AST_NODE_LITERAL && (IS_INTEGER(tmpNode->atomic.literal) || IS_FLOAT(tmpNode->atomic.literal))) {
 			//negate directly, if int or float
 			Literal lit = tmpNode->atomic.literal;
@@ -888,7 +888,7 @@ ParseRule* getRule(TokenType type) {
 	return &parseRules[type];
 }
 
-//constant folding (optimisation)
+//optimisation: constant folding
 static bool calcStaticBinaryArithmetic(Parser* parser, ASTNode** nodeHandle) {
 	switch((*nodeHandle)->binary.opcode) {
 		case OP_ADDITION:
diff --git a/source/toy_common.h b/source/toy_common.h
index 1f5309d..bee8170 100644
--- a/source/toy_common.h
+++ b/source/toy_common.h
@@ -6,7 +6,7 @@
 
 #define TOY_VERSION_MAJOR 0
 #define TOY_VERSION_MINOR 6
-#define TOY_VERSION_PATCH 4
+#define TOY_VERSION_PATCH 5
 #define TOY_VERSION_BUILD __DATE__ " " __TIME__
 
 //platform exports/imports