<--- Back to Details
First PageDocument Content
Theoretical computer science / Logic in computer science / Programming language semantics / Models of computation / Game theory / Semantics / Denotational semantics / Game semantics / Determinacy / Samson Abramsky / Operational semantics
Date: 2003-02-27 10:19:48
Theoretical 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 doma

Add to Reading List

Source URL: www.cs.ox.ac.uk

Download Document from Source Website

File Size: 236,34 KB

Share Document on Facebook

Similar Documents

Compositional Semantics of Spiking Neural P Systems Roberto Barbutia , Andrea Maggiolo-Schettinia, Paolo Milazzoa,∗, Simone Tinib a Dipartimento di Informatica, Universit` a di Pisa, Largo B. Pontecorvo 3, 56127 Pisa,

Compositional Semantics of Spiking Neural P Systems Roberto Barbutia , Andrea Maggiolo-Schettinia, Paolo Milazzoa,∗, Simone Tinib a Dipartimento di Informatica, Universit` a di Pisa, Largo B. Pontecorvo 3, 56127 Pisa,

DocID: 1xW1Z - View Document

Rule Formats for Nominal Operational Semantics A very short and informal introduction Luca Aceto Gran Sasso Science Institute, L’Aquila, and ICE-TCS, School of Computer Science, Reykjavik University

Rule Formats for Nominal Operational Semantics A very short and informal introduction Luca Aceto Gran Sasso Science Institute, L’Aquila, and ICE-TCS, School of Computer Science, Reykjavik University

DocID: 1xVWR - View Document

Contract Monitoring Semantics as Patterns of Communication Cameron Swords Amr Sabry  Sam Tobin-Hochstadt

Contract Monitoring Semantics as Patterns of Communication Cameron Swords Amr Sabry Sam Tobin-Hochstadt

DocID: 1xVPL - View Document

Local Soundness for QBF Calculi? Martin Suda and Bernhard Gleiss TU Wien, Vienna, Austria Abstract. We develop new semantics for resolution-based calculi for Quantified Boolean Formulas, covering both the CDCL-derived ca

Local Soundness for QBF Calculi? Martin Suda and Bernhard Gleiss TU Wien, Vienna, Austria Abstract. We develop new semantics for resolution-based calculi for Quantified Boolean Formulas, covering both the CDCL-derived ca

DocID: 1xVIK - View Document

Experimental Biological Protocols with Formal Semantics Alessandro Abate2 , Luca Cardelli1,2 , Marta Kwiatkowska2 , Luca Laurenti2 , and Boyan Yordanov1 1

Experimental Biological Protocols with Formal Semantics Alessandro Abate2 , Luca Cardelli1,2 , Marta Kwiatkowska2 , Luca Laurenti2 , and Boyan Yordanov1 1

DocID: 1xVCq - View Document