Electronic Notes in Theoretical Computer Science

Titel Veröffentlichungsdatum Sprache Zitate
Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)1999/01/01English
Towards Verified Lazy Implementation of Concurrent Value-Passing Languages (Abstract)1999/01/01English
Partial order reductions for failures refinement1999/01/01English
Preface2000/01/01English
A Domain-theoretic Semantics of Lax Generic Functions1999/01/01English
Petri nets with generalized algebra: a comparison1999/01/01English
Monadic Encapsulation of Effects: a Revised Approach1999/01/01English
Presentation2001/03/01English
Infinite Computations in Concurrent Constraint Programming1997/01/01English
Resolution in the Smyth powerdomain1997/01/01English
Uniform Completion versus Ideal Completion of Posets with Projections2001/03/01English
Multiple-Conclusion System as Communication Calculus2000/01/01English
Data Field Haskell2001/08/01English
Abstract Interpretation Based Verification of Logic Programs2001/03/01English
Preface2001/08/01English
Debugging Haskell by Observing Intermediate Data Structures2001/08/01English
Preface1998/01/01English
Böhm's Theorem for Berarducci Trees2000/01/01English
Defining Standard Prolog in Rewriting Logic2000/01/01English
Idealized CSP: Combining Procedures With Communicating Processes1997/01/01English
Multi Lingual Sequent Calculus and Coherent Spaces1997/01/01English
Automatically Proving Up–to Bisimulation1998/01/01English
Formal Specification, Verification and Simulation of Time-Dependent Systems: a Timed Process Algebra Approach1998/01/01English
The Use of Graph Grammar in a Software Engineering Education Tool1995/01/01English
Pruning Terms for Principal Type Assignment2000/01/01English
Tree Morphisms and Bisimulations1998/01/01English
Categorical Models for Fairness: Completion vs Delay2001/03/01English
Preface1998/01/01English
Structured Theories and Institutions1999/01/01English
Class-Based and Algebraic Models of Objects1998/01/01English