Glynn Winskel


Ontology type: schema:Person     


Person Info

NAME

Glynn

SURNAME

Winskel

Publications in SciGraph latest 50 shown

  • 2018-07 Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures in SELECTA MATHEMATICA
  • 2018 Non-angelic Concurrent Game Semantics in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 2015 On Probabilistic Distributed Strategies in THEORETICAL ASPECTS OF COMPUTING - ICTAC 2015
  • 2014 Probabilistic and Quantum Event Structures in HORIZONS OF THE MIND. A TRIBUTE TO PRAKASH PANANGADEN
  • 2013 Imperfect Information in Logic and Concurrent Games in COMPUTATION, LOGIC, GAMES, AND QUANTUM FOUNDATIONS. THE MANY FACETS OF SAMSON ABRAMSKY
  • 2013 Borel Determinacy of Concurrent Games in CONCUR 2013 – CONCURRENCY THEORY
  • 2013 Strategies as Profunctors in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 2012-07 Deterministic concurrent strategies in FORMAL ASPECTS OF COMPUTING
  • 2012 Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information in LOGIC AND PROGRAM SEMANTICS
  • 2012 Bicategories of Concurrent Games in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES
  • 2009 Nominal Domain Theory for Concurrency in COMPUTER SCIENCE LOGIC
  • 2008 Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra in CONCURRENCY, GRAPHS AND MODELS
  • 2007 Symmetry and Concurrency in ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE
  • 2005-10-22 Event structure semantics for CCS and related languages in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2004 New-HOPLA a higher-order process language with name generation in EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS
  • 2004 Probabilistic Event Structures and Domains in CONCUR 2004 - CONCURRENCY THEORY
  • 2003 Full Abstraction for HOPLA in CONCUR 2003 - CONCURRENCY THEORY
  • 2002-12-16 Composing Strand Spaces in FST TCS 2002: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 2002-09-18 HOPLA—A Higher-Order Process Language in CONCUR 2002 — CONCURRENCY THEORY
  • 2002-04-19 Event Structures as Presheaves—Two Representation Theorems in CONCUR’99 CONCURRENCY THEORY
  • 2001-08-24 A Higher-Order Calculus for Categories in THEOREM PROVING IN HIGHER ORDER LOGICS
  • 1998 A categorical axiomatics for bisimulation in CONCUR'98 CONCURRENCY THEORY
  • 1998 A Linear Metalanguage for Concurrency in ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY
  • 1998 A relational model of non-deterministic dataflow in CONCUR'98 CONCURRENCY THEORY
  • 1997 Presheaf models for concurrency in COMPUTER SCIENCE LOGIC
  • 1997 Presheaf models for the π-calculus in CATEGORY THEORY AND COMPUTER SCIENCE
  • 1996 A presheaf semantics of value-passing processes in CONCUR '96: CONCURRENCY THEORY
  • 1994 Linear logic on Petri nets in A DECADE OF CONCURRENCY REFLECTIONS AND PERSPECTIVES
  • 1994 Bistructures, bidomains and linear logic in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1994 Relationships between models of concurrency in A DECADE OF CONCURRENCY REFLECTIONS AND PERSPECTIVES
  • 1994 Stable bistructure models of PCF in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1994
  • 1993 Deterministic behavioural models for concurrency in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1993
  • 1993 A classification of models for concurrency in CONCUR'93
  • 1993 Completeness results for linear logic on Petri nets in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1993
  • 1992-12 Compositional checking of satisfaction in FORMAL METHODS IN SYSTEM DESIGN
  • 1992 Compositional checking of satisfaction in COMPUTER AIDED VERIFICATION
  • 1991 Petri nets and transition systems (Abstract for an invited talk) in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1990 On the compositional checking of validity in CONCUR '90 THEORIES OF CONCURRENCY: UNIFICATION AND EXTENSION
  • 1990 Petri nets as models of linear logic in CAAP '90
  • 1989 An introduction to event structures in LINEAR TIME, BRANCHING TIME AND PARTIAL ORDER IN LOGICS AND MODELS FOR CONCURRENCY
  • 1989 A note on model checking the modal v-calculus in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988 dI-domains as a model of polymorphism in MATHEMATICAL FOUNDATIONS OF PROGRAMMING LANGUAGE SEMANTICS
  • 1988 A Compositional Model of MOS Circuits in VLSI SPECIFICATION, VERIFICATION AND SYNTHESIS
  • 1987 Event structures in PETRI NETS: APPLICATIONS AND RELATIONSHIPS TO OTHER MODELS OF CONCURRENCY
  • 1987 Relating two models of hardware in CATEGORY THEORY AND COMPUTER SCIENCE
  • 1987 Models and logic of MOS circuits in LOGIC OF PROGRAMMING AND CALCULI OF DISCRETE DESIGN
  • 1986 Category theory and models for parallel computation in CATEGORY THEORY AND COMPUTER PROGRAMMING
  • 1986 Petri nets, morphisms and compositionality in ADVANCES IN PETRI NETS 1985
  • 1985 On the composition and decomposition of assertions in SEMINAR ON CONCURRENCY
  • 1985 A complete proof system for SCCS with modal assertions in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.5335.0", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.147455.6", 
            "type": "Organization"
          }
        ], 
        "familyName": "Winskel", 
        "givenName": "Glynn", 
        "id": "sg:person.012533205153.60", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012533205153.60"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:53", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1657.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.012533205153.60'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.012533205153.60'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.012533205153.60'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.012533205153.60'


     




    Preview window. Press ESC to close (or click here)


    ...