Concurrent combinators
October 14th 2007
   |
|
Concurrent combinators
Programming Deep Concurrent Constraint Combinators
Programming Deep Concurrent Constraint Combinators Christian Schulte Programming Systems Lab, Universitšat des Saarlandes Postfach 151150,66041 Saarbršucken, Germany schulte@ps ... (more...)
Programming Deep Concurrent Constraint Combinators
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as ... (more...)
Citations: Replication in Concurrent Combinators - Honda, Yoshida ...
Kohei Honda and Nobuko Yoshida. Replication in Concurrent Combinators. In M. Hagiya and J. C. Mitchell, editors, Theoretical Aspects of Computer Software, volume 789 of Lecture ... (more...)
Citations: Graph Notation for Concurrent Combinators - Yoshida ...
Yoshida, N., Graph Notation for Concurrent Combinators, Proc. TPPP'94, LNCS 907, pp.393--412, Springer-Verlag, 1995. (more...)
Graph notation for concurrent combinators - CiteSeerX
Document details from CiteSeerX (Isaac Councill, Lee Giles): Abstract. We introduce graph notation for concurrent processes which does not use the notion of port names for its ... (more...)
Programming Deep Concurrent Constraint Combinators
Programming Deep Concurrent Constraint Combinators. Saarland University Computer Science Programming Systems Publications Overview Alice Mozart SFB 378 (more...)
Replication in concurrent combinators ? CiteSeerX citation query
Scientific documents that cite the following paper: Replication in concurrent combinators, by K Honda, N Yoshida (more...)
9 Deep-guard Concurrent Constraint Combinators: Combinator
Prev - Up - Next >> (more...)
Graph Notation For Concurrent Combinators - Yoshida (ResearchIndex)
We introduce graph notation for concurrent processes which does not use the notion of port names for its formulation. The operators in the algebra of graphs proposed in this paper ... (more...)
Replication in Concurrent Combinators - Honda, Yoshida (ResearchIndex)
We establish the behavioural representability of input prefix and replication, which are two basic operators of the asynchronous calculus cf. an offspring of calculus in a system ... (more...)