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

Denis Dancanet

dblp:06/556 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Software engineering, systems software and programming languages · 1

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
Concurrent programming · 50% Programming languages and type systems · 50%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › deterministic execution
deterministic parallelism
0.011995
Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness · POPL 1995
Programming languages and type systems
functional programming
0.011995
Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness · POPL 1995
YearPublicationVenuePosition
1995 Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness
abstract
We call language L1 intensionally more expressive than L2 if there are functions which can be computed faster in L1 than in L2. We study the intensional expressiveness of several languages: the Berry-Curien programming language of sequential algorithms, CDS0, a deterministic parallel extension to it, named CDSP, and various parallel extensions to the functional programming language PCF. The paper consists of two parts.
Stephen D. Brookes, Denis Dancanet
POPL2