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

Gregory H. Cooper

dblp:97/6681 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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
2 papers
Programming languages and type systems · 89% Debugging and program repair · 11%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
language design
0.122009
Flapjax: a programming language for Ajax applications · OOPSLA 2009
Dataflow Language for Scriptable Debugging · ASE 2004
Programming languages and type systems › programming paradigms
reactive programming
0.112009
Flapjax: a programming language for Ajax applications · OOPSLA 2009
Programming languages and type systems › domain-specific languages
web programming language
0.112009
Flapjax: a programming language for Ajax applications · OOPSLA 2009
Programming languages and type systems › programming paradigms
dataflow language
0.012004
Dataflow Language for Scriptable Debugging · ASE 2004
Debugging and program repair › debugging tools
scriptable debugging
0.012004
Dataflow Language for Scriptable Debugging · ASE 2004

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

dataflow propagation · 0.1
YearPublicationVenuePosition
2013 Teaching garbage collection without implementing compiler or interpreters
abstract
Given the widespread use of memory-safe languages, students must understand garbage collection well. Following a constructivist philosophy, an effective approach would be to have them implement garbage collectors. Unfortunately, a full implementation depends on substantial knowledge of compilers and runtime systems, which many courses do not cover or cannot assume.
Gregory H. Cooper, Arjun Guha, Shriram Krishnamurthi, Jay A. McCarthy, Robert Bruce Findler
SIGCSE1
2009 Flapjax: a programming language for Ajax applications
abstract
This paper presents Flapjax, a language designed for contemporary Web applications. These applications communicate with servers and have rich, interactive interfaces. Flapjax provides two key features that simplify writing these applications. First, it provides event streams, a uniform abstraction for communication within a program as well as with external Web services. Second, the language itself is reactive: it automatically tracks data dependencies and propagates updates along those dataflows. This allows developers to write reactive interfaces in a declarative and compositional style.
Leo A. Meyerovich, Arjun Guha, Jacob P. Baskin, Gregory H. Cooper, Michael Greenberg 0002, Aleks Bromfield, Shriram Krishnamurthi
OOPSLA4
2007 Lowering: a static optimization technique for transparent functional reactivity
abstract
Functional Reactive Programming (FRP) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style. An FRP language creates a dynamic graph of data dependencies and reacts to changes by propagating updates through the graph. In a transparent FRP language, the primitive operators are implicitly lifted, so they construct graph nodes when they are applied to time-varying values. This model has some attractive properties, but it tends to produce a large graph that is costly to maintain. In this paper, we develop a transformation we call lowering, which improves performance by reducing the size of the graph. We present a static analysis that guides the sound application of this optimization, and we present benchmark results that demonstrate dramatic improvements in both speed and memory usage for real programs.
Kimberley Burchett, Gregory H. Cooper, Shriram Krishnamurthi
PEPM2
2007 The design and implementation of a dataflow language for scriptable debugging
Guillaume Marceau, Gregory H. Cooper, Jonathan P. Spiro, Shriram Krishnamurthi, Steven P. Reiss
Autom. Softw. Eng.2
2006 Embedding Dynamic Dataflow in a Call-by-Value Language
Gregory H. Cooper, Shriram Krishnamurthi
ESOP1
2004 Dataflow Language for Scriptable Debugging
Guillaume Marceau, Gregory H. Cooper, Shriram Krishnamurthi, Steven P. Reiss
ASE2