Zélus
Manual
Examples
Publications
Contact
Tutorial and Reference
Up
Next
Contents
Part I The Zélus Language
Chapter 1 Synchronous Programming
1.1 The Core Synchronous Language
1.1.1 Point-wise Operations
1.1.2 Delays
1.1.3 Global Declarations
1.1.4 Combinatorial Functions
1.1.5 Stateful Functions
1.1.6 Local and Mutually Recursive Definitions
1.1.7 Shared Memory and Initialization
1.1.8 Causality Check
1.1.9 Initialization Check
1.2 Data types and Pattern Matching
1.2.1 Type Definitions
1.2.2 Pattern Matching
1.2.3 Pre versus Last
1.2.4 Local Definitions
1.2.5 Implicit Completion of Shared Variables
1.3 Valued Signals
1.3.1 Signal Emission
1.3.2 Signal Presence and Values
1.4 Hierarchical State Machines
1.4.1 Strong Preemption
1.4.2 Weak Preemption
1.4.3 Parameterized States
1.4.4 Modular Resets
1.4.5 Local State Definitions
1.4.6 States and Shared Memory
1.4.7 The Initial State
1.4.8 Resuming a State
1.4.9 Actions on Transitions
1.4.10 Signals and State Machines
1.4.11 Pattern Matching over Signals
1.5 Alternative Syntax for Control Structures
1.6 Real Time versus Logical Time
Chapter 2 Hybrid Systems Programming
2.1 Initial Value Problems
2.2 Mixing Discrete and Continuous Signals
2.2.1 Typing Constraints.
2.2.2 Zero-crossing Events
2.2.3 Periodic Timers
2.3 Hierarchical Automata and ODEs
Chapter 3 Compilation and Simulation
3.1 Combinatorial Functions
3.2 Sequential Nodes
3.3 Hybrid Nodes and Interaction with a Solver
Part II Reference manual
Chapter 4 The language
4.1 Lexical conventions
4.2 Values
4.2.1 Basic values
4.2.2 Tuples, records, sum types
4.3 Global names
4.3.1 Naming values
4.3.2 Referring to named values
4.4 Types
4.5 Constants
4.6 Patterns
4.7 Signal Patterns
4.8 Expressions
4.8.1 Simple expressions
4.8.2 Operators
4.8.3 Control Structures
4.9 Definitions
4.10 Type definition
4.11 Module implementation
4.12 Importing values
Chapter 5
zeluc