Loading...
Please wait, while we are loading the content...
Similar Documents
Dagger traced symmetric monoidal categories and reversible programming.
| Content Provider | CiteSeerX |
|---|---|
| Author | Bowman, William J. James, Roshan P. Sabry, Amr |
| Abstract | We develop a reversible programming language from elementary mathematical and categorical foundations. The core language is based on isomorphisms between finite types: it is complete for combinational circuits and has an elegant semantics in dagger symmetric monoidal categories. The categorical semantics enables the definition of canonical and well-behaved reversible loop operators based on the notion of traced categories. The extended language can express recursive reversible algorithms on recursive types such as the natural numbers, lists, and trees. Computations in the extended language may diverge but every terminating computation is still reversible. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Reversible Programming Dagger Traced Symmetric Monoidal Category Extended Language Natural Number Recursive Type Finite Type Well-behaved Reversible Loop Operator Categorical Semantics Recursive Reversible Algorithm Categorical Foundation Dagger Symmetric Monoidal Category Core Language Terminating Computation Reversible Programming Language Traced Category Elegant Semantics Combinational Circuit |
| Content Type | Text |
