aufbau 0.1.0

Type-aware constrained decoding for LLMs using context-dependent grammars with typing rules
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

/// Validation Module
///
/// This module provides validation and testing infrastructure for constrained generation.
///
/// ## Submodules
///
/// - `completability`: Core completion algorithm and prefix soundness checking
/// - `completable`: Slow but thorough completion tests (BFS exploration)
/// - `parseable`: Fast prefix-parseability tests (no completion search)
///
/// ## Key Guarantees
///
/// 1. **Prefix Soundness**: Any completable string has all prefixes completable
/// 2. **Type Safety**: Completions respect typing rules
/// 3. **Completeness**: Completion results are fully parsed (no holes)
///
pub mod completability;

pub mod complexity;

pub mod completable;

pub mod parseable;