This paper presents a proposal to use continuations as an implementation mechanism for ATL. We introduce the notion of continuation, showing its applicability to model-to-model transformations, and develop a simple mechanism to enable continuations in model transformations. Then, the declarative part of ATL is mapped to this mechanism.

Implementing a compiler for such a language with nonde-terministic features is known to be a diicult task. This paper presents two new functions setChoicePoint and fail that extend the C language to eeciently handle choice point management. Algorithms and implementation techniques are detailed. As an application, we give compilation schemes to illustrate the power and the easy use of setChoiceP...

We introduce the most recent and advanced implementation of CHR which improves both on previous implementations (in terms of completeness, ex-ibility and eeciency) and on the principles that should guide such an implementation. The idea is to have three rather independent phases of the compiler that utilize templates to generate the code and macros to specialize it. Moreover, our new implementa...

Abstract State Machines (ASMs) have been widely used to specify software and hardware systems. Only a few of these specifications are executable, although there are several interpreters and some compilers. This paper introduces a compilation scheme to transform an ASM specification in the syntax of the ASM-Workbench into C++. In particular, we transform algebraic types, pattern matching, functi...

| This paper addresses problems in conceptual graph implementation: subsumption and classiication in a taxon-omy. Conceptual graphs are typically stored using a directed acyclic graph data structure based on the partial order over conceptual graphs. We give an improved algorithm for classifying conceptual graphs into this hierarchy. This algorithm prunes the search space in the database using t...

An exception compilation scheme that dynamically creates and removes exception handler entries on the stack. A formalization of an article of the same name by Hutton and Wright [1]. 1 Compiling exception handling theory Exceptions imports Main begin 1.1 The source language datatype expr = Val int | Add expr expr | Throw | Catch expr expr consts eval :: "expr ⇒ int option" primrec "eval (Val i) ...

We consider defining executable dialogues for communicating agents. Towards this end, we introduce agent classes whose communication primitives are based on deduction. Their operational semantics are given by an abstract logical machine that is defined purely in sequential terms. These agents communicate under the control of plans requiring a synchronization flag. These plans can be rewritten a...

A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids three-braids . These three-braids can...

This paper discusses the implementation of an Er-lang compiler which provides native compilation using C as an intermediate language. The intermediate output, while not elegant, is amenable to being ported away from the Erlang environment and into morètraditional' C based development environments. The compiler also provides a number of special features. These features include support for a conc...