issues
search
joristt
/
Hanus
A much more powerful version of the reversible language Janus, built in Haskell
8
stars
0
forks
source link
Project Proposal
#2
Closed
omelkonian
closed
7 years ago
omelkonian
commented
7 years ago
[x] Background
[x] Problem
Research Question
Very Basic Janus DSL
Embedding the DSL
No local variables
No IO
Extensions
Arbitrary types
Local vars ~> Function args
More operators
Applications
Pathfinding algorithms
Encoding-Decoding
Low-level bit manipulation (hamming error correction)
[Optional] Reversible Debugger
Benchmarking
[Optional] Formal Verification of Reversibility
[x] Methodology
Template Haskell
Benchmarking
Which algorithms?
Compare against what?
Risks/Contingency plans
Especially
arbitrary types
Arbitrary types ~> Ad-hoc types
Full verification ~> Basic DSL verification
Goal
About 2/3 of the tasks
Minimal set (basic DSL, adhoc types, relevant applications)
A more useful/practical interpreter of Janus
Inherit the power of Haskell
Compile-time guarantees
Slightly verified
[x] Planning
omelkonian
commented
7 years ago
Done!
arbitrary types