Bistructures, bidomains, and linear logic

Improved fluid for intraocular infusion and irrigation and methods of preparation and use. The fluid is an aqueous physiologic saline solution containing from 2-15% by weight of an artificial, substantially non-antigenic oncotic agent of a colloid type, such as dextran having an average molecular weight in the range of from about 1,000 to 40,000. The solution also contains NaCl, CaCl2, dextrose and sodium bicarbonate, and is adjusted to have an osmolarity in the range of 260-400 mOsm/L and a pH in the range of from about 7 to 7.8. The solution may be used as a replacement fluid for the aqueous or vitreous humor, for the reestablishment of intraocular pressure during or after surgery, as an irrigating fluid during phacoemulsification, and generally for external eye surface rinsing during cataract surgery. The solution results in improved lens maintenance and corneal endothelial function during procedures such as vitrectomy, irrigation and aspiration of cataracts, and in phacoemulsification. Improvement is demonstrated, for example, by reduced corneal endothelial decompensation (inhibition of osmotic corneal swelling), by reduced water and sodium gain, by reduced potassium loss, and by recovery of the lens' ability to reverse electrolyte imbalances due to stress of the type typical of surgery, diabetes, ageing, and physical, chemical or biochemical trauma.

[1]  Kim Guldstrand Larsen,et al.  Compositional Safety Logics , 1997 .

[2]  Nils Klarlund,et al.  Monadic Second-order Logic for Parameterized Verification , 1994 .

[3]  O. Danvy,et al.  Thunks and the-calculus ( extended version ) , 1997 .

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

[5]  Thomas Ehrhard Hypercoherences: A Strongly Stable Model of Linear Logic , 1993, Math. Struct. Comput. Sci..

[6]  Vladimiro Sassone,et al.  Transition systems with independence and multi-arcs , 1997, Partial Order Methods in Verification.

[7]  Gavin M. Bierman What is a Categorical Model of Intuitionistic Linear Logic? , 1995, TLCA.

[8]  Glynn Winskel Stable Bistructure Models of PCF , 1994, MFCS.

[9]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[10]  Glynn Winskel,et al.  Events in computation , 1980 .

[11]  Pierre-Louis Curien Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[12]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[13]  P. S. Thiagarajan,et al.  A Product Version of Dynamic Linear Time Temporal Logic , 1997, CONCUR.

[14]  M. Nielsen,et al.  Decidability Issues for Petri Nets , 1994 .

[15]  Peter W. O'Hearn,et al.  Kripke Logical Relations and PCF , 1995, Inf. Comput..

[16]  Nils Klarlund,et al.  Graphs and Decidable Transductions based on Edge Constraints , 1994 .

[17]  Albert R. Meyer,et al.  Full Abstraction and the Context Lemma , 1991, TACS.

[18]  P. S. Thiagarajan,et al.  Dynamic Linear Time Temporal Logic , 1997, Ann. Pure Appl. Log..

[19]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[20]  Ralph Loader Finitary PCF is not decidable , 2001, Theor. Comput. Sci..

[21]  J. Girard,et al.  Proofs and types , 1989 .

[22]  Alexander E. Andreev Complexity of Nondeterministic Functions , 1994 .

[23]  Mogens Nielsen,et al.  Bisimulations, Games and Logic , 1994 .

[24]  R. A. G. Seely,et al.  Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .

[25]  Glynn Winskel,et al.  Bistructures, Bidomains and Linear Logic , 1994 .

[26]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[27]  Glynn Winskel Semantics, Algorithmics and Logic: Basic Research in Computer Science. BRICS Inaugural Talk , 1994 .

[28]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[29]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[30]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[31]  Glynn Winskel,et al.  Event structures : Lecture notes for the Advanced Course on Petri Nets , 1986 .

[32]  Kim G. Larsen,et al.  Timed Modal Specification - Theory and Tools , 1993, CAV.

[33]  Glynn Winskel,et al.  An Introduction to Event Structures , 1989 .

[34]  Pierre-Louis Curien On the Symmetry of Sequentiality , 1993, MFPS.

[35]  Glynn Winskel,et al.  Linear Logic on Petri Nets , 1993, REX School/Symposium.

[36]  Peter Bro Miltersen,et al.  Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds , 1997, WADS.

[37]  Peter D. Mosses,et al.  Unified Algebras and Abstract Syntax , 1992, COMPASS/ADT.

[38]  G. Winskel The formal semantics of programming languages , 1993 .

[39]  Guo-Qiang Zhang Logic of Domains , 1991, Progress in Theoretical Computer Science.

[40]  Søren Riis,et al.  Dictionaries on AC 0 RAMs : Query time Θ ( √ log n / log log n ) is necessary and sufficient ∗ , 1997 .