Bahr and Hutton recently developed a new approach to calculating correct compilers directly from specifications of their correctness. However, the methodology only considers converging behaviour source language, which means that compiler could potentially produce arbitrary, erroneous code for programs diverge. In this article, we show how can naturally be extended support calculation address bo...

We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order abstract the underlying data structures (e.g. sets linear combinations) using notion monad. As an example this generalization advantage, we introduce a new derivation technique based on graded module also extend operators defining ...

A monadic formula ψ(Y ) is a selector for a monadic formula φ(Y ) in a structure M if ψ defines inM a unique subset P of the domain and this P also satisfies φ inM. If C is a class of structures and φ is a selector for ψ in everyM ∈ C, we say that φ is a selector for φ over C. For a monadic formula φ(X, Y ) and ordinals α ≤ ω1 and δ < ω , we decide whether there exists a monadic formula ψ(X, Y ...

In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded temporal formula to be verified is translated into a monadic first-order logic over difference inequalities, which we call monadic difference logic. Second, at each step of the timed run, the monadic difference formul...

We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. We propose to represent monadic queries by bottom-up deterministic Node Selecting Tree Transducers (Nstts), a particular class of tree au-tomata that we introduce. We prove that deterministic Nstts capture the class o...

The structure of monadic functional programs allows the integration of many different features by just changing the definition of the monad and not the rest of the program, which is a desirable feature from a software engineering and software maintenance point of view. We describe an algorithm for the automatic transformation of a group of functions into such a monadic form. We identify two cor...

We introduce a monadic metalanguage which combines two previously proposed monadic metalanguages: one for staging and the other for value recursion. The metalanguage includes also extensible records as a basic name management facility.

Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas over a decidable background theory, such as arithmetic and we here develop a semi-decision procedure for extracting...