View distribution

more  CSR-284-88
more 
A structural mapping for parallel digital logic simulation CSR-284-88
The complexity of computing the permanent CSR-14-77
Concurrent processes and their syntax CSR-2-77
Edinburgh LCF. CSR-11-77
Fast probabilistic algorithms for Hamiltonian circuits and matchings CSR-17-77
Flowgraphs and flow algebras CSR-5-77
Graph theoretic arguments in low-level complexity CSR-13-77
A metalanguage for interactive proof in LCF. CSR-16-77
Probabilistic nondeterminism CSR-7-77
A theory of type polymorphism in programming CSR-9-77
Algebras for communicating systems CSR-25-78
Augmented transition network grammars and semantic processing CSR-20-78
High level proof in LCF. CSR-35-78
Completeness classes in algebra CSR-40-79
Database systems CSR-43-79
LCF: a way of doing proofs with a machine CSR-41-79
LEGOS user reference manual CSR-49-79
Negation can be exponentially powerful CSR-39-79
Negative results on counting CSR-38-79
Petri nets, event structures and domains. Part 1. CSR-47-79
Probabilistic CPO's for nondeterminism CSR-37-79
EMAS performance measurement experiments using a remote terminal emulator
An experiment with "Edinburgh LCF.". CSR-50-80
A fast parallel algorithm for routing in permutation networks CSR-63-80
Hope: an experimental applicative language CSR-62-80
On observing nondeterminism and concurrency CSR-69-80
Reducibility by algebraic projections CSR-64-80
The semantics of clear, a specification language CSR-65-80
Theory of FP systems in Edinburgh LCF. CSR-61-80
Universality considerations in VLSI circuits CSR-54-80
Call-by-need = call-by-value + conditional CSR-78-81
The equivalence of two semantic definitions: a case study in LCF. CSR-76-81
GOTOs: a study in the algebraic specification of programming languages CSR-89-81
Hope: an experimental applicative language CSR-62-80
Inductive inference in reflexive domains CSR-86-81
An LCF-system for automatic creation of theories for 1-constructable data types CSR-87-81
The new Edinburgh persistent algorithmic language CSR-90-81
A new semantics for Clear CSR-79-81
Nondeterministic partial logic: isotonic and guarded truth-functions CSR-83-81
On the Blum Sakoda 7 pebble searching algorithm CSR-96-81
On the non-sequential behaviour of systems possessing a generalised free choice property CSR-92-81
PS-algol: an Algol with a persistent heap CSR-94-81
S-ALGOL: reference manual CSR-80-81
Size bounds for superconcentrators CSR-95-81
Algebras, theories and freeness: an introduction for computer scientists CSR-101-82
Algorithms for a persistent heap CSR-109-82
Axiomatising finite delay operators CSR-124-82
Calculi for synchrony and asynchrony CSR-104-82
The category theoretic solution of recursive domain equations CSR-102-82
CIRCAL: a calculus for circuit description CSR-122-82
CMS - a chunk management system CSR-110-82
A complete inference system for a class of regular behaviours CSR-111-82
A complexity theory based on boolean algebra CSR-97-82
Concurrency, correctness, proof and undecidability in SDL like systems CSR-119-82
Countable nondeterminism and random assignment CSR-98-82
Families of fixed degree graphs for processor interconnection CSR-121-82
A finite delay operator in synchronous CCS. CSR-116-82
Future branching time logics and fairness CSR-105-82
Intensional analysis of functions and types CSR-118-82
Non sequential behaviour: 1. CSR-120-82
An operational semantics for CSP. CSR-114-82
An operational semantics of tasking and exception handling in ADA. CSR-99-82
Synchronous and asynchronous experiments of processes CSR-125-82
Syntactic type checking using Scott retraction maps CSR-112-82
Two dimensional syntax for functional languages CSR-115-82
Algebraic laws for nondeterminism and concurrency CSR-133-83
A CCS specification of the OSI network service CSR-136-83
Complete modal theories for verifying communicating agents behaviour in recursive equations programs CSR-128-83
The complexity of finding minimum length generator sequences CSR-139-83
The correctness of a simple Silicon computer CSR-127-83
Counting paths: nondeterminism as linear algebra CSR-134-83
Detecting global variables in denotational specifications CSR-143-83
A fair calculus of communicating systems CSR-137-83
A formal basis for the analysis of circuit timing CSR-138-83
Free constructions in algebraic institutions CSR-149-83
A kernel language for algebraic specification and implementation CSR-131-83
A language of specified programs CSR-148-83
An LCF proof of soundness of Hoare's logic - a paper without a happy ending CSR-146-83
A LISP based Circal environment CSR-152-83
A model for nondeterministic machines CSR-135-83
Modelling finite delay operators CSR-153-83
Natural deduction theorem proving in set theory CSR-142-83
A note on tactics in LCF. CSR-140-83
Power domains and predicate transformers: a topological view CSR-126-83
The power of the future perfect in program logics CSR-156-83
A programming notation for tactical reasoning CSR-141-83
A proof theoretic characterization of observational equivalence CSR-132-83
A proposal for standard ML. CSR-157-83
Specification and proof of a regular language recogniser in synchronous CCS. CSR-130-83
Structured theories in LCF. CSR-129-83
Testing equivalences for processes CSR-123-82
A theory of program modules, their specification and implementation (extended abstract) CSR-155-83
Two complete axiom systems for a theory of communicating sequential processes CSR-154-83
Abstract algebraic institutions which strongly admit initial semantics CSR-165-84
An algebraic theory of fair asynchronous communication processes CSR-171-84
A case study of the F.I.R.S.T. silicon compiler CSR-159-84
Completeness of proof systems for equational specifications CSR-160-84
ECCE: Edinburgh Compatible Context Editor. Video version CSR-175-84
The Edwin user's guide CSR-74-80
I.F.: an Idiomatic Floorplanner CSR-170-84
View distribution

more  CSR-284-88
more 
The Interactive Proof Editor: an experiment in interactive theorem [proving].
A modelling system for Posie CSR-284-88
Models of self-descriptive set theories
A natural deduction treatment of operational semantics
On functors expressible in the polymorphic typed lambda calculus
Operational and algebraic semantics of concurrent processes
The Posie processor board design CSR-284-88
Process migration in parallel computations CSR-284-88
${\rm{CC}}[superscript]\infty_\subset$ and its meta theory
A short end of year report on the Posie project CSR-284-88
Some fundamental algebraic tools for the semantics of computation
A survey of formal software development methods
Temporal ordering for concurrency
The travelling salesman problem on MEIKO parallel computer CSR-284-88
A typed lambda calculus with categorical type constructors
Unifying exceptions with constructors in standard ML.
Using constructions as a metalanguage
Virtual channels on the Meiko Computing Surface CSR-284-88
XHDL: a development of CIRCAL, its graphical representation and simulation CSR-263-88
Automated analysis of mutual exclusion algorithms using CCS.
Awareness Initiative in Object Oriented Computing: report of the second workshop, held in the James Clerk Maxwell Building, King's Buildings, Edinburgh, on the 14th of September, 1989 CSR-319-89
A calculus of mobile processes, part I.
A calculus of mobile processes, part II.
Characteristic formulae for CCS with divergence
Compositional characterization of observable program properties
The Concurrency Workbench: a semantics based tool for the verification of concurrent systems
DIALOG: a theorem-proving environment designed to unify functional and logic programming
Equational characterization of binding
Equations, dependent equations and quasi-dependent equations - on their unification
Finite constants: characterizations of a new decidable set of constants
Formal program development in Extended ML for the working programmer
Four lectures on Standard ML.
Local model checking in the modal mu-calculus
Logical design of VLSI circuit with extension of uncertainty (or monotonic functional completeness of Kleene ternary logic)
The nonexistence of finite axiomatisations of CCS congruences
On natural deduction style semantics, environments and stores
Optimal data flow analysis via observational equivalence
Petri nets as quantales
Playing with LEGO: some examples of developing mathematics in the Calculus of Constructions
Proof-theoretic characterisations of logic programming
Proving correctness of constructor implementations
Proving total correctness of concurrent programs without using auxiliary variables
Proving total correctness of concurrent programs without using auxiliary variables
Relating Petri nets to formulae of linear logic
Self-independent Petri nets (or a dead-lock-free paradigm)
Some fundamental algebraic tools for the semantics of computation. Part 3: Indexed categories
Structure and representation in LF.
The structure of free closed categories
Syntax, typechecking and dynamic semantics for Extended ML.
A temporal calculus of communicating systems
Timing concurrent processes
Toward formal development of ML programs: foundations and methodology
Turing degrees and the word and conjugacy problems for finitely presented groups CSR-287-89
Virtual objects: hiding the distribution in distributed systems CSR-293-89
When is a graphical sequence stable? CSR-309-89
Automating Polya theory: the computational complexity of the cycle index polynomial CSR-8-90
Efficient algorithms for listing unlabeled graphs CSR-7-90
The elusiveness of large cliques in a random graph CSR-9-90
On context stream tuples and higher-order context flow graphs CSR-4-90
On context streams and the boundedness of context flow graphs CSR-2-90
Polynomial-time approximation algorithms for the Ising model CSR-1-90
The qsum plot CSR-3-90
A CCS-based investigation of deadlock in a multi-process electronic mail system CSR-17-91
A comparison of hardware description languages CSR-13-91
Configurable array logic circuits for computing network error detection codes CSR-16-91
Graph reduction and pipelined parallel algorithms CSR-18-91
The role of logic synthesis in high-level synthesis CSR-15-91
Simple translation-invariant concepts are hard to learn CSR-12-91
Design of a bit-sliced network for a shared-memory multiprocessor system CSR-19-92
Final report on the DTI-funded awareness initiative in object oriented computing CSR-21-92
Pointers and multi-dimensional arrays CSR-22-92
A survey of PRAM simulation techniques CSR-23-92
A tool to enhance model exploitation CSR-20-92
List homomorphic parallel algorithms for bracket matching CSR-29-93
Models of parallelism CSR-28-93
Parallel programming, list homomorphisms and the maximum segment sum problem CSR-25-93
PEPA: Performance Enhanced Process Algebra CSR-24-93
The performance of Barnes-Hut N-body simulation in the abstract CSR-27-93
Proceedings of workshop on process algebra and performance modelling, University of Edinburgh, May 21, 1993 CSR-26-93
The performance of SCI memory hierarchies CSR-30-94
On the design and performance of pipelined architectures CSR-247-87
View distribution

more  CSR-284-88
more 
Inferring surface shape by specular stereo CSR-179-84
A metric characterization of fair computations in CCS. CSR-169-84
On observational equivalence and algebraic specification CSR-172-84
On proving limiting completeness CSR-177-84
Partitioning programmable logic arrays CSR-166-84
Proving systolic systems correct CSR-162-84
Quasi-varieties in abstract algebraic institutions CSR-173-84
Recursively defined domains and their induction principles CSR-176-84
Scale: a language for VLSI design CSR-158-84
Simulation and verification: related techniques for hardware analysis CSR-174-84
Specification and proof of a simple fault tolerant system in CCS. CSR-178-84
The standard ML core language CSR-168-84
A sticks front end for scale CSR-163-84
A syntax directed approach for implementing the rendezvous mechanism in Ada. CSR-161-84
Towards verifiably correct VLSI design CSR-164-84
Behavioral correctness of data representations CSR-185-85
Complementary partial orders and rectangle packing CSR-190-85
A compositional reformulation of Owicki-Gries's partial correctness for a parallel while language CSR-189-85
The Edinburgh node of the Proteus distributed database system CSR-191-85
IE reference manual CSR-194-85
An investigation into stretchable cells for scale CSR-181-85
LAYOUT formatting language reference manual CSR-196-85
Modal logics for communicating systems CSR-193-85
Random generation of combinatorial structures from a uniform distribution CSR-187-85
Raquel user manual CSR-188-85
Specifications in an arbitrary institution CSR-184-85
The unification of terms: a category-theoretic algorithm CSR-192-85
Using weak continuity constraints - what they are, and how they do it. CSR-186-85
Weak and strong fairness in CCS. CSR-167-85
A complete axiomatisation for observational congruence of finite-state behaviours
A complete protocol verification using relativized bisimulation
Computing with categories
Constructive validity is nonarithmetic CSR-203-86
Extended ML: an institution-independent framework for formal program development
Formal specification of ML programs
Functor-category semantics of programming languages and logics
Graphical display of a concurrent device simulation using CIRCAL CSR-204-86
Hardware description languages: some recent developments CSR-198-86
Introduction to Standard ML.
Is computing an experimental science?
Markov's principle, isols, and Dedekind finite sets CSR-202-86
Modules and persistence in standard ML.
OC: a portable occam compiler first pass CSR-201-86
On the geometric information obtainable from simultaneous observation of stereo contour and shading CSR-205-86
Parallel parsing on an array of processors CSR-200-86
Quantification in Algol-like languages
Research in interactive theorem proving at Edinburgh University
The role of behaviour in VLSI design languages CSR-199-86
Semantic analysis of specification logic
A silicon pre-compiler CSR-207-86
SILVER -- the language and its implementation CSR-206-86
Standard ML.
Standard ML.
A study in the foundations of programming methodology: specifications, institutions, charters and prachments
Toward formal development of programs from algebraic specifications: implementations revisited
Verifying a CSMA/CD-protocol with CCS.
Weak continuity constraints in computer vision CSR-197-86
Approximate counting, uniform generation and rapidly mixing Markov chains CSR-241-87
Behavioral abstraction and circuit verification using Circal CSR-251-87
Bisimulation equivalence and divergence in CCS.
Changes in the standard ML core language
Comparing linear and branching time temporal logics
Configurable logic: an approach to the rapid implementation of ASIC's. CSR-234-87
A data structure for systems of orthogonal, non-overlapping rectangles CSR-239-87
An environment for formal systems
The evolution of the Fred machine CSR-246-87
Fifth Workshop on Specification of Abstract Data Types, 1-4 September 1987. Abstracts
A framework for defining logics
Gentzenizing Schroeder-Heister's natural extension of natural deduction
Hoare's logic in the LF.
Inductively defined functions in functional programming languages
Introduction to a calculus of communicating systems
Relative completeness in algebraic specifications
The semantics and proof theory of linear logic
The semantics of Standard ML.
Simple consequence relations
Some thoughts on algebraic specification
Submodule construction as equation solving in CCS.
Synchronization flow algebra
A type discipline for program modules
Using typed lambda calculus to implement formal systems on a machine
Variations on a thesis: intuitionism and computability CSR-245-87
Verification of programs that destructively manipulate data
Analysing mutual exclusion algorithms using CCS.
Approximating the permanent CSR-275-88
An attempt at translating VHDL into CIRCAL CSR-267-88
Chromatic idioms for automated VLSI floorplanning CSR-255-88
Co-induction in relational semantics
Computational lambda-calculus and monads
Constructing type systems over an operational semantics
A diagramming paradigm for hierarchical process oriented discrete event simulation CSR-254-88
Edinburgh University postgraduate examination questions in computation theory, 1978-1988
An equational formulation of LF.
The essence of ML.
An experimenter tool for an integrated modelling support environment - its role and design CSR-277-88
Fast uniform generation of regular graphs CSR-281-88
Foundations and proof theory of 3-valued logics
A higher-order calculus and theory abstraction
How to breed hybrid compiler/interpreters
Improved methods for performance engineering. SIMMER II, Edinburgh report CSR-253-88