Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Notions of computation and monads
Information and Computation
A generic account of continuation-passing styles
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
New foundations for the geometry of interaction
Information and Computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data speculation support for a chip multiprocessor
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Science of Computer Programming - Special issue on mathematics of program construction
ECOSystem: managing energy as a first class operating system resource
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
NREVERSAL of Fortune - The Thermodynamics of Garbage Collection
IWMM '92 Proceedings of the International Workshop on Memory Management
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
IFL '99 Selected Papers from the 11th International Workshop on Implementation of Functional Languages
Linear programs in a simple reversible language
Theoretical Computer Science
Exact Computation of the Entropy of a Logic Circuit
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
Isomorphisms of generic recursive polynomial types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Functional Programming
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Revisiting an automatic program inverter for Lisp
ACM SIGPLAN Notices
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Probabilistic λ-calculus and Quantitative Program Analysis
Journal of Logic and Computation
A structural approach to reversible computation
Theoretical Computer Science
A lambda calculus for quantum computation with classical control
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Assessing security threats of looping constructs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Geometry of synthesis: a structured approach to VLSI design
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A model for computing and energy dissipation of molecular QCA devices and circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Principles of a reversible programming language
Proceedings of the 5th conference on Computing frontiers
A static analysis for quantifying information flow in a simple imperative language
Journal of Computer Security
Typed closure conversion preserves observational equivalence
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
On the Computational Power of Biochemistry
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Distance makes the types grow stronger: a calculus for differential privacy
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
Reversible representation and manipulation of constructor terms in the heap
RC'13 Proceedings of the 5th international conference on Reversible Computation
Hi-index | 0.00 |
Computation is a physical process which, like all other physical processes, is fundamentally reversible. From the notion of type isomorphisms, we derive a typed, universal, and reversible computational model in which information is treated as a linear resource that can neither be duplicated nor erased. We use this model as a semantic foundation for computation and show that the "gap" between conventional irreversible computation and logically reversible computation can be captured by a type-and-effect system. Our type-and-effect system is structured as an arrow metalanguage that exposes creation and erasure of information as explicit effect operations. Irreversible computations arise from interactions with an implicit information environment, thus making them a derived notion, much like open systems in Physics. We sketch several applications which can benefit from an explicit treatment of information effects, such as quantitative information-flow security and differential privacy.