Add to ORKGWe present here GM-C, a Graph Categorical Multi-Combinator Machine, a new machine for the compilation of lazy functional languages. The performance figures presented in this work show that GM-C can be faster than a G-Machine, which was implemented with a much higher degree of sophistication. Published in: Microprocessing & Microprogramming vol 31(1-5):81-84, North-Holland, 199
To integrate CA*-systems with other applications in the world of CIM, one principal approach current...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
In papers [1,2] there were consider different assumptions for averaging methods along the vertical c...
AbstractConcurrent object-oriented languages provide a suitable target for a compositional design pr...
This paper deals with pathfollowing methods in nonlinear optimization. We study the so- called "stan...
We present a non-looping method to construct Kripke trees refuting the non-theorems of intuitionisti...
AbstractLet Q be a Girard quantale. In other words Q is a complete lattice which also has the struct...
In a dialogue procedure the decision maker has to determine in each step the aspiration and reservat...
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formul...
AbstractLast works in linear logic mark a trend that can be summarized as: studying of fragments of ...
This thesis presents a design style for implementing communicating sequential processes (CSP) as qua...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
In this paper a method for solving a mid-term unit commitment problem in a large scale thermal power...
We show how the subtype relation of the well-known system Fsub, the second-order polymorphic lambda-...
Differential algebraic equations consisting of a constant coefficient linear part and a small nonlin...
To integrate CA*-systems with other applications in the world of CIM, one principal approach current...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
In papers [1,2] there were consider different assumptions for averaging methods along the vertical c...
AbstractConcurrent object-oriented languages provide a suitable target for a compositional design pr...
This paper deals with pathfollowing methods in nonlinear optimization. We study the so- called "stan...
We present a non-looping method to construct Kripke trees refuting the non-theorems of intuitionisti...
AbstractLet Q be a Girard quantale. In other words Q is a complete lattice which also has the struct...
In a dialogue procedure the decision maker has to determine in each step the aspiration and reservat...
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formul...
AbstractLast works in linear logic mark a trend that can be summarized as: studying of fragments of ...
This thesis presents a design style for implementing communicating sequential processes (CSP) as qua...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
In this paper a method for solving a mid-term unit commitment problem in a large scale thermal power...
We show how the subtype relation of the well-known system Fsub, the second-order polymorphic lambda-...
Differential algebraic equations consisting of a constant coefficient linear part and a small nonlin...
To integrate CA*-systems with other applications in the world of CIM, one principal approach current...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
In papers [1,2] there were consider different assumptions for averaging methods along the vertical c...