(Enter summary)
Abstract: This dissertation is an investigation into the type-theoretic foundations of concurrency. (Update)
Context of citations to this paper: More
.... category SProc D whose types specify deadlock freedom [6] and the asynchronous category ASProc whose types are safety specifications [20]. Future work will combine the ideas of these calculi into a syntax to accompany the semantic type system of the present paper. Much of our...
...which the global synchrony condition is not present. Preliminary versions of this work have appeared in [2,23] and improved versions in [9,39]; a full report of this area will be the subject of a future paper. Beyond the issues of synchrony and a formal syntax, there are two...
Cited by: More
A Type-theoretic Approach to Deadlock-freedom of.. - Abramsky, Gay, Nagarajan (1997)
(Correct)
A Specification Structure for Deadlock-Freedom of.. - Abramsky, Gay, al. (1998)
(Correct)
Active bibliography (related documents): More All
0.0: A Brief Guide to Linear Logic - Scedrov (1993)
(Correct)
0.0: Mathematical Vernacular and Conceptual Well-formedness in.. - Luo, Callaghan (1998)
(Correct)
0.0: A Theory of Program Refinement - Denney (1998)
(Correct)
Similar documents based on text: More All
0.4: A Typed Calculus of Synchronous Processes - Gay, Nagarajan (1995)
(Correct)
0.4: in Interaction Categories - Simon Gay And
(Correct)
0.4: Full Abstraction for PCF - Samson Abramsky University (1994)
(Correct)
Related documents from co-citation: More All
5: Theoretical Computer Science (context) - Girard - 1987
4: An interaction-based language and its typing system
- Takeuchi, Honda et al. - 1994
4: A partially deadlock-free typed process calculus
- Kobayashi - 1997
BibTeX entry: (Update)
R. Nagarajan. Typed Concurrent Programs: Specification & Verification. PhD thesis, University of London, 1997. To appear. http://citeseer.ist.psu.edu/nagarajan98typed.html More
@misc{ nagarajan97typed,
author = "R. Nagarajan",
title = "Typed Concurrent Programs: Specification & Verification",
text = "R. Nagarajan. Typed Concurrent Programs: Specification & Verification.
PhD thesis, University of London, 1997. To appear.",
year = "1997",
url = "citeseer.ist.psu.edu/nagarajan98typed.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
562
Categories for the Working Mathematician (context) - Lane - 1971
359
Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
322
volume 92 of Lecture Notes in Computer Science (context) - Milner, for et al. - 1980
137
Laboratory for Foundations of Computer Science (context) - Milner, Technical
137
Laboratory for Foundations of Computer Science (context) - Milner, mcalculus et al. - 1991
86
A partially deadlock-free typed process calculus
- Kobayashi
54
Games and Full Abstraction for a Functional Metalanguage wit.. (context) - McCusker - 1996
47
Lilac: A functional programming language based on linear log.. (context) - Mackie - 1994
47
Department of Computer Science (context) - Milner, for et al. - 1993
33
From petri nets to linear logic (context) - Marti-Oliet, Meseguer - 1991
33
Deliverables: A categorical approach to program development ..
- McKinna, Burstall - 1993
29
ACM SIGACTNotices (context) - Lincoln - 1992
1
Programming Martin Lf's Type Theop Introduction (context) - Petersson, in et al. - 1990
1
rd ACM Symposium on Principles of Programming Languages (context) - Kobayashi, Pierce et al. - 1996
Documents on the same site (http://www.doc.ic.ac.uk/~rn4/research.html): More
Flow Analysis: Games and Nets (Extended Abstract) - Hankin, Nagarajan, Sampath (2002)
(Correct)
A Type-theoretic Approach to Deadlock-freedom of.. - Samson Abramsky Simon (1997)
(Correct)
A Typed Calculus of Synchronous Processes - Gay, Nagarajan (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC