The main challenge faced by automatic parallelization tools in functional languages is the fact that parallelism is often hidden under the syntax of complex recursive functions. In this paper, we propose an algebraic framework for parallelizing – automatically – two special classes of recursive functions. We show that these classes are comprehensive enough to include several well-known instance...

We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synthesis procedures for algebraic data types. We present new counterexample-guided algorithms for constructing verified programs. We have implem...

In this paper we define a model, namely the recursive ECATNets (Recatnets) based on a sound combination of Extended Concurrent Algebraic Term nets and Recursive Petri nets, allowing a concise modeling of dynamic reconfiguration mechanisms of flexible workflow processes. The descriptive power of Recatnes is well-suited for collaborative workflows modeling. Moreover the use of model checking tech...

In a previous paper we described how an incremental implementation can be derived from algebraic speciications belonging to the subclass of well-presented primitive recursive schemes. We combined term rewriting with techniques for storage and re-use from attribute grammars. Type check speciications typically belong to the class of primitive recursive schemes. The uniformity of algebraic speciic...

In this note, we study the total positivity of a class of infinite recursive matrices that depend on three infinite sets of independent variables and on an integer parameter. We give a simple algebraic proof and provide a few examples.

The paper presents an analysis of the interpretation of recursive types as logical relations in the framework of iterative algebraic theories. This allows a smoother presentation of the underlying technique, and easier proofs of properties of the interpretation.

In recent years, central components of a new approach to linguistics, the Minimalist Program (MP) have come closer to physics. Features of the Minimalist Program, such as the unconstrained nature of recursive Merge, the operation of the Labeling Algorithm that only operates at the interface of Narrow Syntax with the Conceptual-Intentional and the Sensory-Motor interfaces, the difference between...

This paper considers the robust control problem for nonstandard singularly perturbed systems with time-varying norm-bounded parameter uncertainties in state equations. In order to obtain the controller such that both robust stability and a disturbance attenuation level larger than a arbitrary boundary value are achieved, irrespective of uncertainties, we must solve algebraic Riccati equation wi...