FuturLang – Natural language formal verification
FuturLang – Natural language formal verification
I built FuturLang, a formal verification system that preserves natural language structure while enabling machine verification. The goal is to make formal proofs more accessible without requiring specialized notation like Coq/Lean/Agda. Example proof structure: (1) It is assumed that: (√2 is rational) (2) This implies that: (∃ integers a, b)... (3) Therefore: (√2 is irrational) I’ve built the language spec, verification engine, and a database of 250+ proofs. But adoption has been minimal, which makes me question if this addresses a real need. Questions for HN: ∙ Is “natural language + formal verification” solving a real problem? ∙ What would need to be true for you to use this instead of Lean/Coq? ∙ Am I building a solution in search of a problem? Honest feedback welcome - trying to decide whether to keep building or move on. GitHub: https://github.com/wenitte/mathematical-intelligence
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Correct prediction on native model
Similar products
Natural Language Querying
Wit – Natural language for your app
Beaches of Greece, natural-language search for Greek beaches
Make GLSL Shaders with natural language
Selecta – Natural language analytics for BigQuery
Explore Cellular Automatons with Natural Language
Fountain – Natural Language Data Augmentation Tool
Babo – A scripting natural language that works as intended
NLCS – A Natural Language Constraint System for LLMs
Gitgpt – Natural Language Git