Complete completion using types and weights

GveroTihomir,; KuncakViktor,; KurajIvan,; Piskač, Ružica

doi:10.1145/2499370.2462192

Cited by 37 publications

(41 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, based on definitions in a library a new sequence of expressions is synthesized that uses the input values from the query, executes the desired effect and returns a value of the expected type. Some recent work on this topic is Scala InSynth [GKKP13] and CodeHint [GRB + 14].…”

Section: Program Synthesis Toolsmentioning

confidence: 99%

Scaps: type-directed API search for Scala

Wegmann¹,

Mehta

Sommerlad

et al. 2016

Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala

View full text Add to dashboard Cite

Reusing existing functionality from legacy code and third party programming libraries is often hard, because the vast number of definitions and the complexity of the APIs require a detailed knowledge of the programming environment. To help developers discovering such functionality when working with a statically typed, object-oriented programming language, we designed an API retrieval system that supports querying indexed APIs with textual keywords and type signatures. The feature of the search engine is inspired by a similar tool for the Haskell programming language called Hoogle. Though, we decided to develop another approach to address the API search problem based on traditional information retrieval techniques which, we argue, is better suited for object-oriented languages.As a proof of concept, we implemented the API retrieval system for the Scala programming language and provided a web-based user interface. Furthermore, we demonstrate how Scala-specific language features like user-defined implicit conversions and implicit parameters can be included into our basic approach. A comparison to a system using only exact matches of partial types of the query shows that the effectiveness of API retrieval can be substantially improved with our approach. Management SummaryThis thesis describes the design of a type directed search engine for statically-typed, object-oriented programming languages. Furthermore, we provide an implementation for the Scala programming language that incorporates Scala specific language constructs. Status QuoA crucial part of creating high quality software projects is the reuse of existing functionality provided by in-house or third party programming libraries. This ensures that functionality is not unnecessarily reimplemented and lowers the risk of introducing erroneous behavior. Code reused over various projects tends to be well-tested and battle-proofed.Discovering existing functionality is a task that requires either a deep knowledge of the according libraries or appropriate tools that provide access convenient to the definitions in a library. Some examples of such tools are code completion assistants that list the accessible members of an object in question and automatically generated documentation pages for the available classes. Though, these tools tend to give an incomplete picture of the available operations, because functionality provided through utility classes or by additional libraries are usually not listed.In this case, developers often resort to universal search engines like Google to find a specific implementation. While these search engines often provide suitable results, users have to manually mine the result pages for suitable content. Additionally, the result pages may refer to outdated revisions of a library.In the functional programming community, a popular tools to overcome these issues are search engines, like Hoogle for Haskell, that accept type signatures as search queries and retrieve definitions of a similar type. In combination with a powerful type syst...

show abstract

Section: Program Synthesis Toolsmentioning

confidence: 99%

Scaps: type-directed API search for Scala

Wegmann¹,

Mehta

Sommerlad

et al. 2016

Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala

View full text Add to dashboard Cite

show abstract

“…There are several tools that find, rank and present the most appropriated synthesized code portions to the programmer. InSynth [9] is an IDE extension which allows users to synthesize code snippets based on the type of the current expression. Although these approaches are not completely automatic due to the lack of complete specifications, they reduce the burden of the programmer.…”

Section: Related Workmentioning

confidence: 99%

“…A promising approach to realize these goals is to empower users themselves to program, blurring the traditional divide between professional software developers and end users. This direction is especially appealing as the increasing computing capabilities of these ubiquitous devices enable more advanced runtimes and software development tools, and as new algorithmic techniques enable automated programming assistance and synthesis [8,9,13,20,22].…”

Section: Introductionmentioning

confidence: 99%

Game programming by demonstration

Mayer

Kunčak

2013

Proceedings of the 2013 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming &Amp; Software

Self Cite

View full text Add to dashboard Cite

The increasing adoption of smartphones and tablets has provided tens of millions of users with substantial resources for computation, communication and sensing. The availability of these resources has a huge potential to positively transform our society and empower individuals. Unfortunately, although the number of users has increased dramatically, the number of developers is still limited by the high barrier that existing programming environments impose.To understand possible directions for helping end users to program, we present Pong Designer, an environment for developing 2D physics games through direct manipulation of object behaviors. Pong Designer is built using Scala and runs on Android tablets with the multi-touch screen as the main input. We show that Pong Designer can create simple games in a few steps. This includes (multi-player and multi-screen) Pong, Brick Breaker, Pacman, Tilting maze. We make available Pong Designer as well as several editable games that we created using it. This paper describes the main principles behind Pong Designer, and illustrates the process of developing and customizing behavior in this approach.

show abstract

“…Automated data structure generation techniques are useful in many contexts: software testing [10,11,18,45], synthesis [30,32], bounded and unbounded verification [3,15,25,28], theorem proving [6,12], and others [4,9,22,24,31]. The structures in question are not just the common algorithmic data structures that are the backbone of common libraries, but also domain-specific structures, such as abstract models of programs in compilers, image formats, or DOM trees in browsers.…”

Section: Introductionmentioning

confidence: 99%

“…Different generation techniques provide different sets of features. While some techniques rely on a costly generate-and-test approach [22,32,42], efficient techniques usually avoid explicit enumeration of all possible structures [13,28,43]. Most of the prior work employs some form of backtracking: with a constraint solver [28,40,43], using custom search [4,40], or non-deterministic execution [18].…”

Section: Introductionmentioning

confidence: 99%

Programming with enumerable sets of structures

Kuraj

Kunčak

Jackson

2015

Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applicatio

Self Cite

View full text Add to dashboard Cite

We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, and memoized enumeration from not only finite but also infinite domains, while providing fine-grained control over the process. Furthermore, the framework efficiently supports the inverse of enumeration (checking whether a structure can be generated and fast-forwarding to this structure to continue the enumeration) and lazy enumeration (achieving exhaustive testing without generating all structures). The foundation of efficient enumeration lies in both direct access to encoded structures, achieved with well-known and new pairing functions, and dependent enumeration, which embeds constraints into the enumeration to avoid backtracking. Our framework defines an algebra of enumerators, with combinators for their composition that preserve exhaustiveness and efficiency. We have implemented our framework as a domain-specific language in Scala. Our experiments demonstrate better performance and shorter specifications by up to a few orders of magnitude compared to existing approaches.

show abstract

Complete completion using types and weights

Cited by 37 publications

References 22 publications

Scaps: type-directed API search for Scala

Scaps: type-directed API search for Scala

Game programming by demonstration

Programming with enumerable sets of structures

Contact Info

Product

Resources

About