diff --git a/src/MathOptSymbolicAD.jl b/src/MathOptSymbolicAD.jl
index a6477d4..163e016 100644
--- a/src/MathOptSymbolicAD.jl
+++ b/src/MathOptSymbolicAD.jl
@@ -5,13 +5,10 @@
 
 module MathOptSymbolicAD
 
-import Base.Meta: isexpr
-import MathOptInterface
+import MathOptInterface as MOI
 import SparseArrays
 import Symbolics
 
-const MOI = MathOptInterface
-
 abstract type AbstractSymbolicBackend <:
               MOI.Nonlinear.AbstractAutomaticDifferentiation end
 
diff --git a/src/nonlinear_oracle.jl b/src/nonlinear_oracle.jl
index e64712f..d32912d 100644
--- a/src/nonlinear_oracle.jl
+++ b/src/nonlinear_oracle.jl
@@ -172,7 +172,7 @@ Parse `expr` into `f` and return a `_Node`.
     This function gets called recursively.
 """
 function _Node(f::_Function, expr::Expr)
-    @assert isexpr(expr, :call)
+    @assert Meta.isexpr(expr, :call)
     # Performance optimization: most calls will be unary or binary
     # operators. Therefore, we can specialize an if-statement to handle the
     # common cases without needing to splat.