|
|
Edinburgh Research Archive >
Browsing by Author Plotkin, Gordon
Showing results 28 to 47 of 48
| Issue Date | Title | Author(s) | Supervisor(s) | | 2010 | Modular languages for systems and synthetic biology | Pedersen, Michael | Plotkin, Gordon |
| 2002 | Notions of Computation Determine Monads | Plotkin, Gordon; Power, John | - |
| 1996 | On a Question of H. Friedman | Plotkin, Gordon | - |
| 1991 | On Functors Expressible in the Polymorphic Typed Lambda Calculus | Plotkin, Gordon; Reynolds, John | - |
| 1983 | Operational approach to semantics and translation for programming languages | Li, Wei | Plotkin, Gordon; Hennessy, Matthew; Milner, Robin |
| Jul-2000 | Ordinals and Interactive Programs | Hancock, Peter | Plotkin, Gordon |
| Jul-1988 | The Partial Lambda Calculus | Moggi, Eugenio | Plotkin, Gordon |
| 5-Nov-2003 | A Per Model of Polymorphism and Recursive Types | Abadi, Martin; Plotkin, Gordon | - |
| Jul-1990 | Probabilistic Non-Determinism | Jones, Claire | Plotkin, Gordon |
| Jul-1994 | The Proof Theory and Semantics of Intuitionistic Modal Logic | Simpson, Alex K | Plotkin, Gordon |
| Jul-1995 | Realizability Toposes and Language Semantics | Longley, John R | Fourman, Michael; Plotkin, Gordon |
| 2003 | Semantics for algebraic operations | Plotkin, Gordon; Power, John | - |
| 1991 | A Semantics for Static Type Inference | Plotkin, Gordon | - |
| 5-Nov-2003 | A Set-Theoretical Definition of Application | Plotkin, Gordon | - |
| 5-Nov-2003 | Subtyping and Parametricity | Plotkin, Gordon; Abadi, Martin; Cardelli, Luca | - |
| Jul-1999 | A Theory of Program Refinement | Denney, Ewen WKC | Plotkin, Gordon; Power, John |
| 6-Nov-2003 | Three Inadequate Models | Plotkin, Gordon | - |
| 2008 | Topological Domain Theory | Battenfeld, Ingo | Simpson, Alexander; Plotkin, Gordon |
| 5-Nov-2003 | Towards a Mathematical Operational Semantics | Plotkin, Gordon; Turi, Daniele | - |
| 5-Nov-2003 | Type Theory and Recursion Extended Abstract | Plotkin, Gordon | - |
Showing results 28 to 47 of 48
|
