On the Learnability of Programming Language Semantics

  title={On the Learnability of Programming Language Semantics},
  author={Dan R. Ghica and Khulood AlYahya},
Game semantics is a powerful method of semantic analysis for programming languages. It gives mathematically accurate models ("fully abstract") for a wide variety of programming languages. Game semantic models are combinatorial characterisations of all possible interactions between a term and its syntactic context. Because such interactions can be concretely represented as sets of sequences, it is possible to ask whether they can be learned from examples. Concretely, we are using long short-term… 

Figures from this paper



A System-Level Game Semantics

The regular-language semantics of second-order idealized ALGOL

LCF Considered as a Programming Language

Full Abstraction for PCF

The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.

Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions

Clipping: A Semantics-Directed Syntactic Approximation

  • D. GhicaA. Bakewell
  • Computer Science
    2009 24th Annual IEEE Symposium on Logic In Computer Science
  • 2009
In this paper we introduce ``clipping,'' a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for a given programming

On Full Abstraction for PCF: I, II, and III

An order-extensional, order (or inequationally) fully abstract model for Scott's language pcf, based on a kind of game in which each play consists of a dialogue of questions and answers between two players who observe the following principles of civil conversation.

The denotational semantics of programming languages

This paper is a tutorial introduction to the theory of programming language semantics developed by D. Scott and C. Strachey and presents a formal definition of the language GEDANKEN.

A Neural Probabilistic Language Model

This work proposes to fight the curse of dimensionality by learning a distributed representation for words which allows each training sentence to inform the model about an exponential number of semantically neighboring sentences.

Syntactic control of concurrency