Programování s omezujícími podmínkami — na cestě ke svatému grálu
Ragionando sul fallimento finito e le computazioni infinite usando l’interpretazione astratta
Realization of generalized good translation algorithm on computer
Reducibility method in simply typed lambda calculus.
Reduction semantics for rational schemes
Refinement of UML collaborations
The paper concerns the concept of refinement as a commonly used design practice in the software development process. The refinement relationship is formulated and formally expressed for UML collaborations. Collaborations are suitable for presenting the proposed approach as they represent both static and dynamic aspects of a modeled system or its part, for example, a use case. Our approach to refinement is based on the rule of preserving the observable behavior of a modeled system. The introduced...
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....
Resolution Methods in Proving the Program Correctness
Résolution systolique de systèmes linéaires denses
Second Order Optimization Methods in Lisp
Semantic analysis of an ALGOL text
Semantic analysis of topic and focus
Semantics and translation of grammars and ALGOL-like languages
Semantics of value recursion for monadic input/output
Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell’s IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper, we...
Semantics of value recursion for Monadic Input/Output
Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell's IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper,...
Sémantique algébrique de l'appel par valeur
Sémantique algébrique d'un langage de programmation type Algol
Sémantique des processus communicants
Sémantique des structures de contrôle
Sémantique du parallélisme et du choix du langage Electre