Sam Staton

Name:	Sam Staton
Affiliation:	Computer Laboratory, University of Cambridge
E-mail:	(only provided to users who are logged into talks.cam)
Last login:	30 Jul 2012, 1:59 p.m.

Public lists managed by Sam Staton

• Mini Courses in Theoretical Computer Science

Talks given by Sam Staton

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

Talks organised by Sam Staton

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Sam Staton actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• Logics with algebraic operators
• Formalizing Domains, Ultrametric Spaces and Semantics of Programming Languages
• Relaxed-Memory Concurrency and Verified Compilation
• Automatic reduction of differential semantics for protein-protein interaction networks, by abstract interpretation
• A Language for Mathematics
• Andrew Kennedy
• Temporal logic verification of programs
• Separation Logic and Graphical Models
• Mathematizing C++ Concurrency
• Let should not be generalised
• Abstract separation algebra
• Concurrent abstract predicates
• Interoperability in a Scripted World
• Probabilistic languages for inference
• Higher order reactive programming
• Hoopl: modular library for dataflow analysis/transformation
• Every bit counts
• Linear maps
• Mini course on proof theory (Part 3)
• Mini course on proof theory (Part 2)
• Mini course on proof theory (Part 1)
• Scalars & probabilities, monads & categories
• A polarised calculus of delimited control
• Algebraic Theories over Nominal Sets
• Declassification Policy Inference
• No talk organized as yet.
• New frontiers for Linear Temporal Logic
• The Thorn Programming Language: Robust Distributed Scripting
• Undecidability of propositional separation logic and its neighbours
• Coarse-grained transactions
• The Microcosm Principle and Coalgebraic Modeling of Component Calculi
• A refinement of the state monad
• Completeness for algebraic theories of local state
• Structural recursion with pure local names
• Dependent types and program equivalence
• Verifying malloc using RGSep and 'Explicit Stabilisation'
• Locality and Footprints in Separation Logic
• F^o: Lightweight Linear F
• Integration of Typed and Untyped Code in a Scripting Language
• Higher Order Actions in Deny-Guarantee
• Program Verification and Synthesis over Predicate Abstraction
• Reliable evidence: Auditability by typing
• A Ubiquitous Abstract Machine
• Explicit Stabilisation for Rely-Guarantee reasoning
• Inductive-recursive definitions
• Safety of program transformations in shared-memory concurrency
• Towards parametric direcursion: structured mixed-variant recursion with parameters
• Scheduling meeting
• Focalisation and Classical Realisability
• Semantics lunch
• TALK CANCELLED: An overview of structural corecursion
• A unifying model for computational objects
• Strongly-typed term representations in Coq
• Segment logic (work in progress)
• Structurally Recursive Descent Parsing
• Biorthogonality, step-indexing and compiler correctness
• Deny-guarantee reasoning
• Resolving inductive definitions with binders
• A Framework for Specification, Prototyping, and Reasoning
• Logics with Rank Operators
• A game for a neutral approach to provability in MALL
• Equideductive logic and CCCs with subspaces
• Call-by-push-value (part 2)
• Call-by-push-value (part 1)
• Nondeterminism: many questions and (maybe) some answers
• Dynamics, robustness and fragility of trust
• Polynomial functors
• Extensional rewriting with sums
• Eriskay: a programming language based on game semantics.
• A completeness proof for bisimulation in the pi-calculus using Isabelle
• Logics for Coalgebras
• Category Theory and the Philosophy of Language
• Proving program termination (Part 3)
• Proving program termination (Part 2)
• Proving program termination (Part 1)
• Proving program termination
• When While is a Security Risk
• Title to be confirmed
• Stone duality for bitopological spaces
• Mechanizing Theories in Twelf: A Tutorial (Part 3)
• Mechanizing Theories in Twelf: A Tutorial (Part 2)
• Mechanizing Theories in Twelf: A Tutorial (Part 1)
• Countable ordinals and fast-growing functions (Part 3)
• Countable ordinals and fast-growing functions (Part 2)
• Countable ordinals and fast-growing functions (Part 1)
• Algebraic Routing (Part 3)
• Algebraic Routing (Part 2)
• Algebraic Routing (Part 1)