Mathematical Structures in Computer Science, Volume 4

Volume 4, Number 1, March 1994

• Bruno Courcelle:
  Recognizable Sets of Graphs: Equivalent Definitions and Closure Properties. 1-32
  
• Oege de Moor:
  Categories, Relations and Dynamic Programming. 33-69
  
• Ryu Hasegawa:
  Categorical Data Types in Parametric Polymorphism. 71-109
  
• Thomas Streicher:
  A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists. 111-115
  

Volume 4, Number 2, June 1994

• Peter M. W. Knijnenburg, Frank Nordemann:
  Partial Hyperdoctrines: Categorical Models for Partial Function Logic and Hoare Logic. 117-146
  
• Kenneth Baclawski, Dan A. Simovici, William White:
  A Categorical Approach to Database Semantics. 147-183
  
• Dominique Duval, Jean-Claude Reynaud:
  Sketches and Computation - I: Basic Definitions and Static Evaluation. 185-238
  
• Dominique Duval, Jean-Claude Reynaud:
  Sketches and Computation - II: Dynamic Evaluation and Applications. 239-271
  
• Arnaud Fleury, Christian Retoré:
  The Mix Rule. 273-285
  

Volume 4, Number 3, September 1994

• Kimmo I. Rosenthal:
  A Categorical Look at Tree Automata and Context-Free Languages. 287-293
  
• Michael Pfender, K. Kröplin, D. Pape:
  Primitive Recursion, Equality, and a Universal Set. 295-313
  
• Roberto Di Cosmo, Delia Kesner:
  Simulating Expansions without Expansions. 315-362
  
• Joseph A. Goguen, Razvan Diaconescu:
  An Oxford Survey of Order Sorted Algebra. 363-392
  

Volume 4, Number 4, December 1994

• Harold Simmons:
  The Glueing Construction and Lax Limits. 393-431
  
• Andrzej Ehrenfeucht, Grzegorz Rozenberg:
  Dynamic Labeled 2-Structures. 433-455
  
• Andrea Asperti, Cosimo Laneve:
  Interaction Systems I: The Theory of Optimal Reductions. 457-504
  
• Steven T. Tschantz:
  Languages under Concatenation and Shuffling. 505-511
  

Last update Thu May 23 15:25:59 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page