LFCS reports 1989
- Towards formal development of ML programs, foundations and
methodology
Donald Sannella and Andrzej Tarlecki
LFCS report ECS-LFCS-89-71
- Proving correctness of constructor implementations
Jorge Farrés-Casals
LFCS report ECS-LFCS-89-72
- Four Lectures on Standard ML
Mads Tofte
LFCS report ECS-LFCS-89-73
- THORN: A Theorem-Prover that compiles first-order Logic into
LISP
M. Tarver
LFCS report ECS-LFCS-89-74
- Structure and Representation in LF
Harper, Sannella and Tarlecki
LFCS report ECS-LFCS-89-75
- Characteristic Formulae for CCS with Divergence
B. Steffen
LFCS report ECS-LFCS-89-76
- Proof-Theoretic Characterisations of Logic
Programming
J. Andrews
LFCS report ECS-LFCS-89-77
- Local Model Checking in the Modal Mu-Calculus
C. Stirling and D. Walker
LFCS report ECS-LFCS-89-78
- Finite Constants: Characterizations of a new decidable set
of constants
B. Steffen and J. Knoop
LFCS report ECS-LFCS-89-79
- DIALOG: A Theorem-proving environment designed to unify
Functional and Logic Programming
M. Tarver
LFCS report ECS-LFCS-89-80
- The Definition of Standard ML - Version 3
Harper, Milner and Tofte
LFCS report ECS-LFCS-89-81
- Optimal Data Flow Analysis via Observational
Equivalence
Bernhard Steffen
LFCS report ECS-LFCS-89-82
- The Concurrency Workbench: A Semantics-based Verification
Tool for Finite-State Systems
R. Cleaveland, J. Parrow and B. Steffen
LFCS report ECS-LFCS-89-83
- Axioms for Concurrency
Faron Moller
LFCS report ECS-LFCS-89-84 (also published as CST-59-88)
- A Calculus of Mobile Processes Pt.1
Milner, Parrow and Walker
LFCS report ECS-LFCS-89-85
- A Calculus of Mobile Processes Pt.2
Milner, Parrow and Walker
LFCS report ECS-LFCS-89-86
- Relating Petri Nets to Formulae of Linear Logic
Carolyn Brown
LFCS report ECS-LFCS-89-87
- On Natural deduction style semantics, environments and
stores
Christian-Emil Ore
LFCS report ECS-LFCS-89-88
- Playing with Lego: Some examples of developing mathematics
in the Calculus of Constructions
Paul Taylor
LFCS report ECS-LFCS-89-89
- Some Fundamental Algebraic Tools for the Semantics of
Computation. Part 3. Indexed Categories
R. Burstall, J. Goguen and A. Tarlecki
LFCS report ECS-LFCS-89-90
- Automated Analysis of Mutual Exclusion Algorithms using
CCS
D J Walker
LFCS report ECS-LFCS-89-91
- The Structure of free closed categories
C Barry Jay
LFCS report ECS-LFCS-89-92
- Equations, dependent equations and quasi-dependent equations
-- on their unification
Sun Yong
LFCS report ECS-LFCS-89-93
- Equational Characterization of Binding (Extended
Abstract)
Sun Yong
LFCS report ECS-LFCS-89-94
- Logical Design of VLSI Circuit with Extension of Uncertainty
(or monotonic functional completeness of Kleene ternary
logic)
Sun Yong
LFCS report ECS-LFCS-89-95
- Petri Nets as Quantales
Carolyn Brown
LFCS report ECS-LFCS-89-96
- The Nonexistence of Finite Axiomatisations for CCS
congruences
Faron Moller
LFCS report ECS-LFCS-89-97
- Self-independent Petri Nets (or a dead-lock-free
paradigm)
Sun Yong
LFCS report ECS-LFCS-89-98
- Compositional Characterization of observable Program
Properties
B. Steffen, C.B. Jay, M. Mendler
LFCS report ECS-LFCS-89-99
- Proving total correctness of concurrent programs without
using auxiliary variables
P. Paczkowski
LFCS report ECS-LFCS-89-100
- Syntax, typechecking and Dynamic Semantics for Extended
ML
D. Sannella and F. da Silva
LFCS report ECS-LFCS-89-101
- Formal program development in Extended ML for the working
programmer
D. Sannella
LFCS report ECS-LFCS-89-102
- Timing Concurrent Processes
C. Tofts
LFCS report ECS-LFCS-89-103
- A Temporal Calculus of Communicating Systems
Faron Moller and Chris Tofts
LFCS report ECS-LFCS-89-104
Previous |
Index |
Next