TodePond/DreamBerd
DreamBerd
DreamBerd is a general purpose programming language designed for building applications with integrated support for reactive state, time-aware memory management, and embedded user interface markup. It functions as a programming environment that tracks dynamic values and coordinates asynchronous tasks through sequential execution constraints.
The language is distinguished by its ability to track variable history, providing dedicated keywords to retrieve previous, current, and future values of variables during execution. It further differentiates itself through a memory model that controls variable lifespans and hoisting using specific time units for memory residency.
Broad capabilities include the use of a specialized markup syntax embedded directly in the source code for defining user interface elements and a state management system using signals to update those elements automatically. The language also features a custom syntax where statements terminate with exclamation marks, automated syntax completion for structural delimiters, and an arithmetic system that utilizes whitespace to determine the order of operations.
Features
- General Purpose Languages - Functions as a high-level, versatile programming language designed for broad application use.
- Reactive State Systems - Provides a reactive state system using signals and granular dependency tracking to automatically update UI elements.
- Variable State Tracking - Tracks and retrieves previous and future values of variables for state monitoring over time.
- Temporal State Access - Retrieve previous, current, or future values of a variable using dedicated keywords to track data changes over time.
- Temporal State Tracking - Allows developers to retrieve previous, current, and future values of variables during execution.
- Temporal Variable Indexing - Tracks and retrieves historical and future states of variables using dedicated keywords to access data across different time-steps.
- Variable History Retrieval - Provides dedicated keywords to retrieve previous, current, and future values of variables during execution.
- Sequential Async Orchestration - Coordinates asynchronous tasks by forcing them to execute specific lines of code in a strict sequential order.
- Time-Based Memory Residency - Controls the lifetime and hoisting of variables by assigning specific time durations to their memory residency.
- Asynchronous Flow Coordination - Coordinates asynchronous tasks through sequential execution constraints to ensure strict order without manual locking.
- Residency-Based Memory Control - Controls how long variables remain in memory using time-based allocation and hoisting rules.
- Time-Aware Memory Models - Uses a specific time-based system for controlling variable lifespans and hoisting in memory.
- Time-Based Memory Management - Implements a unique memory model that controls variable lifespans and hoisting using specific time units.
- Asynchronous-to-Synchronous Conversion - Implements mechanisms to block execution until an asynchronous sequence completes, presenting a linear synchronous flow.
- Language-Integrated UI Markup - Integrates a specialized layout syntax directly into the core language grammar to define user interface structures.
- Declarative UI Definitions - Provides a markup-based system for defining user interface layouts and components directly within the language.
- Declarative UI Languages - Integrates a specialized markup syntax directly into the source code for defining visual structures.
- Markup Languages - Integrates a specialized markup syntax directly within the language to define and structure user interface elements.
- Reactive User Interfaces - Combines embedded UI markup and reactive state management to automatically update interface elements.
- Reactive State Management - Uses a signal-based system to track and update dynamic state and automatically update UI elements.
- Structural Token Completion - Implements automated syntax completion that inserts missing brackets and structural delimiters to resolve unfinished code blocks.
- Automatic Syntax Completion - Inserts missing brackets, quotation marks, or exclamation points to finish unfinished code structures automatically.
- Statement Termination Syntaxes - Utilizes a custom syntax where every statement must terminate with an exclamation mark.
- Arithmetic Operations - Calculates numerical values using a unique whitespace-driven system to determine the order of operations.
- Whitespace-Priority Arithmetic - Determines the order of numerical operations by analyzing the physical spacing between fractions and number names.
- Structural Syntax Recovery - Automatically inserts missing structural delimiters and tokens during the parsing phase to resolve incomplete code blocks.
- Programming Languages - An experimental language designed to explore unconventional syntax and features.
