Mathematics Programming Language - MPL is currently a research prototype demonstrating that programming languages can be built from mathematical notation. We have implemented a complete parser that validates the concept, but programs cannot yet be executed. This is a vision project seeking contributors to help build the interpreter and runtime. https://mpl.codes
Find a file
developtheweb 1fb7e360f5 Resolve M0 blockers and fix all examples
- Resolved all lexical blockers:
  - Comments: -- single-line, {- -} multi-line
  - Strings: "..." with escapes, """...""" raw
  - Paths: Both 🖫"..." and \path"..."
- Fixed all 10 example files:
  - Added semicolons to all statements
  - Fixed factorial precedence
  - Fixed network server forall loop
  - Added comments to all examples
- Updated glyph-escapes.md with string escape sequences
- Updated math_prog_lang.md with complete lexical rules
- Fixed Chinese comma in structure list
- Updated README with badges and M0 exit criteria
- Marked ISSUE_M0_BLOCKERS.md as resolved

Ready for v0.1-alpha tag and ANTLR implementation
2025-07-25 12:21:52 -04:00
examples Resolve M0 blockers and fix all examples 2025-07-25 12:21:52 -04:00
glyph-escapes.md Resolve M0 blockers and fix all examples 2025-07-25 12:21:52 -04:00
ISSUE_M0_BLOCKERS.md Resolve M0 blockers and fix all examples 2025-07-25 12:21:52 -04:00
math_prog_lang.md Resolve M0 blockers and fix all examples 2025-07-25 12:21:52 -04:00
precedence.csv Initial commit: MPL specification and M0 documentation 2025-07-25 12:02:20 -04:00
README.md Resolve M0 blockers and fix all examples 2025-07-25 12:21:52 -04:00

Mathematical Programming Language (MPL)

Version Status

A programming language that maintains cognitive universality while supporting all modern programming paradigms through mathematical notation.

Quick Start

✎"Hello, World!"

Repository Structure

  • math_prog_lang.md - Complete language specification
  • ISSUE_M0_BLOCKERS.md - Critical decisions needed before M0 implementation
  • glyph-escapes.md - ASCII escape sequences for all Unicode glyphs
  • precedence.csv - Operator precedence table
  • examples/ - Example programs from the specification

M0 Milestones

  1. Language specification consolidated
  2. Pre-M0 audit completed
  3. Lexical blockers resolved (see ISSUE_M0_BLOCKERS.md)
  4. Implement ANTLR 4 grammar
  5. Create test suite (500 LOC)
  6. Achieve M0 exit criteria

M0 Exit Criteria

  • Lexer round-trips every glyph via escape and direct entry
  • Parser accepts all files in examples/
  • grmtools (or ANTLR diagnostics) reports 0 ambiguities
  • Fuzz seed (10k random tokens) yields no segfault
  • Pretty-printer emits code that re-parses into identical AST

Contact