Declarative Programming via a Relational Algebra - PhD Defense

Explore a PhD defense presentation on declarative programming through relational algebra, delivered by Matthew Francis Landau at the Center for Language & Speech Processing (CLSP) at Johns Hopkins University. Delve into advanced concepts and research findings in this hour-long talk, which offers insights into the intersection of declarative programming and relational algebra. Gain a deeper understanding of the subject matter and its implications for computer science and language processing. For more information on the research presented, visit Matthew Francis Landau's research page at https://matthewfl.com/research.