connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x, y) x normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x,y) x + normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually

connection is that regular expressions are themselves input as strings, which are parsed into a state ma- chine that can be used to efficiently search for patterns in strings. In Julia, regular expressions functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is: julia> function f(x,y) x + normal code blocks. There are many possible uses quite different from map, such as managing system state. For example, there is a version of open that runs code ensuring that the opened file is eventually