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

Philippe Mougin

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

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

Software engineering, systems software and programming languages · 1 · 1 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 · 75% Concurrent programming · 25%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › programming paradigms
array programming
0.012003
OOPAL: integrating array programming in object-oriented programming · OOPSLA 2003
Programming languages and type systems
language design
0.012003
OOPAL: integrating array programming in object-oriented programming · OOPSLA 2003
Concurrent programming
message passing
0.012003
OOPAL: integrating array programming in object-oriented programming · OOPSLA 2003
Programming languages and type systems
object-oriented programming
0.012003
OOPAL: integrating array programming in object-oriented programming · OOPSLA 2003

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

method invocation extension · 0.0array programming · 0.0
YearPublicationVenuePosition
2003 OOPAL: integrating array programming in object-oriented programming
abstract
Array programming shines in its ability to express computations at a high-level of abstraction, allowing one to manipulate and query whole sets of data at once. This paper presents the OPA model that enhances object-oriented programming with array programming features. The goal of OPA is to determine a minimum set of modifications that must be made to the traditional object model in order to take advantage of the possibilities of array programming. It is based on a minimal extension of method invocation and the definition of a kernel of methods implementing fundamental array programming operations. The OPA model presents a generalization of traditional message passing in the sense that a message can be send to an entire set of objects. The model is validated in FS, a new scripting language.
Philippe Mougin, Stéphane Ducasse
OOPSLA1