| Symmetries in Reversible Programming From Symmetric Rig Groupoids to Reversible Programming Languages | 0 | 0.34 | 2022 |
| A computational interpretation of compact closed categories: reversible programming with negative and fractional types | 0 | 0.34 | 2021 |
| Not By Equations Alone Reasoning With Extensible Effects | 0 | 0.34 | 2021 |
| Fractional Types: Expressive and Safe Space Management for Ancilla Bits | 0 | 0.34 | 2020 |
| From Symmetric Pattern-Matching to Quantum Control. | 1 | 0.36 | 2018 |
| From Reversible Programs to Univalent Universes and Back. | 0 | 0.34 | 2018 |
| An extended account of contract monitoring strategies as patterns of communication. | 0 | 0.34 | 2018 |
| NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation. | 0 | 0.34 | 2018 |
| Embracing the Laws of Physics: Three Reversible Models of Computation. | 0 | 0.34 | 2018 |
| From Symmetric Pattern-Matching to Quantum Control (Extended Version). | 0 | 0.34 | 2018 |
| Embracing the laws of Physics in the foundations of computation | 0 | 0.34 | 2017 |
| Computing with Semirings and Weak Rig Groupoids. | 3 | 0.42 | 2016 |
| Reversible Communicating Processes | 0 | 0.34 | 2015 |
| Expressing contract monitors as patterns of communication | 1 | 0.35 | 2015 |
| Encoding secure information flow with restricted delegation and revocation in Haskell | 1 | 0.42 | 2013 |
| Extensible effects: an alternative to monad transformers | 34 | 1.22 | 2013 |
| Lazy v. Yield: Incremental, Linear Pretty-Printing. | 3 | 0.43 | 2012 |
| Isomorphic Interpreters from Logically Reversible Abstract Machines. | 3 | 0.44 | 2012 |
| Information effects | 3 | 0.44 | 2012 |
| Lazy Evaluation and Delimited Control | 0 | 0.34 | 2010 |
| A type-theoretic foundation of delimited continuations | 15 | 0.65 | 2009 |
| The Arrow Calculus as a Quantum Programming Language | 3 | 0.44 | 2009 |
| Sequent calculi and abstract machines | 10 | 0.59 | 2009 |
| Reasoning about General Quantum Programs over Mixed States | 2 | 0.39 | 2009 |
| Quantum Arrows in Haskell | 1 | 0.36 | 2008 |
| A monadic framework for delimited continuations | 21 | 0.86 | 2007 |
| A proof-theoretic foundation of abortive continuations | 9 | 0.53 | 2007 |
| An Algebra of Pure Quantum Programming | 15 | 0.93 | 2007 |
| Delimited dynamic binding | 18 | 0.91 | 2006 |
| Practical program extraction from classical proofs | 0 | 0.34 | 2006 |
| Backtracking, interleaving, and terminating monad transformers: (functional pearl) | 39 | 1.56 | 2005 |
| Structuring quantum effects: superoperators as arrows | 21 | 1.11 | 2005 |
| AN ABSTRACT MONADIC SEMANTICS FOR VALUE RECURSION | 7 | 0.59 | 2004 |
| A type-theoretic foundation of continuations and prompts | 18 | 0.81 | 2004 |
| Modeling quantum computing in Haskell | 12 | 0.82 | 2003 |
| CPS in little pieces: composing partial continuations | 0 | 0.34 | 2002 |
| From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition | 9 | 0.65 | 2001 |
| Macros as multi-stage computations: type-safe, generative, binding macros in MacroML | 42 | 2.60 | 2001 |
| Monadic encapsulation of effects: a revised approach (extended version) | 19 | 1.09 | 2001 |
| Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog | 5 | 0.59 | 1999 |
| Correctness of monadic state: an imperative call-by-need calculus | 8 | 0.73 | 1998 |
| What is a purely functional language? | 13 | 0.77 | 1998 |
| Monadic state: axiomatization and type safety | 15 | 1.25 | 1997 |
| Proving the correctness of reactive systems using sized types | 143 | 6.03 | 1996 |
| Is continuation-passing useful for data flow analysis? | 24 | 2.01 | 1994 |
| The essence of compiling with continuations (with retrospective) | 2 | 0.38 | 1993 |
