Partial Evaluation of Reversible Flowchart Programs
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a 27-minute video presentation from the PEPM 2024 conference on the partial evaluation of reversible flowchart programs. Delve into the systematic and formal development of a method for partial evaluation in a reversible flowchart language, presented by Louis Marott Normann and Robert Glück from the University of Copenhagen. Discover how this study confirms that partial evaluation in reversible computing shows effects consistent with traditional approaches. Examine experiments involving the specialization of a symmetric encryption algorithm and a reversible interpreter for Bennett's reversible Turing machines. Learn about the first reported experiments combining program inversion and partial evaluation, a unique feature of reversible languages. Gain insights into the potential applications of this fully implemented method in areas such as low-power computing, debugging, robotics, and quantum-inspired computing.
Syllabus
[PEPM'24] Partial Evaluation of Reversible Flowchart Programs
Taught by
ACM SIGPLAN
Related Courses
Automata TheoryStanford University via edX Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Theory of Computation
Indian Institute of Technology Kanpur via Swayam Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam Theory of Computation
YouTube