Laboratory For Foundations Of Computer Science Китобҳо
1-20 аз 20,000

Decidability and completeness in real-time processes.

Liang Chen

Silence is golden

Hans H"uttel

Mildly exponential approximation algorithm for the permanent

Mark Jerrum

Fixpoint and loop construction as colimits.

C. Barry Jay

Language for value-passing CCS.

Glenn Bruns

Distributed concurrent implementation of Standard ML.

David C. J. Matthews

Modelling British Rail's interlocking logic

M. J. Morley

Interleaving model for real-time systems.

Liang Chen

Long be ta e ta normal forms and confluence.

C. Barry Jay

Recent developments in systolic design

Christian Lengauer

Undecidable equivalences for Basic Process Algebra

J. F. Groote

Higher-order modules and the phrase distinction

Robert Harper

Abstract view of programming language.

Eugenio Moggi

Logical structure of sequential prolog.

James H. Andrews

Relative frequency in a synchronous calculus.

Chris Tofts

Systolic array for pyramidal algorithims

Christian Lengauer

Some fundamental algebraic tools for the semantics of computation part 3: Indesced Categories

R. M. Burstall

Self-independent Petri Nets, or, A dead-lock-free paradigm.

Sun Yong.

Equations, dependent equations and quasi-dependent equations on their unification.

Sun Yong

Proving correctness of constructor implementations.

Jordi Fanes-Casals

Concurrency workbench

Rance Cleaveland

Proving total correctness of concurrent programs without using auxiliary variables.

Pawel Paczkowski

Local model checking in the Modal Mu-Calculus

Colin Stirling

Petri nets as quantales.

Carolyn Brown

Introduction to Standard ML.

Robert Harper

Proving correctness of constructor implementations.

Jordi Farres-Casals

Timing concurrent processes.

Chris Tofts

Nonexistence of Finate Axiomatisation for CCS congruences.

Faron Moller

Proof-Theoretic Characterisations of Logic Programming.

James H. Andrews

Logical design of VLSI circuit with extension of uncertainty =

Sun Yong.

Structure and representation in LF

Robert Harper

Characteristic Formulae for CCS with Divergence.

Bernhard Steffen

Formal program development in extended ML for the working programmer.

Donald Sannella

Toward formal development of ML programs

Donald Sannella

Equational characterization of binding (Extended Abstract).

Sun Yong

Four lectures on standard ML.

Mads Tofte

Playing with Lego

Paul Taylor

Finite constants

Bernhard Steffen

Constructing type systems over an operational semantics.

Robert Harper

Equational formulation of LF.

Robert Harper

Unifying exceptions with constructors in standard ML

A. Appel

Natural deduction treatment of operational semantics

R. M. Burstall

CC and its meta theory.

Zhaohui Luo

Some fundamental algebraic tools for the semantics of computation.

Introduction to a calculus of communicating systems.

David Walker

On functors expressible in the polymorphic typed lambda calculus

J. C. Reynolds

Edinburgh university postgraduate examination questions in computation theory.

Survey of formal software development methods

Donald Sannella

Interactive proof editor

Brian Ritchie

Co-induction in relational semantics

Robin Milner

Gentzenizing Schroeder - Heister's natural extension of natural deduction.

Arnon Avron

Framework for defining logics

Robert Harper

Verification of programs that destructively manipulate data.

Ian A. Mason

Some Thoughts on algebraic specification

Donald Sannella

Verifying a CSMA/CD protocol with CCS.

Joachim Parrow

Simple consequence relations.

Arnon Avron

Semantics of Standard ML

Robert Harper

Submodule construction as equation solving in CCS.

Joachim Parrow

Bisimulation equivalence and divergence in C.C.S..

David Walker

Inductively defined functions in functional programming languages.

R. M. Burstall