Process Realizability (2000)

Cached

Download Links

by Samson Abramsky
Venue:In Foundations of Secure Computation
Citations:8 - 1 self

Documents Related by Co-Citation

30 Proofs as processes – Samson Abramsky - 1994
95 Proofs as programs – Joseph L Bates, Robert L Constable - 1985
8 Predicate transformers for infinite-state automata in nuprl type theory – Mark Bickford, Jason Hickey - 1999
15 On Interprocess Communication and the Implementation of Multi-Writer Atomic Registers – Uri Abraham - 1995
61 CC++: A Declarative Concurrent Object Oriented Programming Notation – K. Mani Chandy, Carl Kesselman - 1992
33 The horus and ensemble projects: accomplishments and limitations – K Birman, B Constable, M Hayden, J Hickey, C Kreitz, R Van Renesse, O Rodeh, W Vogels - 2000
426 The Chemical Abstract Machine – Gérard Berry, Gérard Boudol - 1998
417 The calculus of constructions – Coquand, G Huet - 1988
2972 Communication and Concurrency – R Milner - 1989
3119 Communicating Sequential Processes – C. A. R. Hoare - 2004
201 Linear Objects: logical processes with built-in inheritance – Jean-marc Andreoli, Remo Pareschi
541 Light Linear Logic – Jean-yves Girard
403 Concurrent Constraint Programming – Vijay A. Saraswat, Martin Rinard - 1993
12 Constructive mathematics and automatic program writers – Robert L Constable - 1971
24 Degrees of indeterminacy of games – A Blass - 1972
112 A game semantics for linear logic – A Blass - 1992
197 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
44 Algorithmic Game Semantics – Samson Abramsky - 2001
1 A Linear-time Algorithm for Verifying MLL Proof Nets via Lamarche's Essential Nets, unpublished manuscript – R Communication Milner, Prentice-Hall Concurrency - 1989