@incollection{lawvere_tools_1994,
title = {Tools for the {Advancement} of {Objective} {Logic}: {Closed} {Categories} and {Toposes}},
shorttitle = {Tools for the {Advancement} of {Objective} {Logic}},
booktitle = {The {Logical} {Foundations} of {Cognition}},
publisher = {Oxford University Press USA},
author = {Lawvere, F. William},
editor = {Macnamara, John and Reyes, Gonzalo E.},
year = {1994},
note = {ZSCC: NoCitationData[s0]},
keywords = {Compendium, Emergence, Psychology, Sketchy},
pages = {43--56}
}
@article{jones_probabilistic_1989,
title = {Probabilistic {Non}-determinism},
language = {en},
author = {Jones, Claire},
year = {1989},
note = {ZSCC: 0000000},
keywords = {Denotational semantics, Probabilistic programming, Programming language theory},
pages = {198}
}
@inproceedings{girard_geometry_1995,
address = {Berlin, Heidelberg},
series = {{NATO} {ASI} {Series}},
title = {On {Geometry} of {Interaction}},
isbn = {978-3-642-79361-5},
doi = {10/fr557p},
abstract = {The paper expounds geometry of interaction, for the first time in the full case, i.e. for all connectives of linear logic, including additives and constants. The interpretation is done within a C*-algebra which is induced by the rule of resolution of logic programming, and therefore the execution formula can be presented as a simple logic programming loop. Part of the data is public (shared channels) but part of it can be viewed as private dialect (defined up to isomorphism) that cannot be shared during interaction, thus illustrating the theme of communication without understanding. One can prove a nilpotency (i.e. termination) theorem for this semantics, and also its soundness w.r.t. a slight modification of familiar sequent calculus in the case of exponential-free conclusions.},
language = {en},
booktitle = {Proof and {Computation}},
publisher = {Springer},
author = {Girard, Jean-Yves},
editor = {Schwichtenberg, Helmut},
year = {1995},
note = {ZSCC: NoCitationData[s0]},
keywords = {Interactive semantics, Linear logic},
pages = {145--191}
}
@inproceedings{de_vink_bisimulation_1997,
address = {Berlin, Heidelberg},
series = {Lecture {Notes} in {Computer} {Science}},
title = {Bisimulation for probabilistic transition systems: {A} coalgebraic approach},
isbn = {978-3-540-69194-5},
shorttitle = {Bisimulation for probabilistic transition systems},
doi = {10/fcqzmk},
abstract = {The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendier in terms of a set functor. This coalgebraic formulation makes it possible to generalize the concepts to a continuous setting involving Borel probability measures. Under reasonable conditions, generalized probabilistic bisimilarity can be characterized categorically. Application of the final coalgebra paradigm then yields an internally fully abstract semantical domain with respect to probabilistic bisimulation.},
language = {en},
booktitle = {Automata, {Languages} and {Programming}},
publisher = {Springer},
author = {de Vink, E. P. and Rutten, J. J. M. M.},
editor = {Degano, Pierpaolo and Gorrieri, Roberto and Marchetti-Spaccamela, Alberto},
year = {1997},
note = {ZSCC: NoCitationData[s1]},
keywords = {Categorical probability theory, Coalgebras, Denotational semantics, Probabilistic transition systems, Transition systems},
pages = {460--470}
}
@inproceedings{giry_categorical_1982,
address = {Berlin, Heidelberg},
series = {Lecture {Notes} in {Mathematics}},
title = {A categorical approach to probability theory},
isbn = {978-3-540-39041-1},
doi = {10/dtx5t5},
language = {en},
booktitle = {Categorical {Aspects} of {Topology} and {Analysis}},
publisher = {Springer},
author = {Giry, MichÃ¨le},
editor = {Banaschewski, B.},
year = {1982},
note = {ZSCC: NoCitationData[s1]},
keywords = {Categorical probability theory},
pages = {68--85}
}