Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Mikkel Nygaard

dblp:30/3432 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2004
0000-0002-9450-7544ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems › substructural type systems
linearity		 0.012002
Linearity in Process Languages · LICS 2002
Programming languages and type systems › language semantics › formal semantics
operational semantics		 0.012002
Linearity in Process Languages · LICS 2002
Programming languages and type systems › domain-specific languages
process modeling language		 0.012002
Linearity in Process Languages · LICS 2002
Logic in computer science › proof theory › substructural logic › linear logic
linear affine logic		 0.012002
Linearity in Process Languages · LICS 2002
Logic in computer science › proof theory › substructural logic
linear logic		 0.012002
Linearity in Process Languages · LICS 2002

Methods — techniques the papers use, named apart from their topics

path-based model · 0.1open-map bisimulation · 0.1exponential · 0.1
YearPublicationVenuePosition
2004 Domain theory for concurrency
Mikkel Nygaard, Glynn Winskel
 Theor. Comput. Sci.1
2003 Full Abstraction for HOPLA
Mikkel Nygaard, Glynn Winskel
 CONCUR1
2002 HOPLA-A Higher-Order Process Language
Mikkel Nygaard, Glynn Winskel
 CONCUR1
2002 Linearity in Process Languages
abstract
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation.
Mikkel Nygaard, Glynn Winskel
 LICS1