Jeopardy: an invertible functional programming language
From MaRDI portal
Cites work
- \(\mathsf{CoreFun}\): a typed functional reversible core language
- <scp>Sparcl</scp>: A language for partially invertible computation
- Bennett and Stinespring, together at last
- Cauder: a causal-consistent reversible debugger for Erlang
- scientific article; zbMATH DE number 3716761 (Why is no real title available?)
- scientific article; zbMATH DE number 48517 (Why is no real title available?)
- scientific article; zbMATH DE number 3798996 (Why is no real title available?)
- scientific article; zbMATH DE number 3266639 (Why is no real title available?)
- Irreversibility and Heat Generation in the Computing Process
- Linear logic
- Logical Reversibility of Computation
- Reverse code generation for parallel discrete event simulation
- Reversible computing from a programming language perspective
- Reversible effects as inverse arrows
- Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
- Tail recursion transformation for invertible functions
- The size-change principle for program termination
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
- Towards a reversible functional language
This page was built for publication: Jeopardy: an invertible functional programming language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637593)