This paper presents a dynamic approach to modelling grammatical relations. For this purpose, we turn to dynamic theories in Computer Science such as CSP (Communicating Sequential Processes) [Hoare1978] and ß-calculus [Milner1993] and by borrowing some concepts from these theories, we will discuss how communicating linguistic processes can be defined and constructed. Our approach, in spirit shares some similarities with parallel lexicalised theories such as LFG (Lexical Functional Grammar), but our main focus has been on defining the notion of grammatical channels for communication between processes, which will further be elaborated in this paper. We will also contrast some of our main design issues with some aspects of LFG. 1 Introduction Modelling grammatical relations has played an important role in recent linguistic theories. In diverse linguistic theories such as Government Binding (GB), Lexical Functional Grammar (LFG) and Head Driven Phrase Structure Grammar (HPSG), grammatical ...