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.

Sylvain Lebresne

dblp:33/365 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

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

Software engineering, systems software and programming languages · 2Theory of computation · 2 · 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
3 papers
Programming languages and type systems · 85% Empirical software engineering · 15%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
dynamic languages
0.112010
An analysis of the dynamic behavior of JavaScript programs · PLDI 2010
Programming languages and type systems › type systems
dynamic typing
0.112010
Integrating typed and untyped code in a scripting language · POPL 2010
Programming languages and type systems › type systems
gradual typing
0.112010
Integrating typed and untyped code in a scripting language · POPL 2010
Programming languages and type systems › type systems
static typing
0.112010
Integrating typed and untyped code in a scripting language · POPL 2010
Programming languages and type systems › evaluation strategies
call-by-name
0.112008
A System F with Call-by-Name Exceptions · ICALP (2) 2008
Programming languages and type systems
type systems
0.112008
A System F with Call-by-Name Exceptions · ICALP (2) 2008
Programming languages and type systems › lambda calculus
polymorphic lambda calculus
0.012008
A System F with Call-by-Name Exceptions · ICALP (2) 2008

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

type checking · 0.1operational semantics · 0.1empirical study · 0.1corpus analysis · 0.1
YearPublicationVenuePosition
2010 An analysis of the dynamic behavior of JavaScript programs
abstract
The JavaScript programming language is widely used for web programming and, increasingly, for general purpose computing. As such, improving the correctness, security and performance of JavaScript applications has been the driving force for research in type systems, static analysis and compiler techniques for this language. Many of these techniques aim to reign in some of the most dynamic features of the language, yet little seems to be known about how programmers actually utilize the language or these features. In this paper we perform an empirical study of the dynamic behavior of a corpus of widely-used JavaScript programs, and analyze how and why the dynamic features are used. We report on the degree of dynamism that is exhibited by these JavaScript programs and compare that with assumptions commonly made in the literature and accepted industry benchmark suites.
Gregor Richards, Sylvain Lebresne, Brian Burg, Jan Vitek
PLDI2
2010 Integrating typed and untyped code in a scripting language
abstract
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and performance in the long run. We present an approach for integrating untyped code and typed code in the same system to allow an initial prototype to smoothly evolve into an efficient and robust program. We introduce like types , a novel intermediate point between dynamic and static typing. Occurrences of like types variables are checked statically within their scope but, as they may be bound to dynamic values, their usage is checked dynamically. Thus like types provide some of the benefits of static typing without decreasing the expressiveness of the language. We provide a formal account of like types in a core object calculus and evaluate their applicability in the context of a new scripting language.
Tobias Wrigstad, Francesco Zappa Nardelli, Sylvain Lebresne, Johan Östlund, Jan Vitek
POPL3
2008 A System F with Call-by-Name Exceptions
Sylvain Lebresne
ICALP (2)1
2005 Computation of Chromatic Polynomials Using Triangulations and Clique Trees
Pascal Berthomé, Sylvain Lebresne, Kim Nguyen 0001
WG2