An Axiomatization of the Rational Data Objects. - Jan A. Bergstra; Alexander Ollongren; Theo P. van der Weide (FCT, 1977)

Decision Problems Concerning Parallel Programming. - Jan A. Bergstra (MFCS, 1978)

What is an Abstract Datatype? - Jan A. Bergstra (Inf. Process. Lett., 1978)

Degrees of Sensible Lambda Theories. - Henk Barendregt; Jan A. Bergstra; Jan Willem Klop; Henri Volken (J. Symb. Log., 1978)

Degrees of partial functions. - Jan A. Bergstra (Notre Dame J. Formal Log., 1978)

Implicit definability of algebraic structures by means of program properties. - Jan A. Bergstra; Jerzy Tiuryn (FCT, 1979)

Effective Transformations on Probabilistic Data. - Jan A. Bergstra (Math. Log. Q., 1979)

On the adequacy of finite equational methods for data type specification. - Jan A. Bergstra; John V. Tucker (ACM SIGPLAN Notices, 1979)

Recursive Assertions are not enough - or are they? - Krzysztof R. Apt; Jan A. Bergstra; Lambert G. L. T. Meertens (Theor. Comput. Sci., 1979)

Church-Rosser Strategies in the Lambda Calculus. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1979)

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. - Jan A. Bergstra; John V. Tucker (ICALP, 1980)

Discourse between processes. - Jan A. Bergstra (Notre Dame J. Formal Log., 1980)

Invertible Terms in the Lambda Calculus. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1980)

A Characterization of Program Equivalence in Terms of Hoare's Logic. - Jan A. Bergstra; J. Terlouw (GI Jahrestagung, 1981)

Algebraically Specified Programming Systems and Hoare's Logic. - Jan A. Bergstra; John V. Tucker (ICALP, 1981)

Hoare's Logic is Incomplete When It Does Not Have To Be. - Jan A. Bergstra; Anna Chmielinska; Jerzy Tiuryn (Logic of Programs, 1981)

The Refinement of Specifications and the Stabiliy of Hoare's Logic. - Jan A. Bergstra; John V. Tucker (Logic of Programs, 1981)

On the Power of Algebraic Specifications. - Jan A. Bergstra; Manfred Broy; John V. Tucker; Martin Wirsing (MFCS, 1981)

On the quantifier-free fragment of 'Logic of effective definitions'. - Jan A. Bergstra; John-Jules Ch. Meyer (Fundam. Informaticae, 1981)

Logic of effective definitions. - Jan A. Bergstra; Jerzy Tiuryn (Fundam. Informaticae, 1981)

Algorithmic degrees of algebraic structures. - Jan A. Bergstra; Jerzy Tiuryn (Fundam. Informaticae, 1981)

Regular extensions of iterative algebras and metric interpretations. - Jan A. Bergstra; Jerzy Tiuryn (Fundam. Informaticae, 1981)

I/O-computable data structures. - Jan A. Bergstra; John-Jules Ch. Meyer (ACM SIGPLAN Notices, 1981)

Specification of Parameterized Data Types. - Jan A. Bergstra (ADT, 1982)

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. - Jan A. Bergstra; Jan Willem Klop (ICALP, 1982)

Formal Proof Systems for Program Equivalence. - Jan A. Bergstra; Jan Willem Klop (Formal Description of Programming Concepts, 1982)

A formalized proof system for total correctness of while programs. - Jan A. Bergstra; Jan Willem Klop (Symposium on Programming, 1982)

Strong Normalization and Perpetual Reductions in the Lambda Calculus. - Jan A. Bergstra; Jan Willem Klop (J. Inf. Process. Cybern., 1982)

A Simple Transfer Lemma for Algebraic Specifications. - Jan A. Bergstra; John-Jules Ch. Meyer (Inf. Process. Lett., 1982)

Two Theorems About the Completeness of Hoare's Logic. - Jan A. Bergstra; John V. Tucker (Inf. Process. Lett., 1982)

Expressiveness and the Completeness of Hoare's Logic. - Jan A. Bergstra; John V. Tucker (J. Comput. Syst. Sci., 1982)

On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic. - Jan A. Bergstra; John-Jules Ch. Meyer (Theor. Comput. Sci., 1982)

Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1982)

Floyds Principle, Correctness Theories and Program Equivalence. - Jan A. Bergstra; Jerzy Tiuryn; John V. Tucker (Theor. Comput. Sci., 1982)

Another Incompleteness Result for Hoare's Logic - Jan A. Bergstra; Anna Chmielinska; Jerzy Tiuryn (Inf. Control., 1982)

The Completeness of the Algebraic Specification Methods for Computable Data Types - Jan A. Bergstra; John V. Tucker (Inf. Control., 1982)

Algebraic Tools for System Construction. - Jan A. Bergstra; Jan Willem Klop; John V. Tucker (Logic of Programs, 1983)

PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness. - Jan A. Bergstra; Jerzy Tiuryn (Logic of Programs, 1983)

Standard Model Semantics for DSL A Data Type Specification Language. - Jan A. Bergstra; J. Terlouw (Acta Informatica, 1983)

Initial Algebra Specifications for Parametrized Data Types. - Jan A. Bergstra; Jan Willem Klop (J. Inf. Process. Cybern., 1983)

A proof rule for restoring logic circuits. - Jan A. Bergstra; Jan Willem Klop (Integr., 1983)

Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. - Jan A. Bergstra; John V. Tucker (SIAM J. Comput., 1983)

Hoare's Logic and Peano's Arithmetic. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1983)

Process Algebra with Asynchronous Communication Mechanisms. - Jan A. Bergstra; Jan Willem Klop; John V. Tucker (Seminar on Concurrency, 1984)

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. - Jan A. Bergstra; Jan Willem Klop (ICALP, 1984)

The Axiomatic Semantics of Programs Based on Hoare's Logic. - Jan A. Bergstra; John V. Tucker (Acta Informatica, 1984)

On Specifying Sets of Integers. - Jan A. Bergstra; John-Jules Ch. Meyer (J. Inf. Process. Cybern., 1984)

Process Algebra for Synchronous Communication - Jan A. Bergstra; Jan Willem Klop (Inf. Control., 1984)

Linear Time and Branching Time Semantics for Recursion with Merge. - J. W. de Bakker; Jan A. Bergstra; Jan Willem Klop; John-Jules Ch. Meyer (Theor. Comput. Sci., 1984)

Proving Program Inclusion Using Hoare's Logic. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1984)

Hoare's Logic for Programming Languages with two Data Types. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1984)

Verification of an alternating bit protocol by means of process algebra. - Jan A. Bergstra; Jan Willem Klop (Mathematical Methods of Specification and Synthesis of Software Systems, 1985)

Top-Down Design and the Algebra of Communicating Processes. - Jan A. Bergstra; John V. Tucker (Sci. Comput. Program., 1985)

Algebra of Communicating Processes with Abstraction. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1985)

Conditional Rewrite Rules: Confluence and Termination. - Jan A. Bergstra; Jan Willem Klop (J. Comput. Syst. Sci., 1986)

ACTtau: A Universal Axiom System for Process Specification. - Jan A. Bergstra; Jan Willem Klop (Algebraic Methods, 1987)

Conditional axioms and α/β-calculus in process algebra. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (Formal Description of Programming Concepts, 1987)

Failures without chaos: a new process semantics for fair abstraction. - Jan A. Bergstra; Jan Willem Klop; Ernst-Rüdiger Olderog (Formal Description of Programming Concepts, 1987)

Term Rewriting Systems with Priorities. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (RTA, 1987)

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (Comput. J., 1987)

On the Consistency of Koomen's Fair Abstraction Rule. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1987)

Algebraic Specifications of Computable and Semicomputable Data Types. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 1987)

ACP with Signals. - Jan A. Bergstra (ALP, 1988)

Process theory based on bisimulation semantics. - Jan A. Bergstra; Jan Willem Klop (REX Workshop, 1988)

Readies and Failures in the Algebra of Communicating Processes. - Jan A. Bergstra; Jan Willem Klop; Ernst-Rüdiger Olderog (SIAM J. Comput., 1988)

Global Renaming Operators in Concrete Process Algebra - Jos C. M. Baeten; Jan A. Bergstra (Inf. Comput., 1988)

A Process Specification Formalism Based on Static COLD. - Jos C. M. Baeten; Jan A. Bergstra; Sjouke Mauw; Gert J. Veltink (Algebraic Methods, 1989)

Design of a Specification Language by Abstract Syntax Engineering. - Jos C. M. Baeten; Jan A. Bergstra (Algebraic Methods, 1989)

Term-Rewriting Systems with Rule Priorities. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop; W. P. Weijland (Theor. Comput. Sci., 1989)

Process Algebra with a Zero Object. - Jos C. M. Baeten; Jan A. Bergstra (CONCUR, 1990)

Module Algebra - Jan A. Bergstra; Jan Heering; Paul Klint (J. ACM, 1990)

The State Operator in Real Time Process Algebra. - Jos C. M. Baeten; Jan A. Bergstra (REX Workshop, 1991)

Real Time Process Algebra. - Jos C. M. Baeten; Jan A. Bergstra (Formal Aspects Comput., 1991)

Uniform Algebraic Specifications of Finite Sets with Equality. - Jan A. Bergstra; Sjouke Mauw; Freek Wiedijk (Int. J. Found. Comput. Sci., 1991)

Recursive Process Definitions with the State Operator. - Jos C. M. Baeten; Jan A. Bergstra (Theor. Comput. Sci., 1991)

Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). - Jos C. M. Baeten; Jan A. Bergstra; Scott A. Smolka (CONCUR, 1992)

Asynchronous Communication in Real Space Process Algebra. - Jos C. M. Baeten; Jan A. Bergstra (FTRTFT, 1992)

Non Interleaving Process Algebra. - Jos C. M. Baeten; Jan A. Bergstra (CONCUR, 1993)

Process Algebra with Combinators. - Jan A. Bergstra; Inge Bethke; Alban Ponse (CSL, 1993)

Translations Between Flowchart Schemes and Process Graphs. - Jan A. Bergstra; Gheorghe Stefanescu (FCT, 1993)

Process Algebra with Backtracking. - Jan A. Bergstra; Alban Ponse; Jos van Wamel (REX School/Symposium, 1993)

Real space process algebra. - Jos C. M. Baeten; Jan A. Bergstra (Formal Aspects Comput., 1993)

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (J. ACM, 1993)

Process Algebra with Partial Choice. - Jos C. M. Baeten; Jan A. Bergstra (CONCUR, 1994)

A Real Time Process Logic. - Jos C. M. Baeten; Jan A. Bergstra; Roland N. Bol (ICTL, 1994)

Process Algebra with Iteration and Nesting. - Jan A. Bergstra; Inge Bethke; Alban Ponse (Comput. J., 1994)

On Sequential Compoisiton, Action Prefixes and Process Prefixes. - Jos C. M. Baeten; Jan A. Bergstra (Formal Aspects Comput., 1994)

Bisimulation is Two-Way Simulation. - Jan A. Bergstra; Gheorghe Stefanescu (Inf. Process. Lett., 1994)

Logic of Transition Systems. - Johan van Benthem; Jan A. Bergstra (J. Log. Lang. Inf., 1994)

Which Data Types have omega-complete Initial Algebra Specifications? - Jan A. Bergstra; Jan Heering (Theor. Comput. Sci., 1994)

Discrete Time Process Algebra with Abstraction. - Jos C. M. Baeten; Jan A. Bergstra (FCT, 1995)

Processes with Multiple Entries and Exits. - Jan A. Bergstra; Gheorghe Stefanescu (FCT, 1995)

A Data Type Variety of Stack Algebras. - Jan A. Bergstra; John V. Tucker (Ann. Pure Appl. Log., 1995)

Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. - Jan A. Bergstra; John V. Tucker (J. ACM, 1995)

A propositional logic with 4 values: true, false, divergent and meaningless. - Jan A. Bergstra; Inge Bethke; Piet Rodenburg (J. Appl. Non Class. Logics, 1995)

Homomorphism Preserving Algebraic Specifications Require Hidden Sorts - Jan A. Bergstra; Jan Heering (Inf. Comput., 1995)

Axiomatizing Probabilistic Processes: ACP with Generative Probabilities - Jos C. M. Baeten; Jan A. Bergstra; Scott A. Smolka (Inf. Comput., 1995)

The Discrete Time TOOLBUS. - Jan A. Bergstra; Paul Klint (AMAST, 1996)

The TOOLBUS Coordination Architecture. - Jan A. Bergstra; Paul Klint (COORDINATION, 1996)

A Complete Transformational Toolkit for Compilers. - Jan A. Bergstra; T. B. Dinesh; John Field; Jan Heering (ESOP, 1996)

Six Issues Concerning Future Directions in Concurrency Research. - Jos C. M. Baeten; Jan A. Bergstra (ACM Comput. Surv., 1996)

Discrete Time Process Algebra. - Jos C. M. Baeten; Jan A. Bergstra (Formal Aspects Comput., 1996)

Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation. - Jan A. Bergstra; Gheorghe Stefanescu (Fundam. Informaticae, 1996)

Algebra of timed frames. - Jan A. Bergstra; Wan J. Fokkink; Cornelis A. Middelburg (Int. J. Comput. Math., 1996)

Bounded Stacks, Bags and Queues. - Jos C. M. Baeten; Jan A. Bergstra (CONCUR, 1997)

Models for Feature Descriptions and Interactions. - Jan A. Bergstra; Wiet Bouma (FIW, 1997)

Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time. - Jos C. M. Baeten; Jan A. Bergstra (Fundam. Informaticae, 1997)

Network algebra for asynchronous dataflow. - Jan A. Bergstra; Cornelis A. Middelburg; Gheorghe Stefanescu (Int. J. Comput. Math., 1997)

Grid Protocols Based on Synchronous Communication. - Jan A. Bergstra; Joris A. Hillebrand; Alban Ponse (Sci. Comput. Program., 1997)

Process Algebra with Propositional Signals. - Jos C. M. Baeten; Jan A. Bergstra (Theor. Comput. Sci., 1997)

Toward a Complete Transformational Toolkit for Compilers. - Jan A. Bergstra; T. B. Dinesh; John Field; Jan Heering (ACM Trans. Program. Lang. Syst., 1997)

Grid Protocol Specifications. - Jan A. Bergstra; Alban Ponse (Prospects for Hardware Foundations, 1998)

Deadlock Behaviour in Split and ST Bisimulation Semantics. - Jos C. M. Baeten; Jan A. Bergstra (EXPRESS, 1998)

Kleene's Three-Valued Logic and Process Algebra. - Jan A. Bergstra; Alban Ponse (Inf. Process. Lett., 1998)

Bochvar-McCarthy Logic and Process Algebra. - Jan A. Bergstra; Alban Ponse (Notre Dame J. Formal Log., 1998)

The Discrete Time TOOLBUS - A Software Coordination Architecture. - Jan A. Bergstra; Paul Klint (Sci. Comput. Program., 1998)

Discrete time process algebra with silent step. - Jos C. M. Baeten; Jan A. Bergstra; Michel A. Reniers (Proof, Language, and Interaction, 2000)

Program Algebra for Component Code. - Jan A. Bergstra; M. E. Loots (Formal Aspects Comput., 2000)

Process Algebra with Four-Valued Logic. - Jan A. Bergstra; Alban Ponse (J. Appl. Non Class. Logics, 2000)

Process Algebra with Recursive Operations. - Jan A. Bergstra; Wan J. Fokkink; Alban Ponse (Handbook of Process Algebra, 2001)

Discrete Time Process Algebra and the Semantics of SDL. - Jan A. Bergstra; Cornelis A. Middelburg; Yaroslav S. Usenko (Handbook of Process Algebra, 2001)

Process algebra and conditional composition. - Jan A. Bergstra; Alban Ponse (Inf. Process. Lett., 2001)

Register-machine based processes. - Jan A. Bergstra; Alban Ponse (J. ACM, 2001)

Non-regular iterators in process algebra. - Jan A. Bergstra; Alban Ponse (Theor. Comput. Sci., 2001)

Molecule-oriented programming in Java. - Jan A. Bergstra (Inf. Softw. Technol., 2002)

Molecular dynamics. - Jan A. Bergstra; Inge Bethke (J. Log. Algebraic Methods Program., 2002)

Program algebra for sequential code. - Jan A. Bergstra; M. E. Loots (J. Log. Algebraic Methods Program., 2002)

Combining programs and state machines. - Jan A. Bergstra; Alban Ponse (J. Log. Algebraic Methods Program., 2002)

Machine Function Based Control Code Algebras. - Jan A. Bergstra (FMCO, 2003)

Polarized Process Algebra and Program Equivalence. - Jan A. Bergstra; Inge Bethke (ICALP, 2003)

Operator programs and operator processes. - Jan A. Bergstra; Pum Walters (Inf. Softw. Technol., 2003)

Branching time and orthogonal bisimulation equivalence. - Jan A. Bergstra; Alban Ponse; Mark van der Zwaag (Theor. Comput. Sci., 2003)

Located Actions in Process Algebra with Timing. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2004)

Model Theory for Process Algebra. - Jan A. Bergstra; Cornelis A. Middelburg (Processes, Terms and Cycles, 2005)

Strong Splitting Bisimulation Equivalence. - Jan A. Bergstra; Cornelis A. Middelburg (CALCO, 2005)

A Bypass of Cohen's Impossibility Result. - Jan A. Bergstra; Alban Ponse (EGC, 2005)

Six Themes for Future Concurrency Research. - Jos C. M. Baeten; Jan A. Bergstra (APC 25, 2005)

On the Design Rationale of ACP Style Process Algebras. - Jan A. Bergstra (APC 25, 2005)

An upper bound for the equational specification of finite state services. - Jan A. Bergstra; Inge Bethke (Inf. Process. Lett., 2005)

Network algebra in Java. - Jan A. Bergstra; Inge Bethke (J. Log. Algebraic Methods Program., 2005)

Polarized process algebra with reactive composition. - Jan A. Bergstra; Inge Bethke (Theor. Comput. Sci., 2005)

Process algebra for hybrid systems. - Jan A. Bergstra; Cornelis A. Middelburg (Theor. Comput. Sci., 2005)

Elementary Algebraic Specifications of the Rational Complex Numbers. - Jan A. Bergstra; John V. Tucker (Essays Dedicated to Joseph A. Goguen, 2006)

Elementary Algebraic Specifications of the Rational Function Field. - Jan A. Bergstra (CiE, 2006)

Parallel Processes with Implicit Computational Capital. - Jan A. Bergstra; Cornelis A. Middelburg (LIX, 2006)

Thread Algebra with Multi-Level Strategies. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2006)

Splitting bisimulations and retrospective conditions. - Jan A. Bergstra; Cornelis A. Middelburg (Inf. Comput., 2006)

Continuity controlled hybrid automata. - Jan A. Bergstra; Cornelis A. Middelburg (J. Log. Algebraic Methods Program., 2006)

Decision problems for pushdown threads. - Jan A. Bergstra; Inge Bethke; Alban Ponse (Acta Informatica, 2007)

Synchronous cooperation for explicit multi-threading. - Jan A. Bergstra; Cornelis A. Middelburg (Acta Informatica, 2007)

A process algebra based framework for promise theory - Jan A. Bergstra; Inge Bethke; Mark Burgess (CoRR, 2007)

Projection semantics for rigid loops - Jan A. Bergstra; Alban Ponse (CoRR, 2007)

Interface groups and financial transfer architectures - Jan A. Bergstra; Alban Ponse (CoRR, 2007)

Instruction Sequences with Indirect Jumps. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2007)

Programming an Interpreter Using Molecular Dynamics. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2007)

Thread algebra for strategic interleaving. - Jan A. Bergstra; Cornelis A. Middelburg (Formal Aspects Comput., 2007)

Maurer Computers with Single-Thread Control. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2007)

The rational numbers as an abstract data type. - Jan A. Bergstra; John V. Tucker (J. ACM, 2007)

Execution architectures for program algebra. - Jan A. Bergstra; Alban Ponse (J. Appl. Log., 2007)

Preferential choice and coordination conditions. - Jan A. Bergstra; Cornelis A. Middelburg (J. Log. Algebraic Methods Program., 2007)

A Thread Algebra with Multi-Level Strategic Interleaving. - Jan A. Bergstra; Cornelis A. Middelburg (Theory Comput. Syst., 2007)

Letter from the editor. - Jan A. Bergstra (Sci. Comput. Program., 2007)

About "trivial" software patents: The IsNot case. - Jan A. Bergstra; Paul Klint (Sci. Comput. Program., 2007)

Fields, Meadows and Abstract Data Types. - Jan A. Bergstra; Yoram Hirshfeld; John V. Tucker (Pillars of Computer Science, 2008)

Differential Meadows. - Jan A. Bergstra; Alban Ponse (CoRR, 2008)

Towards a formalization of budgets - Jan A. Bergstra; Sanne Nolst Trenité; Mark van der Zwaag (CoRR, 2008)

Thread algebra for sequential poly-threading - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2008)

Tuplix Calculus Specifications of Financial Transfer Networks - Jan A. Bergstra; Sanne Nolst Trenité; Mark van der Zwaag (CoRR, 2008)

Proposition Algebra with Projective Limits - Jan A. Bergstra; Alban Ponse (CoRR, 2008)

Instruction sequences and non-uniform complexity theory - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2008)

Mechanistic Behavior of Single-Pass Instruction Sequences - Jan A. Bergstra; Mark van der Zwaag (CoRR, 2008)

An Instruction Sequence Semigroup with Repeaters - Jan A. Bergstra; Alban Ponse (CoRR, 2008)

A static theory of promises - Jan A. Bergstra; Mark Burgess (CoRR, 2008)

Instruction sequences for the production of processes - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2008)

Tuplix Calculus. - Jan A. Bergstra; Alban Ponse; Mark van der Zwaag (Sci. Ann. Comput. Sci., 2008)

Distributed strategic interleaving with load balancing. - Jan A. Bergstra; Cornelis A. Middelburg (Future Gener. Comput. Syst., 2008)

Simulating Turing machines on Maurer machines. - Jan A. Bergstra; Cornelis A. Middelburg (J. Appl. Log., 2008)

Program algebra with a jump-shift instruction. - Jan A. Bergstra; Cornelis A. Middelburg (J. Appl. Log., 2008)

Maurer computers for pipelined instruction processing. - Jan A. Bergstra; Cornelis A. Middelburg (Math. Struct. Comput. Sci., 2008)

Division Safe Calculation in Totalised Fields. - Jan A. Bergstra; John V. Tucker (Theory Comput. Syst., 2008)

Transmission Protocols for Instruction Streams. - Jan A. Bergstra; Cornelis A. Middelburg (ICTAC, 2009)

Machine structure oriented control code logic. - Jan A. Bergstra; Cornelis A. Middelburg (Acta Informatica, 2009)

Partial Komori fields and imperative Komori fields. - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Timed tuplix calculus and the Wesseling and van den Berg equation - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Meadow Enriched ACP Process Algebras - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Square root meadows - Jan A. Bergstra; Inge Bethke (CoRR, 2009)

A protocol for instruction stream processing - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Instruction sequence notations with probabilistic instructions - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Arithmetical meadows - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

A progression ring for interfaces of instruction sequences, threads, and services - Jan A. Bergstra; Alban Ponse (CoRR, 2009)

Functional units for natural numbers - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Autosolvability of halting problem instances for instruction sequences - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2009)

Local and Global Trust Based on the Concept of Promises - Jan A. Bergstra; Mark Burgess (CoRR, 2009)

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. - Jan A. Bergstra; Alban Ponse (Sci. Ann. Comput. Sci., 2009)

Instruction Sequences with Dynamically Instantiated Instructions. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2009)

Meadows and the equational specification of division. - Jan A. Bergstra; Yoram Hirshfeld; John V. Tucker (Theor. Comput. Sci., 2009)

On the definition of a theoretical concept of an operating system - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2010)

Formaleuros, formalcoins and virtual monies - Jan A. Bergstra (CoRR, 2010)

Informal Control code logic - Jan A. Bergstra (CoRR, 2010)

Steering Fragments of Instruction Sequences - Jan A. Bergstra (CoRR, 2010)

Short-circuit logic - Jan A. Bergstra; Alban Ponse (CoRR, 2010)

On Hoare-McCarthy algebras - Jan A. Bergstra; Alban Ponse (CoRR, 2010)

Business Mereology: Imaginative Definitions of Insourcing and Outsourcing Transformations - Jan A. Bergstra; S. F. M. van Vlijmen (CoRR, 2010)

An Interface Group for Process Components. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2010)

Data Linkage Dynamics with Shedding. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2010)

A thread calculus with molecular dynamics. - Jan A. Bergstra; Cornelis A. Middelburg (Inf. Comput., 2010)

On the operating unit size of load/store architectures. - Jan A. Bergstra; Cornelis A. Middelburg (Math. Struct. Comput. Sci., 2010)

Proposition Algebra and Short-Circuit Logic. - Jan A. Bergstra; Alban Ponse (FSEN, 2011)

Real Islamic Logic - Jan A. Bergstra (CoRR, 2011)

Introducing Sourcements - Jan A. Bergstra; Guus P. A. J. Delen; S. F. M. van Vlijmen (CoRR, 2011)

Outsourcing Competence - Jan A. Bergstra; Guus P. A. J. Delen; S. F. M. van Vlijmen (CoRR, 2011)

Putting Instruction Sequences into Effect - Jan A. Bergstra (CoRR, 2011)

Stratified Outsourcing Theory - Jan A. Bergstra; Guus P. A. J. Delen; S. F. M. van Vlijmen (CoRR, 2011)

Informatics Perspectives on Decision Taking - Jan A. Bergstra (CoRR, 2011)

Thread Extraction for Polyadic Instruction Sequences. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2011)

Thread algebra for poly-threading. - Jan A. Bergstra; Cornelis A. Middelburg (Formal Aspects Comput., 2011)

Inversive meadows and divisive meadows. - Jan A. Bergstra; Cornelis A. Middelburg (J. Appl. Log., 2011)

Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. - Jan A. Bergstra; Inge Bethke (Theory Comput. Syst., 2011)

Editorial. - Jan A. Bergstra (Sci. Comput. Program., 2011)

A calculus for four-valued sequential logic. - Jan A. Bergstra; Jaco van de Pol (Theor. Comput. Sci., 2011)

Proposition algebra. - Jan A. Bergstra; Alban Ponse (ACM Trans. Comput. Log., 2011)

Instruction sequence processing operators. - Jan A. Bergstra; Cornelis A. Middelburg (Acta Informatica, 2012)

About Instruction Sequence Testing - Jan A. Bergstra (CoRR, 2012)

Turing Impossibility Properties for Stack Machine Programming - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2012)

Four Conceptions of Instruction Sequence Faults - Jan A. Bergstra (CoRR, 2012)

Process algebra with conditionals in the presence of epsilon - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2012)

Decision Taking as a Service - Jan A. Bergstra (CoRR, 2012)

Decision Taking versus Action Determination - Jan A. Bergstra (CoRR, 2012)

Decision Taking for Selling Thread Startup - Jan A. Bergstra (CoRR, 2012)

Informaticology: combining Computer Science, Data Science, and Fiction Science - Jan A. Bergstra (CoRR, 2012)

Indirect Jumps Improve Instruction Sequence Performance. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2012)

On the Behaviours Produced by Instruction Sequences under Execution. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2012)

On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. - Jan A. Bergstra; Inge Bethke (Theory Comput. Syst., 2012)

On the Expressiveness of Single-Pass Instruction Sequences. - Jan A. Bergstra; Cornelis A. Middelburg (Theory Comput. Syst., 2012)

Instruction Sequences for Computer Science. - Jan A. Bergstra; Cornelis A. Middelburg (Atlantis Press, 2012)

Guest Editorial. - Jan A. Bergstra; Jens Blanck; Faron Moller; Stanley S. Wainer (Comput. J., 2013)

Cancellation Meadows: A Generic Basis Theorem and Some Applications. - Jan A. Bergstra; Inge Bethke; Alban Ponse (Comput. J., 2013)

Decision Taking versus Promise Issuing. - Jan A. Bergstra (CoRR, 2013)

Instruction sequence expressions for the secure hash algorithm SHA-256. - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2013)

Instruction sequence expressions for the Karatsuba multiplication algorithm. - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2013)

Long multiplication by instruction sequences with backward jump instructions. - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2013)

Network algebra for synchronous dataflow - Jan A. Bergstra; Cornelis A. Middelburg; Gheorghe Stefanescu (CoRR, 2013)

Bitcoin and Beyond: Exclusively Informational Monies - Jan A. Bergstra; Karl de Leeuw (CoRR, 2013)

Questions related to Bitcoin and other Informational Money - Jan A. Bergstra; Karl de Leeuw (CoRR, 2013)

Timed Tuplix Calculus and the Wesseling and van den Bergh Equation. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2013)

Obituary for Jaco de Bakker, 1939-2012. - Jan A. Bergstra; Jan Willem Klop; Jan Rutten (Bull. EATCS, 2013)

Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2013)

A Process Calculus with Finitary Comprehended Terms. - Jan A. Bergstra; Cornelis A. Middelburg (Theory Comput. Syst., 2013)

Personal Multi-threading. - Jan A. Bergstra (CoRR, 2014)

Promises, Impositions, and other Directionals. - Jan A. Bergstra; Mark Burgess (CoRR, 2014)

Note on paraconsistency and the logic of fractions. - Jan A. Bergstra; Inge Bethke (CoRR, 2014)

A Thread Algebra with Probabilistic Features. - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2014)

Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. - Jan A. Bergstra; Alban Ponse (CoRR, 2014)

Bitcoin: a Money-like Informational Commodity. - Jan A. Bergstra; Peter Weijland (CoRR, 2014)

Instruction Sequence Based Non-uniform Complexity Classes. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2014)

Editor's Note. - Jan A. Bergstra; John V. Tucker (J. Log. Algebraic Methods Program., 2014)

Division by Zero in Common Meadows. - Jan A. Bergstra; Alban Ponse (Software, Services, and Systems, 2015)

Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence. - Jan A. Bergstra; Alban Ponse (Correct System Design, 2015)

Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money. - Jan A. Bergstra (CoRR, 2015)

Evaluation trees for proposition algebra. - Jan A. Bergstra; Alban Ponse (CoRR, 2015)

A negative result on algebraic specifications of the meadow of rational numbers. - Jan A. Bergstra; Inge Bethke (CoRR, 2015)

Probabilistic Thread Algebra. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2015)

On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2015)

Note on paraconsistency and reasoning about fractions. - Jan A. Bergstra; Inge Bethke (J. Appl. Non Class. Logics, 2015)

Equations for formally real meadows. - Jan A. Bergstra; Inge Bethke; Alban Ponse (J. Appl. Log., 2015)

Division by zero in non-involutive meadows. - Jan A. Bergstra; Cornelis A. Middelburg (J. Appl. Log., 2015)

Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract). - Jan A. Bergstra; Alban Ponse (WADT, 2016)

Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. - Jan A. Bergstra; Alban Ponse (CoRR, 2016)

On Instruction Sets for Boolean Registers in Program Algebra. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2016)

A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2016)

Instruction Sequence Size Complexity of Parity. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2016)

Transformation of fractions into simple fractions in divisive meadows. - Jan A. Bergstra; Cornelis A. Middelburg (J. Appl. Log., 2016)

Universality of Univariate Mixed Fractions in Divisive Meadows. - Jan A. Bergstra; Inge Bethke; Dimitri Hendriks (CoRR, 2017)

Subvarieties of the Variety of Meadows. - Jan A. Bergstra; Inge Bethke (Sci. Ann. Comput. Sci., 2017)

Axioms for Behavioural Congruence of Single-Pass Instruction Sequences. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2017)

Contradiction-Tolerant Process Algebra with Propositional Signals. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2017)

Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. - Jan A. Bergstra; Alban Ponse; Daan J. C. Staudt (CoRR, 2018)

A Short Introduction to Program Algebra with Instructions for Boolean Registers. - Jan A. Bergstra; Cornelis A. Middelburg (Comput. Sci. J. Moldova, 2018)

Instruction Sequences Expressing Multiplication Algorithms. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2018)

Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers. - Jan A. Bergstra (Comput. Sci. J. Moldova, 2019)

Adams Conditioning and Likelihood Ratio Transfer Mediated Inference. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2019)

Program Algebra for Turing-Machine Programs. - Jan A. Bergstra; Cornelis A. Middelburg (Sci. Ann. Comput. Sci., 2019)

Process Algebra with Strategic Interleaving. - Jan A. Bergstra; Cornelis A. Middelburg (Theory Comput. Syst., 2019)

The Wheel of Rational Numbers as an Abstract Data Type. - Jan A. Bergstra; John V. Tucker (WADT, 2020)

Arithmetical datatypes with true fractions. - Jan A. Bergstra; Alban Ponse (Acta Informatica, 2020)

A Promise Theoretic Account of the Boeing 737 Max MCAS Algorithm Affair. - Jan A. Bergstra; Mark Burgess (CoRR, 2020)

Candidate Software Process Flaws for the Boeing 737 Max MCAS Algorithm and Risks for a Proposed Upgrade. - Jan A. Bergstra; Mark Burgess (CoRR, 2020)

Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2020)

Instruction Sequence Faults with Formal Change Justification. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2020)

Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2020)

On the complexity of the correctness problem for non-zeroness test instruction sequences. - Jan A. Bergstra; Cornelis A. Middelburg (Theor. Comput. Sci., 2020)

Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2021)

Using Hoare Logic in a Process Algebra Setting. - Jan A. Bergstra; Cornelis A. Middelburg (Fundam. Informaticae, 2021)

Non-commutative propositional logic with short-circuit evaluation. - Jan A. Bergstra; Alban Ponse; Daan J. C. Staudt (J. Appl. Non Class. Logics, 2021)

Datatype defining rewrite systems for naturals and integers. - Jan A. Bergstra; Alban Ponse (Log. Methods Comput. Sci., 2021)

Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory. - Jan A. Bergstra; John V. Tucker (A Journey from Process Algebra via Timed Automata to Model Learning, 2022)

A Survey of Testing for Instruction Sequence Theory. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2022)

Four Notions of Fault for Program Specifications. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2022)

Which Arithmetical Data Types Admit Fracterm Flattening? - Jan A. Bergstra; John V. Tucker (Sci. Ann. Comput. Sci., 2022)

Partial arithmetical data types of rational numbers and their equational specification. - Jan A. Bergstra; John V. Tucker (J. Log. Algebraic Methods Program., 2022)

Conditional logic as a short-circuit logic. - Jan A. Bergstra; Alban Ponse (CoRR, 2023)

A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows. - Jan A. Bergstra; John V. Tucker (CoRR, 2023)

Eager Equality for Rational Number Arithmetic. - Jan A. Bergstra; John V. Tucker (ACM Trans. Comput. Log., 2023)

On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness. - Jan A. Bergstra; John V. Tucker (Comput. J., 2023)

Naive Fracterm Calculus. - Jan A. Bergstra; John V. Tucker (J. Univers. Comput. Sci., 2023)

Finite Approximations of the Common Meadow of Rational Numbers. - Jan A. Bergstra; John V. Tucker (WADT, 2024)

Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. - Jan A. Bergstra; John V. Tucker (Comput. J., 2024)

Rings with common division, common meadows and their conditional equational theories. - Jan A. Bergstra; John V. Tucker (CoRR, 2024)

Space-time process algebra with asynchronous communication. - Jan A. Bergstra; Cornelis A. Middelburg (CoRR, 2024)

Synthetic Fracterm Calculus. - Jan A. Bergstra; John V. Tucker (J. Univers. Comput. Sci., 2024)

Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero. - Jan A. Bergstra; John V. Tucker (J. Log. Lang. Inf., 2024)

Precautionary Logic and Ignorance Interval Transfer Mediated Inference. - Jan A. Bergstra (Sci. Ann. Comput. Sci., 2025)

For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability. - Jan A. Bergstra; John V. Tucker (Theor. Comput. Sci., 2025)

A Complete Finite Axiomatisation of the Equational Theory of Common Meadows. - Jan A. Bergstra; John V. Tucker (ACM Trans. Comput. Log., 2025)

Expressing entropy and cross-entropy in expansions of common meadows. - Jan A. Bergstra; John V. Tucker (CoRR, 2025)

Fracterm Calculus for Partial Meadows. - Jan A. Bergstra; Alban Ponse (CoRR, 2025)