diff --git a/src/CartesianProduct.jl b/src/CartesianProduct.jl
index f4585dfe1f..922d00d333 100644
--- a/src/CartesianProduct.jl
+++ b/src/CartesianProduct.jl
@@ -168,7 +168,7 @@ end
 
 # constructor for an empty product with optional size hint and numeric type
 function CartesianProductArray(n::Int=0, N::Type=Float64)::CartesianProductArray
-    arr = Vector{LazySet{N}}(0)
+    arr = Vector{LazySet{N}}()
     sizehint!(arr, n)
     return CartesianProductArray(arr)
 end
diff --git a/src/ConvexHull.jl b/src/ConvexHull.jl
index ef87eafd19..af8b3e9e7f 100644
--- a/src/ConvexHull.jl
+++ b/src/ConvexHull.jl
@@ -142,7 +142,7 @@ end
 
 # constructor for an empty hull with optional size hint and numeric type
 function ConvexHullArray(n::Int=0, N::Type=Float64)::ConvexHullArray
-    a = Vector{LazySet{N}}(0)
+    a = Vector{LazySet{N}}()
     sizehint!(a, n)
     return ConvexHullArray(a)
 end
diff --git a/src/Intersection.jl b/src/Intersection.jl
index e0db760158..4b8387fd7c 100644
--- a/src/Intersection.jl
+++ b/src/Intersection.jl
@@ -162,7 +162,7 @@ end
 
 # constructor for an empty sum with optional size hint and numeric type
 function IntersectionArray(n::Int=0, N::Type=Float64)::IntersectionArray
-    arr = Vector{LazySet{N}}(0)
+    arr = Vector{LazySet{N}}()
     sizehint!(arr, n)
     return IntersectionArray(arr)
 end
diff --git a/src/MinkowskiSum.jl b/src/MinkowskiSum.jl
index 95a0d89ab0..bc7829d99b 100644
--- a/src/MinkowskiSum.jl
+++ b/src/MinkowskiSum.jl
@@ -143,7 +143,7 @@ end
 
 # constructor for an empty sum with optional size hint and numeric type
 function MinkowskiSumArray(n::Int=0, N::Type=Float64)::MinkowskiSumArray
-    arr = Vector{LazySet{N}}(0)
+    arr = Vector{LazySet{N}}()
     sizehint!(arr, n)
     return MinkowskiSumArray(arr)
 end
@@ -286,7 +286,7 @@ CacheMinkowskiSum(arr::Vector{S}) where {N<:Real, S<:LazySet{N}} =
 
 # constructor for an empty sum with optional size hint and numeric type
 function CacheMinkowskiSum(n::Int=0, N::Type=Float64)::CacheMinkowskiSum
-    arr = Vector{LazySet{N}}(0)
+    arr = Vector{LazySet{N}}()
     sizehint!(arr, n)
     return CacheMinkowskiSum(arr)
 end