3 problems

0 votes0 replies0 views
Universality of the self-replication equational systems in Turing-complete languages
Universality conjecture. The same result should hold for arbitrary programming languages: as soon as a language is Turing-complete, it should interpret the authors' logical systems…
Conjectureopenprogramming-languages self-replication term-rewritingarXiv posted 2 days ago
0 votes0 replies0 views
VETT as a foundation for a logic of ordered structures
The paper introduces VETT as a proof-relevant logic for formal category theory, with an extensional dependent type theory supporting categories, functors, profunctors, and natural…
Conjectureopencategory-theory formal-logic programming-languagesarXiv posted 2 days ago
0 votes0 replies1 view
The SOOP conjecture on modeling structural object-oriented programming
SOOP conjecture. Combining models of relational databases and functional programming in some precise way can be used to model structural OOP.
Conjectureopencategory-theory object-oriented-programming programming-languagesarXiv posted 2 days ago

Universality of the self-replication equational systems in Turing-complete languages