LFCS reports by Author: R

Rasmussen, Lars E

• Approximating the Permanent: a Simple Approach
  L E Rasmussen
  LFCS report ECS-LFCS-92-201
  

Read, M

• Formal Program Development in Modular Prolog: A Case Study
  M Read and E Kazmierczak
  LFCS report ECS-LFCS-92-195
  

Recalde, Laura

• Elementary structural analysis for PEPA
  Stephen Gilmore, Jane Hillston and Laura Recalde
  LFCS report ECS-LFCS-97-377
  

Reichel, Horst

• Nested Sketches
  Horst Reichel
  LFCS report ECS-LFCS-98-401
  

Reynolds, John

• On Functors Expressible in the Polymorphic Typed Lambda Calculus
  J. Reynolds and G. Plotkin
  LFCS report ECS-LFCS-88-53
  

Ritchie, Brian

• The Interactive Proof Editor - An Experiment in Interactive Theorem
  B Ritchie and P Taylor
  LFCS report ECS-LFCS-88-61
  
• The Design and Implementation of an Interactive Proof Editor
  B. Ritchie
  LFCS report ECS-LFCS-88-68 (also published as CST-57-88)
  

Robinson, Robert

• Generating and counting Hamilton cycles in random regular graphs
  Alan Frieze, Mark Jerrum, Michael Molloy, Robert Robinson and Nicholas Wormald
  LFCS report ECS-LFCS-94-313
  

Rothwell, Nick

• The Generation of Concurrent Code for Declarative Languages
  N. Rothwell
  ECS-LFCS-87-37 (also published as CST-44-87)
  
• Functional Compilation from the Standard ML Core Language to Lambda Calculus
  Nick Rothwell
  LFCS report ECS-LFCS-92-235
  
• Parsing in the SML Kit
  Nick Rothwell
  LFCS report ECS-LFCS-92-236
  
• Miscellaneous Design Issues in the ML Kit
  Nick Rothwell
  LFCS report ECS-LFCS-92-237
  

Russo, Claudio

• Standard ML Type Generativity as Existential Quantification
  Claudio Russo
  LFCS report ECS-LFCS-96-344
  
• Types For Modules
  Claudio V. Russo
  LFCS report ECS-LFCS-98-389
  

Rydeheard, David

• Computing with Categories
  R.Burstall and D.Rydeheard
  LFCS report ECS-LFCS-86-9