Implementing System Fω, calculus of constructions, and higher-order dependent types. Enables reasoning about polymorphic abstractions, existential types, and proof-carrying neural architectures.
Building optimal reduction engines based on Lafont's interaction nets. Achieving parallel graph rewriting with constant-time β-reduction through symmetric interaction rules and asynchronous computation.
Constraint logic programming with unification algorithms extended to handle dependent types. Real-time satisfiability solving in higher-order logic with automatic proof term generation.
Research Areas
Our interdisciplinary approach spans theoretical computer science, mathematical logic, and artificial intelligence
Developing AI systems that generate, manipulate, and solve complex logical constraints in real-time applications.
Creating AI systems whose reasoning processes can be formally verified and mathematically proven correct.
Building AI that can construct mathematical proofs and verify their correctness using automated theorem proving.
Advancing dependent types and higher-order logic to create more expressive AI reasoning capabilities.
Developing systems that can reason about mathematical structures, theories, and their relationships.
Creating dynamic logical frameworks that can evolve and optimize their reasoning strategies.
Current Metrics
Measuring our contributions to formal AI research
Current Projects
Our flagship research combines polymorphic type systems with dynamic constraint generation to create AI systems capable of sophisticated mathematical reasoning. We're building AI that doesn't just process information, but truly understands mathematical structure and logical relationships.
Whereof one cannot speak, thereof one must be silent.