LFCS reports 1999
- Diluting ACID
Tim Kempster, Colin Stirling and Peter Thanisch
LFCS report ECS-LFCS-99-404
- Pre-logical Relations
Furio Honsell and Donald Sannella
LFCS report ECS-LFCS-99-405
- Type Systems For Polynomial-time Computation
Martin Hofmann
LFCS report ECS-LFCS-99-406
- Architectural Specifications in CASL
Michel Bidoit, Donald Sannella and Andrzej Tarlecki
LFCS report ECS-LFCS-99-407
- Decidability and complexity of equivalences for simple
process algebras
Jitka Stríbrná
LFCS report ECS-LFCS-99-408
- A Semantic analysis of control
James David Laird
LFCS report ECS-LFCS-99-409
- Abstract Machines for Memory Management
Christopher Walton
LFCS report ECS-LFCS-99-410
- Decidability of DPDA equivalence
Colin Stirling
LFCS report ECS-LFCS-99-411
- A Theory of Program Refinement
Ewen Denney
LFCS report ECS-LFCS-99-412
- A Polymorphic Type and Effect System for Detecting Mobile
Functions
Dilsun Kirli
LFCS report ECS-LFCS-99-413
- Fully Complete Models for ML Polymorphic Types
Samson Abramsky and Marina Lenisa
LFCS report ECS-LFCS-99-414
- Graphs for Recording Type Information
Bruce J. McAdam
LFCS report ECS-LFCS-99-415
- Proving Correctness of Modular Functional Programs
Christopher Owens
LFCS report ECS-LFCS-99-416
- Counting unlabelled subtrees of a tree is
#P-complete
Leslie Ann Goldberg and Mark Jerrum
LFCS report ECS-LFCS-99-417