1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
// ===============================================================================
// QUANTALANG COMPILER
// "The Language That Evolves"
// ===============================================================================
// Copyright (c) 2022-2026 Zain Dana Harper. MIT License.
// ===============================================================================
//
// QuantaLang is a multi-paradigm systems programming language featuring:
// - Strong static typing with gradual inference
// - Memory safety without garbage collection (ownership + borrowing)
// - First-class effects system
// - Embedded DSLs (SQL, Regex, Math, Finance, Graphics)
// - Universal compilation (x86-64, ARM64, WASM, SPIR-V, C, JS)
// - @ai decorator, neural types (@ai decorator, neural types)
// - Self-evolution through Axiom integration
//
// ===============================================================================
//! # QuantaLang Compiler
//!
//! This crate provides the complete QuantaLang compiler implementation including:
//! - Lexical analysis (tokenization)
//! - Parsing (recursive descent with Pratt parsing for expressions)
//! - Type checking (Hindley-Milner with extensions)
//! - Code generation (LLVM IR, WASM, SPIR-V)
//!
//! ## Example
//!
//! ```rust,ignore
//! use quantalang::{compile, CompileOptions, Target};
//!
//! let source = r#"
//! fn main() {
//! println("Hello, QuantaLang!")
//! }
//! "#;
//!
//! let output = compile(source, Target::Native, CompileOptions::default())?;
//! ```
/// The compiler version
pub const VERSION: &str = env!;
/// The language version
pub const LANGUAGE_VERSION: = ;
/// Author information
pub const AUTHOR: &str = "Zain Dana Harper";
/// Copyright notice
pub const COPYRIGHT: &str = "Copyright (c) 2022-2026 Zain Dana Harper. MIT License.";
// Re-export commonly used types
pub use ;
pub use ;
pub use ;
pub use ;
pub use ;
pub use ;