• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Domain theory for concurrency (2003)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.brics.dk]
  • [www.brics.dk]
  • [www.daimi.au.dk]
  • [www.daimi.au.dk]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [www.brics.dk]
  • [www.brics.dk]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [www.daimi.au.dk]
  • [www.brics.dk]
  • [www.daimi.au.dk]
  • [www.daimi.au.dk]
  • [www.brics.dk]
  • [www.brics.dk]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Mikkel Nygaard
Citations:20 - 6 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Nygaard03domaintheory,
    author = {Mikkel Nygaard},
    title = {Domain theory for concurrency},
    year = {2003}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey.

Citations

2970 Communication and Concurrency - Milner - 1989
2115 Clocks and the Ordering of Events in a Distributed System - Lamport - 1978
1225 A calculus of communicating systems - Milner - 1980
1182 A structural approach to operational semantics - Plotkin - 1981
997 The Lambda Calculus: its Syntax and Semantics - Barendregt - 1984
665 The semantics of simple language for parallel programming - Kahn - 1974
651 Notions of computation and monads - Moggi - 1991
599 Concurrency and automata on infinite sequences - Park - 1981
520 Communicating and Mobile Systems: the π-Calculus - Milner - 1999
448 Algebraic laws for nondeterminism and concurrency - Hennessy, Milner - 1985
433 Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory - Stoy - 1977
272 Computational interpretations of linear logic - Abramsky - 1993
242 Models for concurrency - Winskel, Nielsen - 1995
218 The lazy lambda calculus - Abramsky - 1990
202 The Formal Semantics of Programming Languages: An Introduction - Winskel - 1993
196 A power domain construction - Plotkin - 1976
174 A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 - GABBAY, PITTS - 2001
172 A Calculus of Mobile Processes, Part I - Milner, Parrow, et al. - 1989
154 An abstract view of programming languages - Moggi - 1990
148 Anytime, Anywhere, Modal Logics for Mobile Ambients - Cardelli, Gordon - 2000
123 Introduction to Higher-Order Categorical Logic - Lambek, Scott - 1986
121 Lambda-Calculus Models of Programming Languages - Morris - 1968
118 Sketches of an elephant: a topos theory compendium - Johnstone - 2002
113 Bisimulation from open maps - Joyal, Nielsen, et al. - 1996
109 The formal theory of monads - Street - 1972
104 Scenarios, a model of non determinate computation - Brock, Ackerman - 1981
101 spaces: Why is a security protocol correct - Strand - 1998
101 A calculus of mobile processes, parts i and ii - Milner, Parrow, et al. - 1989
97 Communicating and Mobile Systems: the -Calculus - Milner - 1999
97 Linear logic, ∗-autonomous categories and cofree coalgebras - Seely - 1989
96 Categories for the working mathematician. Second edition - Lane - 1998
89 On closed categories of functors - Day - 1970
63 Semantics of weakening and contraction - Jacobs - 1994
55 Petri nets, event structures and domains, part 1, in "T.C.S - NIELSEN, PLOTKIN, et al. - 1981
53 Events in security protocols - Crazzolara, Winskel - 2001
50 Using information systems to solve recursive domain equations - Larsen, Winskel - 1984
46 Nominal unification - URBAN, PITTS, et al. - 2003
44 A fully abstract denotational model for higher-order processes - Hennessy - 1993
43 Presheaf models for concurrency - Cattani, Winskel - 1997
42 Type algebras, functor categories and block structure - Oles - 1985
38 Alpha-structural recursion and induction - Pitts
38 Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d’État, Université Paris VII - Berry - 1979
34 A functional correspondence between monadic evaluators and abstract machines for languages with computational effects - Ager, Danvy, et al. - 2005
28 A relational model of nondeterministic dataflow - Hildebrandt, Panangaden, et al. - 2004
27 Doctrinal adjunction - Kelly - 1974
26 An Axiomatic Approach to Adequacy - Bräuner - 1996
25 Handbook of Categorical Algebra I: Basic Category Theory - Borceux - 1994
23 Nominal equational logic - CLOUSTON, PITTS - 2007
21 A fully abstract domain model for the π-calculus - Stark - 1996
19 Linear lambda-calculus and categorical models revisited - Benton, Bierman, et al. - 1992
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University