Superstructural Reversible Logic

In some substructural logics, the memory used by proofs is treated as a first-class multiplicative resource, but the choices made by those proofs are not. Since we can convert between space and time complexity, these “resource conscious” logics are therefore not actually guaranteed to preserve memory—for example, linear logic allows the erasure and duplication of natural numbers with time complexity proportional to their size. In order to fully account for space-time tradeoffs, we augment contexts to track all information, not just multiplicative resources. This creates a reversible, fully resource-preserving logic which allows us to examine the hidden information effects in linear logic and study reversible computation from a proof-theoretic perspective.

[1]  Cecylia Rauszer,et al.  A formalization of the propositional calculus of H-B logic , 1974 .

[2]  Editors , 1986, Brain Research Bulletin.

[3]  Robert J. Simmons,et al.  Structural Focalization , 2011, TOCL.

[4]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[5]  Mikael Rittri,et al.  Using types as search keys in function libraries , 1989, Journal of Functional Programming.

[6]  M. Warren.  Homotopy Theoretic Aspects of Constructive Type Theory , 2008 .

[7]  Tristan Crolard.  A Formulae-as-Types Interpretation of Subtractive Logic , 2004, J. Log. Comput..

[8]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[9]  P. Martin-Löf.  An Intuitionistic Theory of Types: Predicative Part , 1975 .

[10]  C. Rauszer.  Semi-Boolean algebras and their applications to intuitionistic logic with dual operations , 1974 .

[11]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[12]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[13]  Roberto Di Cosmo,et al.  Remarks on isomorphisms in typed lambda calculi with empty and sum types , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[14]  Amr Sabry,et al.  Isomorphic Interpreters from Logically Reversible Abstract Machines , 2012, RC.

[15]  R. Landauer.  The physical nature of information , 1996 .

[16]  R. Landauer.  Information is physical , 1991 .

[17]  Robert Harper,et al.  Typed closure conversion , 1996, POPL '96.

[18]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[19]  R. Feynman.  Simulating physics with computers , 1999 .

[20]  Hiroakira Ono,et al.  Cut elimination and strong separation for substructural logics: An algebraic approach , 2010, Ann. Pure Appl. Log..

[21]  Greg Restall,et al.  An Introduction to Substructural Logics , 2000 .

[22]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[23]  P. Martin-Löf.  On the meanings of the logical constants and the justi cations of the logical laws , 1996 .

[24]  Francesco Paoli.  Substructural Logics: A Primer , 2011 .

[25]  Marco Gaboardi,et al.  Linearity and PCF: a semantic insight! , 2011, ICFP '11.

[26]  David J. Pym,et al.  The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[27]  C. Rauszer.  An algebraic and Kripke-style approach to a certain extension of intuitionistic logic , 1980 .

[28]  Tobias J. Hagge,et al.  Physics , 1929, Nature.

[29]  Maribel Fernández.  The Lambda Calculus , 2009 .

[30]  H. Wansing.  Substructural logics , 1996 .

[31]  J. Roger Hindley,et al.  To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[32]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[33]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[34]  Kai Brünnler.  Deep inference and symmetry in classical proofs , 2003 .

[35]  Michael Moortgat,et al.  Continuation semantics for the Lambek-Grishin calculus , 2010, Inf. Comput..

[36]  Tristan Crolard,et al.  Subtractive logic , 2001, Theor. Comput. Sci..

[37]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[38]  Vladimir Gapeyev,et al.  Recursive Types , 2007 .

[39]  Matthias Felleisen,et al.  A Syntactic Approach to Type Soundness , 1994, Inf. Comput..

[40]  Philip Wadler,et al.  A Taste of Linear Logic , 1993, MFCS.

[41]  Bor-Yuh Evan Chang,et al.  A judgmental analysis of linear logic , 2003 .

[42]  Amr Sabry,et al.  Information effects , 2012, POPL '12.

[43]  John C. Baez,et al.  Physics, Topology, Logic and Computation: A Rosetta Stone , 2009, 0903.0340.

[44]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[45]  Wim Veldman.  Review: Per Martin-Lof, H. E. Rose, J. C. Shepherdson, An Intuitionistic Theory of Types: Predicative Part , 1984 .