Towards meta-interpretive learning of programming language semantics

07/20/2019
by   Sándor Bartha, et al.
0

We introduce a new application for inductive logic programming: learning the semantics of programming languages from example evaluations. In this short paper, we explored a simplified task in this domain using the Metagol meta-interpretive learning system. We highlighted the challenging aspects of this scenario, including abstracting over function symbols, nonterminating examples, and learning non-observed predicates, and proposed extensions to Metagol helpful for overcoming these challenges, which may prove useful in other domains.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2020

The Prolog Debugger and Declarative Programming. Examples

This paper contains examples for a companion paper "The Prolog Debugger ...
research
08/04/2021

Reasoning about Iteration and Recursion Uniformly based on Big-step Semantics

A reliable technique for deductive program verification should be proven...
research
01/20/2019

A tensorized logic programming language for large-scale data

We introduce a new logic programming language T-PRISM based on tensor em...
research
02/11/2023

Languages with Decidable Learning: A Meta-theorem

We study expression learning problems with syntactic restrictions and in...
research
11/18/2020

RustViz: Interactively Visualizing Ownership and Borrowing

Rust is a systems programming language that guarantees memory safety wit...
research
04/21/2021

Possibilities, Challenges and Limits of a European Charters Corpus (Cartae Europae Medii Aevi - CEMA)

The objective of this paper is to present a meta-corpus of diplomatic do...
research
05/08/2000

A Denotational Semantics for First-Order Logic

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational ...

Please sign up or login with your details

Forgot password? Click here to reset