Theoretical Computer Science
Notions of computation and monads
Information and Computation
Domains and lambda-calculi
ACM Transactions on Computational Logic (TOCL)
Algebraic Semantics
Operational Theories of Improvement in Functional Languages (Extended Abstract)
Proceedings of the 1991 Glasgow Workshop on Functional Programming
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
Slot games: a quantitative model of computation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mathematical Structures in Computer Science
On Quantitative Software Verification
Proceedings of the 16th International SPIN Workshop on Model Checking Software
An Explicit Formula for the Free Exponential Modality of Linear Logic
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ACM Transactions on Computational Logic (TOCL)
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The Computational Meaning of Probabilistic Coherence Spaces
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Step-Indexed syntactic logical relations for recursive and quantified types
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Constructing differential categories and deconstructing categories of games
Information and Computation
| Hi-index | 0.00 |
The category Rel of sets and relations yields one of the simplest denotational semantics of Linear Logic (LL). It is known that Rel is the biproduct completion of the Boolean ring. We consider the generalization of this construction to an arbitrary continuous semiring R, producing a cpo-enriched category which is a semantics of LL, and its (co)Kleisli category is an adequate model of an extension of PCF, parametrized by R. Specific instances of R allow us to compare programs not only with respect to "what they can do", but also "in how many steps" or "in how many different ways" (for non-deterministic PCF) or even "with what probability" (for probabilistic PCF).