Jan A. Bergstra

371 papers A* 6A 1B 16C 4Journal 293Unranked 45
YearRankTypeTitle / Venue / Authors
2026 — conf
Fracterm Calculus for Partial Meadows.
Juggling Formal Methods and Security
Jan A. Bergstra, Alban Ponse
2025 J jnl
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows.
ACM Trans. Comput. Log.
Jan A. Bergstra, John V. Tucker
2025 J jnl
Conditional Logic as a Short-Circuit Logic.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Alban Ponse
2025 J jnl
Expressing entropy and cross-entropy in expansions of common meadows.
CoRR
Jan A. Bergstra, John V. Tucker
2025 J jnl
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2025 J jnl
Fracterm Calculus for Partial Meadows.
CoRR
Jan A. Bergstra, Alban Ponse
2025 J jnl
Logical models of mathematical texts II: Legality conventions for division by zero in inconsistent contexts.
J. Log. Lang. Inf.
Jan A. Bergstra, John V. Tucker
2025 J jnl
Precautionary Logic and Ignorance Interval Transfer Mediated Inference.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2024 J jnl
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows.
Comput. J.
Jan A. Bergstra, John V. Tucker
2024 — conf
Finite Approximations of the Common Meadow of Rational Numbers.
WADT
Jan A. Bergstra, John V. Tucker
2024 J jnl
Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero.
J. Log. Lang. Inf.
Jan A. Bergstra, John V. Tucker
2024 J jnl
On Defining Expressions for Entropy and Cross-Entropy: The Entropic Transreals and Their Fracterm Calculus.
Entropy
Jan A. Bergstra, John V. Tucker
2024 J jnl
Rings with common division, common meadows and their conditional equational theories.
CoRR
Jan A. Bergstra, John V. Tucker
2024 J jnl
Space-time process algebra with asynchronous communication.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2024 J jnl
Synthetic Fracterm Calculus.
J. Univers. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2023 J jnl
A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows.
CoRR
Jan A. Bergstra, John V. Tucker
2023 J jnl
Conditional logic as a short-circuit logic.
CoRR
Jan A. Bergstra, Alban Ponse
2023 J jnl
Eager Equality for Rational Number Arithmetic.
ACM Trans. Comput. Log.
Jan A. Bergstra, John V. Tucker
2023 J jnl
Naive Fracterm Calculus.
J. Univers. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2023 J jnl
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness.
Comput. J.
Jan A. Bergstra, John V. Tucker
2022 J jnl
A Survey of Testing for Instruction Sequence Theory.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2022 J jnl
Four Notions of Fault for Program Specifications.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2022 J jnl
Partial arithmetical data types of rational numbers and their equational specification.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, John V. Tucker
2022 — conf
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory.
A Journey from Process Algebra via Timed Automata to Model Learning
Jan A. Bergstra, John V. Tucker
2022 J jnl
Which Arithmetical Data Types Admit Fracterm Flattening?
Sci. Ann. Comput. Sci.
Jan A. Bergstra, John V. Tucker
2021 J jnl
Datatype defining rewrite systems for naturals and integers.
Log. Methods Comput. Sci.
Jan A. Bergstra, Alban Ponse
2021 J jnl
Non-commutative propositional logic with short-circuit evaluation.
J. Appl. Non Class. Logics
Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt
2021 J jnl
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2021 J jnl
Using Hoare Logic in a Process Algebra Setting.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2020 J jnl
A Promise Theoretic Account of the Boeing 737 Max MCAS Algorithm Affair.
CoRR
Jan A. Bergstra, Mark Burgess
2020 J jnl
Arithmetical datatypes with true fractions.
Acta Informatica
Jan A. Bergstra, Alban Ponse
2020 J jnl
Candidate Software Process Flaws for the Boeing 737 Max MCAS Algorithm and Risks for a Proposed Upgrade.
CoRR
Jan A. Bergstra, Mark Burgess
2020 J jnl
Instruction Sequence Faults with Formal Change Justification.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2020 J jnl
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2020 J jnl
On the complexity of the correctness problem for non-zeroness test instruction sequences.
Theor. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2020 J jnl
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2020 — conf
The Wheel of Rational Numbers as an Abstract Data Type.
WADT
Jan A. Bergstra, John V. Tucker
2019 J jnl
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference.
Sci. Ann. Comput. Sci.
Jan A. Bergstra
2019 J jnl
Process Algebra with Strategic Interleaving.
Theory Comput. Syst.
Jan A. Bergstra, Cornelis A. Middelburg
2019 J jnl
Program Algebra for Turing-Machine Programs.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2019 J jnl
Program algebra for Turing-machine programs.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2019 J jnl
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers.
CoRR
Jan A. Bergstra
2019 J jnl
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers.
Comput. Sci. J. Moldova
Jan A. Bergstra
2019 J jnl
Using Hoare logic in a process algebra setting.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2018 J jnl
A Short Introduction to Program Algebra with Instructions for Boolean Registers.
Comput. Sci. J. Moldova
Jan A. Bergstra, Cornelis A. Middelburg
2018 J jnl
A short introduction to program algebra with instructions for Boolean registers.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2018 J jnl
Instruction Sequences Expressing Multiplication Algorithms.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2018 J jnl
On the complexity of the correctness problem for non-zeroness test instruction sequences.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2018 J jnl
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant.
CoRR
Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt
2017 J jnl
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2017 J jnl
Axioms for behavioural congruence of single-pass instruction sequences.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2017 J jnl
Contradiction-Tolerant Process Algebra with Propositional Signals.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2017 J jnl
Process algebra with strategic interleaving.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2017 J jnl
Subvarieties of the Variety of Meadows.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Inge Bethke
2017 J jnl
Universality of Univariate Mixed Fractions in Divisive Meadows.
CoRR
Jan A. Bergstra, Inge Bethke, Dimitri Hendriks
2016 J jnl
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2016 J jnl
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference.
CoRR
Jan A. Bergstra
2016 J jnl
Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view.
CoRR
Jan A. Bergstra, Alban Ponse
2016 J jnl
Instruction Sequence Size Complexity of Parity.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2016 J jnl
On Instruction Sets for Boolean Registers in Program Algebra.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2016 — conf
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract).
WADT
Jan A. Bergstra, Alban Ponse
2016 J jnl
Transformation of fractions into simple fractions in divisive meadows.
J. Appl. Log.
Jan A. Bergstra, Cornelis A. Middelburg
2015 J jnl
A negative result on algebraic specifications of the meadow of rational numbers.
CoRR
Jan A. Bergstra, Inge Bethke
2015 J jnl
Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money.
CoRR
Jan A. Bergstra
2015 J jnl
Contradiction-tolerant process algebra with propositional signals.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2015 — conf
Division by Zero in Common Meadows.
Software, Services, and Systems
Jan A. Bergstra, Alban Ponse
2015 J jnl
Division by zero in non-involutive meadows.
J. Appl. Log.
Jan A. Bergstra, Cornelis A. Middelburg
2015 J jnl
Equations for formally real meadows.
J. Appl. Log.
Jan A. Bergstra, Inge Bethke, Alban Ponse
2015 — conf
Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence.
Correct System Design
Jan A. Bergstra, Alban Ponse
2015 J jnl
Evaluation trees for proposition algebra.
CoRR
Jan A. Bergstra, Alban Ponse
2015 J jnl
Note on paraconsistency and reasoning about fractions.
J. Appl. Non Class. Logics
Jan A. Bergstra, Inge Bethke
2015 J jnl
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2015 J jnl
On instruction sets for Boolean registers in program algebra.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2015 J jnl
Probabilistic Thread Algebra.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2015 J jnl
Subvarieties of the variety of meadows.
CoRR
Jan A. Bergstra, Inge Bethke
2015 J jnl
Transformation of fractions into simple fractions in divisive meadows.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
A Hoare-like logic of asserted single-pass instruction sequences.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
A Thread Algebra with Probabilistic Features.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
Bitcoin: a Money-like Informational Commodity.
CoRR
Jan A. Bergstra, Peter Weijland
2014 J jnl
Division by zero in non-involutive meadows.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
Editor's Note.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, John V. Tucker
2014 J jnl
Instruction Sequence Based Non-uniform Complexity Classes.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
Instruction sequence size complexity of parity.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
Note on paraconsistency and the logic of fractions.
CoRR
Jan A. Bergstra, Inge Bethke
2014 J jnl
On algorithmic equivalence of instruction sequences for computing bit string functions.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2014 J jnl
Personal Multi-threading.
CoRR
Jan A. Bergstra
2014 J jnl
Promises, Impositions, and other Directionals.
CoRR
Jan A. Bergstra, Mark Burgess
2014 J jnl
Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals.
CoRR
Jan A. Bergstra, Alban Ponse
2013 J jnl
A Process Calculus with Finitary Comprehended Terms.
Theory Comput. Syst.
Jan A. Bergstra, Cornelis A. Middelburg
2013 J jnl
Bitcoin and Beyond: Exclusively Informational Monies
CoRR
Jan A. Bergstra, Karl de Leeuw
2013 J jnl
Cancellation Meadows: A Generic Basis Theorem and Some Applications.
Comput. J.
Jan A. Bergstra, Inge Bethke, Alban Ponse
2013 J jnl
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2013 J jnl
Decision Taking versus Promise Issuing.
CoRR
Jan A. Bergstra
2013 J jnl
Editorial.
Sci. Comput. Program.
Jan A. Bergstra
2013 J jnl
Equations for formally real meadows.
CoRR
Jan A. Bergstra, Inge Bethke, Alban Ponse
2013 J jnl
Guest Editorial.
Comput. J.
Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer
2013 J jnl
Instruction sequence based non-uniform complexity classes
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2013 J jnl
Instruction sequence expressions for the Karatsuba multiplication algorithm.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2013 J jnl
Instruction sequence expressions for the secure hash algorithm SHA-256.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2013 J jnl
Long multiplication by instruction sequences with backward jump instructions.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2013 J jnl
Network algebra for synchronous dataflow
CoRR
Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu
2013 J jnl
Obituary for Jaco de Bakker, 1939-2012.
Bull. EATCS
Jan A. Bergstra, Jan Willem Klop, Jan Rutten
2013 J jnl
Questions related to Bitcoin and other Informational Money
CoRR
Jan A. Bergstra, Karl de Leeuw
2013 J jnl
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
About Instruction Sequence Testing
CoRR
Jan A. Bergstra
2012 J jnl
Decision Taking as a Service
CoRR
Jan A. Bergstra
2012 J jnl
Decision Taking for Selling Thread Startup
CoRR
Jan A. Bergstra
2012 J jnl
Decision Taking versus Action Determination
CoRR
Jan A. Bergstra
2012 J jnl
Four Conceptions of Instruction Sequence Faults
CoRR
Jan A. Bergstra
2012 J jnl
Indirect Jumps Improve Instruction Sequence Performance.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
Informaticology: combining Computer Science, Data Science, and Fiction Science
CoRR
Jan A. Bergstra
2012 — book
Instruction Sequences for Computer Science.
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
Instruction sequence processing operators.
Acta Informatica
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
On the Behaviours Produced by Instruction Sequences under Execution.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness.
Theory Comput. Syst.
Jan A. Bergstra, Inge Bethke
2012 J jnl
On the Expressiveness of Single-Pass Instruction Sequences.
Theory Comput. Syst.
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
Process algebra with conditionals in the presence of epsilon
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2012 J jnl
Turing Impossibility Properties for Stack Machine Programming
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2011 J jnl
A calculus for four-valued sequential logic.
Theor. Comput. Sci.
Jan A. Bergstra, Jaco van de Pol
2011 J jnl
Editorial.
Sci. Comput. Program.
Jan A. Bergstra
2011 J jnl
Informatics Perspectives on Decision Taking
CoRR
Jan A. Bergstra
2011 J jnl
Introducing Sourcements
CoRR
Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen
2011 J jnl
Inversive meadows and divisive meadows.
J. Appl. Log.
Jan A. Bergstra, Cornelis A. Middelburg
2011 J jnl
On the behaviours produced by instruction sequences under execution
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2011 J jnl
Outsourcing Competence
CoRR
Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen
2011 — conf
Proposition Algebra and Short-Circuit Logic.
FSEN
Jan A. Bergstra, Alban Ponse
2011 J jnl
Proposition algebra.
ACM Trans. Comput. Log.
Jan A. Bergstra, Alban Ponse
2011 J jnl
Putting Instruction Sequences into Effect
CoRR
Jan A. Bergstra
2011 J jnl
Real Islamic Logic
CoRR
Jan A. Bergstra
2011 J jnl
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows.
Theory Comput. Syst.
Jan A. Bergstra, Inge Bethke
2011 J jnl
Stratified Outsourcing Theory
CoRR
Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen
2011 J jnl
Thread Extraction for Polyadic Instruction Sequences.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2011 J jnl
Thread algebra for poly-threading.
Formal Aspects Comput.
Jan A. Bergstra, Cornelis A. Middelburg
2010 J jnl
A thread calculus with molecular dynamics.
Inf. Comput.
Jan A. Bergstra, Cornelis A. Middelburg
2010 J jnl
An Interface Group for Process Components.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2010 J jnl
Business Mereology: Imaginative Definitions of Insourcing and Outsourcing Transformations
CoRR
Jan A. Bergstra, S. F. M. van Vlijmen
2010 J jnl
Data Linkage Dynamics with Shedding.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2010 J jnl
Formaleuros, formalcoins and virtual monies
CoRR
Jan A. Bergstra
2010 J jnl
Informal Control code logic
CoRR
Jan A. Bergstra
2010 J jnl
On Hoare-McCarthy algebras
CoRR
Jan A. Bergstra, Alban Ponse
2010 J jnl
On the contribution of backward jumps to instruction sequence expressiveness
CoRR
Jan A. Bergstra, Inge Bethke
2010 J jnl
On the definition of a theoretical concept of an operating system
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2010 J jnl
On the operating unit size of load/store architectures.
Math. Struct. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2010 J jnl
Short-circuit logic
CoRR
Jan A. Bergstra, Alban Ponse
2010 J jnl
Steering Fragments of Instruction Sequences
CoRR
Jan A. Bergstra
2009 J jnl
A process calculus with finitary comprehended terms
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
A progression ring for interfaces of instruction sequences, threads, and services
CoRR
Jan A. Bergstra, Alban Ponse
2009 J jnl
A protocol for instruction stream processing
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms
CoRR
Jan A. Bergstra, Alban Ponse
2009 J jnl
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Alban Ponse
2009 J jnl
Arithmetical meadows
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Autosolvability of halting problem instances for instruction sequences
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Functional units for natural numbers
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Indirect jumps improve instruction sequence performance
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Instruction Sequences with Dynamically Instantiated Instructions.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Instruction sequence notations with probabilistic instructions
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Instruction sequence processing operators
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Inversive Meadows and Divisive Meadows.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Local and Global Trust Based on the Concept of Promises
CoRR
Jan A. Bergstra, Mark Burgess
2009 J jnl
Machine structure oriented control code logic.
Acta Informatica
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Meadow Enriched ACP Process Algebras
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Meadows and the equational specification of division.
Theor. Comput. Sci.
Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker
2009 J jnl
Partial Komori fields and imperative Komori fields.
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Square root meadows
CoRR
Jan A. Bergstra, Inge Bethke
2009 J jnl
Straight-line instruction sequence completeness for total calculation on cancellation meadows
CoRR
Jan A. Bergstra, Inge Bethke
2009 J jnl
Timed tuplix calculus and the Wesseling and van den Berg equation
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2009 C conf
Transmission Protocols for Instruction Streams.
ICTAC
Jan A. Bergstra, Cornelis A. Middelburg
2009 J jnl
Transmission protocols for instruction streams
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
A static theory of promises
CoRR
Jan A. Bergstra, Mark Burgess
2008 J jnl
An Instruction Sequence Semigroup with Repeaters
CoRR
Jan A. Bergstra, Alban Ponse
2008 J jnl
Cancellation Meadows: a Generic Basis Theorem and Some Applications.
CoRR
Jan A. Bergstra, Inge Bethke, Alban Ponse
2008 J jnl
Data linkage algebra, data linkage dynamics, and priority rewriting
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Data linkage dynamics with shedding
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Differential Meadows.
CoRR
Jan A. Bergstra, Alban Ponse
2008 J jnl
Distributed strategic interleaving with load balancing.
Future Gener. Comput. Syst.
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Division Safe Calculation in Totalised Fields.
Theory Comput. Syst.
Jan A. Bergstra, John V. Tucker
2008 — conf
Fields, Meadows and Abstract Data Types.
Pillars of Computer Science
Jan A. Bergstra, Yoram Hirshfeld, John V. Tucker
2008 J jnl
Instruction sequences and non-uniform complexity theory
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Instruction sequences for the production of processes
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Maurer computers for pipelined instruction processing.
Math. Struct. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Mechanistic Behavior of Single-Pass Instruction Sequences
CoRR
Jan A. Bergstra, Mark van der Zwaag
2008 J jnl
On the expressiveness of single-pass instruction sequences
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Program algebra with a jump-shift instruction.
J. Appl. Log.
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Programming an interpreter using molecular dynamics
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Proposition Algebra with Projective Limits
CoRR
Jan A. Bergstra, Alban Ponse
2008 J jnl
Simulating Turing machines on Maurer machines.
J. Appl. Log.
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Thread algebra for sequential poly-threading
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2008 J jnl
Thread extraction for polyadic instruction sequences
CoRR
Jan A. Bergstra, Kees Middelburg
2008 J jnl
Towards a formalization of budgets
CoRR
Jan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag
2008 J jnl
Tuplix Calculus Specifications of Financial Transfer Networks
CoRR
Jan A. Bergstra, Sanne Nolst Trenité, Mark van der Zwaag
2008 J jnl
Tuplix Calculus.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Alban Ponse, Mark van der Zwaag
2007 J jnl
A Thread Algebra with Multi-Level Strategic Interleaving.
Theory Comput. Syst.
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
A process algebra based framework for promise theory
CoRR
Jan A. Bergstra, Inge Bethke, Mark Burgess
2007 J jnl
A thread calculus with molecular dynamics
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
About "trivial" software patents: The IsNot case.
Sci. Comput. Program.
Jan A. Bergstra, Paul Klint
2007 J jnl
An interface group for process components
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Decision problems for pushdown threads.
Acta Informatica
Jan A. Bergstra, Inge Bethke, Alban Ponse
2007 J jnl
Execution architectures for program algebra.
J. Appl. Log.
Jan A. Bergstra, Alban Ponse
2007 J jnl
Instruction Sequences with Dynamically Instantiated Instructions
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Instruction Sequences with Indirect Jumps.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Instruction sequences with indirect jumps
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Interface groups and financial transfer architectures
CoRR
Jan A. Bergstra, Alban Ponse
2007 J jnl
Letter from the editor.
Sci. Comput. Program.
Jan A. Bergstra
2007 J jnl
Machine structure oriented control code logic
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Maurer Computers with Single-Thread Control.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
On the operating unit size of load/store architectures
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Preferential choice and coordination conditions.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Program algebra with a jump-shift instruction
CoRR
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Programming an Interpreter Using Molecular Dynamics.
Sci. Ann. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Projection semantics for rigid loops
CoRR
Jan A. Bergstra, Alban Ponse
2007 J jnl
Synchronous cooperation for explicit multi-threading.
Acta Informatica
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
The rational numbers as an abstract data type.
J. ACM
Jan A. Bergstra, John V. Tucker
2007 J jnl
Thread algebra for strategic interleaving.
Formal Aspects Comput.
Jan A. Bergstra, Cornelis A. Middelburg
2007 J jnl
Tuplix Calculus
CoRR
Jan A. Bergstra, Alban Ponse, Mark van der Zwaag
2006 J jnl
Continuity controlled hybrid automata.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, Cornelis A. Middelburg
2006 — conf
Elementary Algebraic Specifications of the Rational Complex Numbers.
Essays Dedicated to Joseph A. Goguen
Jan A. Bergstra, John V. Tucker
2006 C conf
Elementary Algebraic Specifications of the Rational Function Field.
CiE
Jan A. Bergstra
2006 — conf
Parallel Processes with Implicit Computational Capital.
LIX
Jan A. Bergstra, Cornelis A. Middelburg
2006 J jnl
Splitting bisimulations and retrospective conditions.
Inf. Comput.
Jan A. Bergstra, Cornelis A. Middelburg
2006 J jnl
Thread Algebra with Multi-Level Strategies.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2005 — conf
A Bypass of Cohen's Impossibility Result.
EGC
Jan A. Bergstra, Alban Ponse
2005 C conf
A Thread Algebra with Multi-level Strategic Interleaving.
CiE
Jan A. Bergstra, Cornelis A. Middelburg
2005 J jnl
An upper bound for the equational specification of finite state services.
Inf. Process. Lett.
Jan A. Bergstra, Inge Bethke
2005 — conf
Model Theory for Process Algebra.
Processes, Terms and Cycles
Jan A. Bergstra, Cornelis A. Middelburg
2005 J jnl
Network algebra in Java.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, Inge Bethke
2005 — conf
On the Design Rationale of ACP Style Process Algebras.
APC 25
Jan A. Bergstra
2005 J jnl
Polarized process algebra with reactive composition.
Theor. Comput. Sci.
Jan A. Bergstra, Inge Bethke
2005 J jnl
Process algebra for hybrid systems.
Theor. Comput. Sci.
Jan A. Bergstra, Cornelis A. Middelburg
2005 — conf
Six Themes for Future Concurrency Research.
APC 25
Jos C. M. Baeten, Jan A. Bergstra
2005 B conf
Strong Splitting Bisimulation Equivalence.
CALCO
Jan A. Bergstra, Cornelis A. Middelburg
2004 J jnl
Located Actions in Process Algebra with Timing.
Fundam. Informaticae
Jan A. Bergstra, Cornelis A. Middelburg
2003 J jnl
Branching time and orthogonal bisimulation equivalence.
Theor. Comput. Sci.
Jan A. Bergstra, Alban Ponse, Mark van der Zwaag
2003 — conf
Machine Function Based Control Code Algebras.
FMCO
Jan A. Bergstra
2003 J jnl
Operator programs and operator processes.
Inf. Softw. Technol.
Jan A. Bergstra, Pum Walters
2003 A* conf
Polarized Process Algebra and Program Equivalence.
ICALP
Jan A. Bergstra, Inge Bethke
2002 J jnl
Combining programs and state machines.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, Alban Ponse
2002 J jnl
Molecular dynamics.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, Inge Bethke
2002 J jnl
Molecule-oriented programming in Java.
Inf. Softw. Technol.
Jan A. Bergstra
2002 J jnl
Program algebra for sequential code.
J. Log. Algebraic Methods Program.
Jan A. Bergstra, M. E. Loots
2001 — ch.
Discrete Time Process Algebra and the Semantics of SDL.
Handbook of Process Algebra
Jan A. Bergstra, Cornelis A. Middelburg, Yaroslav S. Usenko
2001 — book
Handbook of Process Algebra
Jan A. Bergstra, Alban Ponse, Scott A. Smolka
2001 J jnl
Non-regular iterators in process algebra.
Theor. Comput. Sci.
Jan A. Bergstra, Alban Ponse
2001 — ch.
Process Algebra with Recursive Operations.
Handbook of Process Algebra
Jan A. Bergstra, Wan J. Fokkink, Alban Ponse
2001 J jnl
Process algebra and conditional composition.
Inf. Process. Lett.
Jan A. Bergstra, Alban Ponse
2001 J jnl
Register-machine based processes.
J. ACM
Jan A. Bergstra, Alban Ponse
2000 — conf
Discrete time process algebra with silent step.
Proof, Language, and Interaction
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Reniers
2000 J jnl
Process Algebra with Four-Valued Logic.
J. Appl. Non Class. Logics
Jan A. Bergstra, Alban Ponse
2000 J jnl
Program Algebra for Component Code.
Formal Aspects Comput.
Jan A. Bergstra, M. E. Loots
1998 J jnl
Bochvar-McCarthy Logic and Process Algebra.
Notre Dame J. Formal Log.
Jan A. Bergstra, Alban Ponse
1998 — conf
Deadlock Behaviour in Split and ST Bisimulation Semantics.
EXPRESS
Jos C. M. Baeten, Jan A. Bergstra
1998 — conf
Grid Protocol Specifications.
Prospects for Hardware Foundations
Jan A. Bergstra, Alban Ponse
1998 J jnl
Kleene's Three-Valued Logic and Process Algebra.
Inf. Process. Lett.
Jan A. Bergstra, Alban Ponse
1998 J jnl
The Discrete Time TOOLBUS - A Software Coordination Architecture.
Sci. Comput. Program.
Jan A. Bergstra, Paul Klint
1997 B conf
Bounded Stacks, Bags and Queues.
CONCUR
Jos C. M. Baeten, Jan A. Bergstra
1997 J jnl
Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time.
Fundam. Informaticae
Jos C. M. Baeten, Jan A. Bergstra
1997 J jnl
Grid Protocols Based on Synchronous Communication.
Sci. Comput. Program.
Jan A. Bergstra, Joris A. Hillebrand, Alban Ponse
1997 — conf
Models for Feature Descriptions and Interactions.
FIW
Jan A. Bergstra, Wiet Bouma
1997 J jnl
Network algebra for asynchronous dataflow.
Int. J. Comput. Math.
Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu
1997 J jnl
Process Algebra with Propositional Signals.
Theor. Comput. Sci.
Jos C. M. Baeten, Jan A. Bergstra
1997 J jnl
Toward a Complete Transformational Toolkit for Compilers.
ACM Trans. Program. Lang. Syst.
Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering
1996 A conf
A Complete Transformational Toolkit for Compilers.
ESOP
Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering
1996 J jnl
Algebra of timed frames.
Int. J. Comput. Math.
Jan A. Bergstra, Wan J. Fokkink, Cornelis A. Middelburg
1996 J jnl
Discrete Time Process Algebra.
Formal Aspects Comput.
Jos C. M. Baeten, Jan A. Bergstra
1996 J jnl
Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation.
Fundam. Informaticae
Jan A. Bergstra, Gheorghe Stefanescu
1996 J jnl
Six Issues Concerning Future Directions in Concurrency Research.
ACM Comput. Surv.
Jos C. M. Baeten, Jan A. Bergstra
1996 — conf
The Discrete Time TOOLBUS.
AMAST
Jan A. Bergstra, Paul Klint
1996 C conf
The TOOLBUS Coordination Architecture.
COORDINATION
Jan A. Bergstra, Paul Klint
1995 J jnl
A Data Type Variety of Stack Algebras.
Ann. Pure Appl. Log.
Jan A. Bergstra, John V. Tucker
1995 J jnl
A propositional logic with 4 values: true, false, divergent and meaningless.
J. Appl. Non Class. Logics
Jan A. Bergstra, Inge Bethke, Piet Rodenburg
1995 J jnl
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
Inf. Comput.
Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
1995 B conf
Discrete Time Process Algebra with Abstraction.
FCT
Jos C. M. Baeten, Jan A. Bergstra
1995 J jnl
Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras.
J. ACM
Jan A. Bergstra, John V. Tucker
1995 J jnl
Homomorphism Preserving Algebraic Specifications Require Hidden Sorts
Inf. Comput.
Jan A. Bergstra, Jan Heering
1995 B conf
Processes with Multiple Entries and Exits.
FCT
Jan A. Bergstra, Gheorghe Stefanescu
1994 — conf
A Real Time Process Logic.
ICTL
Jos C. M. Baeten, Jan A. Bergstra, Roland N. Bol
1994 J jnl
Bisimulation is Two-Way Simulation.
Inf. Process. Lett.
Jan A. Bergstra, Gheorghe Stefanescu
1994 J jnl
Logic of Transition Systems.
J. Log. Lang. Inf.
Johan van Benthem, Jan A. Bergstra
1994 J jnl
On Sequential Compoisiton, Action Prefixes and Process Prefixes.
Formal Aspects Comput.
Jos C. M. Baeten, Jan A. Bergstra
1994 J jnl
Process Algebra with Iteration and Nesting.
Comput. J.
Jan A. Bergstra, Inge Bethke, Alban Ponse
1994 B conf
Process Algebra with Partial Choice.
CONCUR
Jos C. M. Baeten, Jan A. Bergstra
1994 J jnl
Which Data Types have omega-complete Initial Algebra Specifications?
Theor. Comput. Sci.
Jan A. Bergstra, Jan Heering
1993 J jnl
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
J. ACM
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1993 B conf
Non Interleaving Process Algebra.
CONCUR
Jos C. M. Baeten, Jan A. Bergstra
1993 — conf
Process Algebra with Backtracking.
REX School/Symposium
Jan A. Bergstra, Alban Ponse, Jos van Wamel
1993 B conf
Process Algebra with Combinators.
CSL
Jan A. Bergstra, Inge Bethke, Alban Ponse
1993 J jnl
Real space process algebra.
Formal Aspects Comput.
Jos C. M. Baeten, Jan A. Bergstra
1993 B conf
Translations Between Flowchart Schemes and Process Graphs.
FCT
Jan A. Bergstra, Gheorghe Stefanescu
1992 — conf
Asynchronous Communication in Real Space Process Algebra.
FTRTFT
Jos C. M. Baeten, Jan A. Bergstra
1992 B conf
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).
CONCUR
Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
1992 B conf
Discrete Time Process Algebra.
CONCUR
Jos C. M. Baeten, Jan A. Bergstra
1991 — ed.
Algebraic Methods II: Theory, Tools and Applications [papers from a workshop in Mierlo, The Netherlands, September 1989]
Algebraic Methods
Jan A. Bergstra, Loe M. G. Feijs
1991 B conf
Real Space Process Algebra.
CONCUR
Jos C. M. Baeten, Jan A. Bergstra
1991 J jnl
Real Time Process Algebra.
Formal Aspects Comput.
Jos C. M. Baeten, Jan A. Bergstra
1991 J jnl
Recursive Process Definitions with the State Operator.
Theor. Comput. Sci.
Jos C. M. Baeten, Jan A. Bergstra
1991 — conf
The State Operator in Real Time Process Algebra.
REX Workshop
Jos C. M. Baeten, Jan A. Bergstra
1991 J jnl
Uniform Algebraic Specifications of Finite Sets with Equality.
Int. J. Found. Comput. Sci.
Jan A. Bergstra, Sjouke Mauw, Freek Wiedijk
1990 J jnl
Module Algebra
J. ACM
Jan A. Bergstra, Jan Heering, Paul Klint
1990 B conf
Process Algebra with a Zero Object.
CONCUR
Jos C. M. Baeten, Jan A. Bergstra
1989 — conf
A Process Specification Formalism Based on Static COLD.
Algebraic Methods
Jos C. M. Baeten, Jan A. Bergstra, Sjouke Mauw, Gert J. Veltink
1989 — ed.
Algebraic Methods: Theory, Tools and Applications [papers from a workshop in Passau, Germany, June 9-11, 1987]
Algebraic Methods
Martin Wirsing, Jan A. Bergstra
1989 — conf
Design of a Specification Language by Abstract Syntax Engineering.
Algebraic Methods
Jos C. M. Baeten, Jan A. Bergstra
1989 J jnl
Term-Rewriting Systems with Rule Priorities.
Theor. Comput. Sci.
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
1988 — conf
ACP with Signals.
ALP
Jan A. Bergstra
1988 J jnl
Global Renaming Operators in Concrete Process Algebra
Inf. Comput.
Jos C. M. Baeten, Jan A. Bergstra
1988 — conf
Process theory based on bisimulation semantics.
REX Workshop
Jan A. Bergstra, Jan Willem Klop
1988 J jnl
Readies and Failures in the Algebra of Communicating Processes.
SIAM J. Comput.
Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
1987 — conf
ACT
Algebraic Methods
Jan A. Bergstra, Jan Willem Klop
1987 J jnl
Algebraic Specifications of Computable and Semicomputable Data Types.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1987 — conf
Conditional axioms and α/β-calculus in process algebra.
Formal Description of Programming Concepts
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987 — conf
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
PARLE (2)
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987 — conf
Failures without chaos: a new process semantics for fair abstraction.
Formal Description of Programming Concepts
Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
1987 J jnl
On the Consistency of Koomen's Fair Abstraction Rule.
Theor. Comput. Sci.
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987 J jnl
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator.
Comput. J.
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987 — conf
Term Rewriting Systems with Priorities.
RTA
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1986 J jnl
Conditional Rewrite Rules: Confluence and Termination.
J. Comput. Syst. Sci.
Jan A. Bergstra, Jan Willem Klop
1985 J jnl
Algebra of Communicating Processes with Abstraction.
Theor. Comput. Sci.
Jan A. Bergstra, Jan Willem Klop
1985 J jnl
Top-Down Design and the Algebra of Communicating Processes.
Sci. Comput. Program.
Jan A. Bergstra, John V. Tucker
1985 — conf
Verification of an alternating bit protocol by means of process algebra.
Mathematical Methods of Specification and Synthesis of Software Systems
Jan A. Bergstra, Jan Willem Klop
1984 J jnl
Hoare's Logic for Programming Languages with two Data Types.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1984 J jnl
Linear Time and Branching Time Semantics for Recursion with Merge.
Theor. Comput. Sci.
J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
1984 J jnl
On Specifying Sets of Integers.
J. Inf. Process. Cybern.
Jan A. Bergstra, John-Jules Ch. Meyer
1984 J jnl
Process Algebra for Synchronous Communication
Inf. Control.
Jan A. Bergstra, Jan Willem Klop
1984 — conf
Process Algebra with Asynchronous Communication Mechanisms.
Seminar on Concurrency
Jan A. Bergstra, Jan Willem Klop, John V. Tucker
1984 J jnl
Proving Program Inclusion Using Hoare's Logic.
Theor. Comput. Sci.
Jan A. Bergstra, Jan Willem Klop
1984 A* conf
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes.
ICALP
Jan A. Bergstra, Jan Willem Klop
1984 J jnl
The Axiomatic Semantics of Programs Based on Hoare's Logic.
Acta Informatica
Jan A. Bergstra, John V. Tucker
1983 J jnl
A proof rule for restoring logic circuits.
Integr.
Jan A. Bergstra, Jan Willem Klop
1983 — conf
Algebraic Tools for System Construction.
Logic of Programs
Jan A. Bergstra, Jan Willem Klop, John V. Tucker
1983 J jnl
Hoare's Logic and Peano's Arithmetic.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1983 J jnl
Initial Algebra Specifications for Parametrized Data Types.
J. Inf. Process. Cybern.
Jan A. Bergstra, Jan Willem Klop
1983 J jnl
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.
SIAM J. Comput.
Jan A. Bergstra, John V. Tucker
1983 A* conf
Linear Time and Branching Time Semantics for Recursion with Merge.
ICALP
J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
1983 — conf
PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness.
Logic of Programs
Jan A. Bergstra, Jerzy Tiuryn
1983 J jnl
Standard Model Semantics for DSL A Data Type Specification Language.
Acta Informatica
Jan A. Bergstra, J. Terlouw
1982 J jnl
A Simple Transfer Lemma for Algebraic Specifications.
Inf. Process. Lett.
Jan A. Bergstra, John-Jules Ch. Meyer
1982 — conf
A formalized proof system for total correctness of while programs.
Symposium on Programming
Jan A. Bergstra, Jan Willem Klop
1982 A* conf
Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras.
ICALP
Jan A. Bergstra, Jan Willem Klop
1982 J jnl
Another Incompleteness Result for Hoare's Logic
Inf. Control.
Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
1982 J jnl
Expressiveness and the Completeness of Hoare's Logic.
J. Comput. Syst. Sci.
Jan A. Bergstra, John V. Tucker
1982 J jnl
Floyds Principle, Correctness Theories and Program Equivalence.
Theor. Comput. Sci.
Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker
1982 — conf
Formal Proof Systems for Program Equivalence.
Formal Description of Programming Concepts
Jan A. Bergstra, Jan Willem Klop
1982 J jnl
On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic.
Theor. Comput. Sci.
Jan A. Bergstra, John-Jules Ch. Meyer
1982 J jnl
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs.
Theor. Comput. Sci.
Jan A. Bergstra, John V. Tucker
1982 — conf
Specification of Parameterized Data Types.
ADT
Jan A. Bergstra
1982 J jnl
Strong Normalization and Perpetual Reductions in the Lambda Calculus.
J. Inf. Process. Cybern.
Jan A. Bergstra, Jan Willem Klop
1982 J jnl
The Completeness of the Algebraic Specification Methods for Computable Data Types
Inf. Control.
Jan A. Bergstra, John V. Tucker
1982 J jnl
Two Theorems About the Completeness of Hoare's Logic.
Inf. Process. Lett.
Jan A. Bergstra, John V. Tucker
1981 — conf
A Characterization of Program Equivalence in Terms of Hoare's Logic.
GI Jahrestagung
Jan A. Bergstra, J. Terlouw
1981 A* conf
Algebraically Specified Programming Systems and Hoare's Logic.
ICALP
Jan A. Bergstra, John V. Tucker
1981 J jnl
Algorithmic degrees of algebraic structures.
Fundam. Informaticae
Jan A. Bergstra, Jerzy Tiuryn
1981 — conf
Hoare's Logic is Incomplete When It Does Not Have To Be.
Logic of Programs
Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
1981 J jnl
I/O-computable data structures.
ACM SIGPLAN Notices
Jan A. Bergstra, John-Jules Ch. Meyer
1981 J jnl
Logic of effective definitions.
Fundam. Informaticae
Jan A. Bergstra, Jerzy Tiuryn
1981 B conf
On the Power of Algebraic Specifications.
MFCS
Jan A. Bergstra, Manfred Broy, John V. Tucker, Martin Wirsing
1981 J jnl
On the quantifier-free fragment of 'Logic of effective definitions'.
Fundam. Informaticae
Jan A. Bergstra, John-Jules Ch. Meyer
1981 J jnl
Regular extensions of iterative algebras and metric interpretations.
Fundam. Informaticae
Jan A. Bergstra, Jerzy Tiuryn
1981 — conf
The Refinement of Specifications and the Stabiliy of Hoare's Logic.
Logic of Programs
Jan A. Bergstra, John V. Tucker
1980 A* conf
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.
ICALP
Jan A. Bergstra, John V. Tucker
1980 J jnl
Discourse between processes.
Notre Dame J. Formal Log.
Jan A. Bergstra
1980 J jnl
Invertible Terms in the Lambda Calculus.
Theor. Comput. Sci.
Jan A. Bergstra, Jan Willem Klop
1980 — conf
Regular extensions of iterative algebras and metric interpretations.
CLAAP
Jan A. Bergstra, Jerzy Tiuryn
1979 J jnl
Church-Rosser Strategies in the Lambda Calculus.
Theor. Comput. Sci.
Jan A. Bergstra, Jan Willem Klop
1979 J jnl
Effective Transformations on Probabilistic Data.
Math. Log. Q.
Jan A. Bergstra
1979 B conf
Implicit definability of algebraic structures by means of program properties.
FCT
Jan A. Bergstra, Jerzy Tiuryn
1979 J jnl
On the adequacy of finite equational methods for data type specification.
ACM SIGPLAN Notices
Jan A. Bergstra, John V. Tucker
1979 J jnl
Recursive Assertions are not enough - or are they?
Theor. Comput. Sci.
Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens
1978 B conf
Decision Problems Concerning Parallel Programming.
MFCS
Jan A. Bergstra
1978 J jnl
Degrees of Sensible Lambda Theories.
J. Symb. Log.
Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken
1978 J jnl
Degrees of partial functions.
Notre Dame J. Formal Log.
Jan A. Bergstra
1978 J jnl
What is an Abstract Datatype?
Inf. Process. Lett.
Jan A. Bergstra
1977 B conf
An Axiomatization of the Rational Data Objects.
FCT
Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide