CSE - Probabilistic Programming and Graph Grammars

We are developing a programming language called PERPL (https://github.com/diprism/perpl) that is probabilistic (programs compute a probability distribution over values instead of a single value) and compiles into graph grammars (like context-free grammars, but for graphs). The compiler can often change what appears to be an exponential-time algorithm into a polynomial-time algorithm. Specific topics will depend on the interests and background of the student..

 

Name of research group, project, or lab
NLP Group
Representative publication
Logistics Information:
Project categories
Computer Science & Engineering
Student ranks applicable
Junior
Senior
Student qualifications

Depending on the topic, the following skills might be a plus:

  • Python
  • PyTorch
  • Haskell
Hours per week
3 credits / 12+ hours
Compensation
Research for Credit
Number of openings
1
Contact Information:
Mentor
dchiang@nd.edu
Associate Professor
Name of project director or principal investigator
David Chiang
Email address of project director or principal investigator
dchiang@nd.edu
1 sp. | 0 appl.
Hours per week
3 credits / 12+ hours
Project categories
Computer Science & Engineering