Papers supported by EPSRC GRANT GR/L54639/01

Logic Programming, Imperative Programming and Categorical Semantics

BibTeX

• Hayo Thielecke
  On Exceptions versus Continuations in the Presence of State
  Proceedings ESOP 2000, Springer LNCS 1782
  ©Springer-Verlag
  ML code from the figures
  
  
• Hayo Thielecke
  Continuations, functions and jumps
  Same in PDF
  Logic Column 8, SIGACT News, July 1999.
  
  
• Jon G. Riecke and Hayo Thielecke
  Typed Exceptions and Continuations Cannot Macro-Express Each Other
  ©Springer-Verlag
  Proc. ICALP '99, Springer LNCS 1644.
  
  
• John Power and Hayo Thielecke
  Closed Freyd- and kappa-categories
  ©Springer-Verlag
  Proc. ICALP '99, Springer LNCS 1644.
  
  
• Hayo Thielecke
  Using a continuation twice and its implications for the expressive power of call/cc
  Higher-Order and Symbolic Computation 12(1),1999, ©Kluwer
  Here is some code from the paper: in Scheme or Standard ML of New Jersey - the latter needs SMLofNJ.Cont
  
  
• Hayo Thielecke
  An introduction to Landin's 'A Generalization of Jumps and Labels'
  Higher-Order and Symbolic Computation 11(2), 1998, ©Kluwer
  
  
• P.W. O'Hearn and D. J. Pym
  The logic of bunched implications
  Bulletin of Symbolic Logic , 5(2), June 1999, pp215-244
  
  
• P.W. O'Hearn
  Resource Interpretations, Bunched Implications and the alpha-lambda-calculus
  J.-Y. Girard, ed., Typed Lambda Calculi and Applications, 4th International Conference, L'Aquila, Italy, April 1999. Proceedings, Typed Lambda-Calculi and Applications, L'Aquila, Italy, April 1999.LNCS 1581 ©Springer-Verlag
  
  
• P.W. O'Hearn
  Polymorphism, Objects and Abstract Types
  SIGACT News , Volume 29(4), pp39-50, December 1998
  
  
• D.J. Pym
  
  
  
• D.J. Pym
  
  
  
• F. De Marchi, E.P. Robinson and G. Rosolini
  An Abstract Look at Realizability
  
  
  
• John Power and Edmund Robinson
  Logical Relations, Data Abstraction and Structured Fibrations
  ACM  PPDP'00: International Conference on Principles and Practice of Declarative Programming, September 2000
  
  
• John Power and Edmund Robinson
  Logical Relations and Data Abstraction
  Computer Science Logic 2000
  
  
• John Power and Edmund Robinson
  Modularity and Dyads
  Electronic Notes in Theoretical Computer Science 20, 1999
  Online