A Language for Function Signature Representations

03/31/2018
by   Kyle Richardson, et al.
0

Recent work by (Richardson and Kuhn, 2017a,b; Richardson et al., 2018) looks at semantic parser induction and question answering in the domain of source code libraries and APIs. In this brief note, we formalize the representations being learned in these studies and introduce a simple domain specific language and a systematic translation from this language to first-order logic. By recasting the target representations in terms of classical logic, we aim to broaden the applicability of existing code datasets for investigating more complex natural language understanding and reasoning problems in the software domain.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2019

NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language

Rule-based models are attractive for various tasks because they inherent...
research
10/01/2021

Natural language understanding for logical games

We developed a system able to automatically solve logical puzzles in nat...
research
11/28/2016

Learning a Natural Language Interface with Neural Programmer

Learning a natural language interface for database tables is a challengi...
research
01/12/2016

Basic Reasoning with Tensor Product Representations

In this paper we present the initial development of a general theory for...
research
07/31/2017

The Code2Text Challenge: Text Generation in Source Code Libraries

We propose a new shared task for tactical data-to-text generation in the...
research
02/07/2021

A Note on Argumentative Topology: Circularity and Syllogisms as Unsolved Problems

In the last couple of years there were a few attempts to apply topologic...
research
06/29/2019

Domain-Specific Language to Encode Induction Heuristics

Proof assistants, such as Isabelle/HOL, offer tools to facilitate induct...

Please sign up or login with your details

Forgot password? Click here to reset