First Page | Document Content | |
---|---|---|
Date: 2003-02-27 10:19:48Theoretical computer science Logic in computer science Programming language semantics Models of computation Game theory Semantics Denotational semantics Game semantics Determinacy Samson Abramsky Operational semantics | Semantics of Interaction Samson Abramsky Abstract The “classical” paradigm for denotational semantics models data types as domains, i.e. structured sets of some kind, and programs as (suitable) functions between domaAdd to Reading ListSource URL: www.cs.ox.ac.ukDownload Document from Source WebsiteFile Size: 236,34 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |