In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Co...
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
In computer science methods to aid learning are very important, because abstract models are used frequently. For this conventional teaching methods do not suffice. We have develope...
PLT develops foundations for building reliable, high-performance software. Foundations include practices, languages, semantics, implementation techniques and type systems. To dem...