A Domain-theoretic Model for a Higher-order Process Calculus (1996)

Cached

Download Links

by Radhakrishnan Jagadeesan , Prakash Panangaden
Venue:Proceedings of the 17th International Colloquium on Automata Languages and Programming
Citations:10 - 2 self

Documents Related by Co-Citation

60 Towards a lambda-calculus for concurrent and communicating systems – G erard Boudol - 1989
448 The Chemical Abstract Machine – Gérard Berry, Gérard Boudol - 1998
210 A powerdomain construction – G. D. Plotkin - 1976
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
130 Lambda-Calculus Models of Programming Languages – J H Morris - 1968
730 Notions of Computation and Monads – Eugenio Moggi - 1991
409 Testing Equivalences for Processes – R. De Nicola, M. C. B. Hennessy - 1984
72 Cylindric algebras part – L Henkin, J D Monk, A Tarski - 1985
315 Functions as processes – R Milner - 1990
4 Full Abstraction in the Lazy Lambda Calculus, Research Rep – S Abramsky, C H L Ong - 1989
25 Calculi for Higher-Order Communicating Systems – B Thomsen - 1990
48 A Syntactic Characterization of the Equality in some Models for the Lambda Calculus – Martin Hyland - 1976
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
16 The Semantics of Call-by-value and Call-byname in a nondeterministic Environment – M C B Hennessy - 1980
6 Syntactic Aspects of the Non-deterministic Lambda Calculus – K Sharma - 1984
9 Alcune proprieta' delle forme fi-j-normali nel -Kcalcolo", Pubblicazioni dell' I.A.C. n. 696 – C Bohm - 1968
3 Ronchi della Rocca, "(Semi)- separability of finite sets of terms – M Coppo, M Dezani-Ciancaglini, S - 1978
3 Functions as Processes", LNCS – R Milner - 1990
18 A mathematical semantics for a nondeterministic typed λcalculus. Theoret – M C B Hennessy, E A Ashcroft - 1980