Introduction

Overview

• It's based on a notion of objects as extensible records.
• A binding may behave simultaneously as a value or a function application.
• Expressions are lexically scoped. That is, the value associated with a variable is determined by nearest enclosing definition.
• As in Ocaml, a list is an immutable, finite sequence of elements of the same type.
• Plex supports eager evaluation and some form of lazy evaluation where possible
• Pure code is the default in Plex. As in Ocaml, there are imperative programming constructs such as for and while loops and also ref for getting a reference to mutable data.
• Functions are first-class values so they can be passed around, used in tuples or lists and even mapped to keys in records
• Plex has dynamic types. Where possible, Plex tries to check the integrity of programs statically -- that is, at compile time.