Jan Bergstra | Academic Influence

Jan Bergstra's AcademicInfluence.com Rankings

Jan Bergstra

Computer Science

#1596

World Rank

#1651

Historical Rank

Database

#1087

World Rank

#1144

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Jan Bergstra's Degrees

PhD Computer Science University of Amsterdam
Masters Mathematics University of Amsterdam
Bachelors Mathematics University of Amsterdam

Similar Degrees You Can Earn

Why Is Jan Bergstra Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Johannes Aldert "Jan" Bergstra is a Dutch computer scientist. His work has focussed on logic and the theoretical foundations of software engineering, especially on formal methods for system design. He is best known as an expert on algebraic methods for the specification of data and computational processes in general.

(See a Problem?)

Jan Bergstra's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Process Algebra for Synchronous Communication (1984) (1073)
Algebra of Communicating Processes with Abstraction (1985) (790)
Handbook of Process Algebra (2001) (612)
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities (1995) (223)
Real time process algebra (1991) (217)
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages (1987) (215)
Conditional Rewrite Rules: Confluence and Termination (1986) (215)
Syntax and defining equations for an interrupt mechanism in process algebra (1985) (195)
On the Consistency of Koomen's Fair Abstraction Rule (1987) (193)
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes (1984) (168)
Program algebra for sequential code (2002) (153)
Decidability of bisimulation equivalence for process generating context-free languages (1993) (130)
Global Renaming Operators in Concrete Process Algebra (1988) (128)
Algebraic Specifications of Computable and Semicomputable Data Types (1987) (126)
The rational numbers as an abstract data type (2007) (122)
Algebraic specification (1989) (122)
Process Algebra with Iteration and Nesting (1994) (121)
Verification of an alternating bit protocol by means of process algebra (1985) (118)
The Discrete Time TOOLBUS - A Software Coordination Architecture (1998) (115)
Module algebra (1990) (113)
Algebra of Communicating Processes (1995) (110)
Thread algebra for strategic interleaving (2007) (104)
Fixed point semantics in process algebras : (preprint) (1982) (96)
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method (1980) (95)
Process theory based on bisimulation semantics (1988) (92)
Process algebra: specification and verification in bisimulation semantics (1986) (92)
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator (1987) (91)
The TOOLBUS Coordination Architecture (1996) (87)
Logic of transition systems (1994) (86)
Discrete time process algebra (1992) (82)
Linear Time and Branching Time Semantics for Recursion with Merge (1983) (82)
Failures without chaos: a new process semantics for fair abstraction (1987) (80)
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras (1995) (78)
Readies and Failures in the Algebra of Communicating Processes (1988) (76)
Process Algebra with Propositional Signals (1994) (76)
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems (1983) (76)
A propositional logic with 4 values: true, false, divergent and meaningless (1995) (72)
The algebraic specification formalism ASF (1989) (68)
Process Algebra with Signals and Conditions (1990) (68)
The Discrete Time TOOLBUS (1996) (68)
A complete inference system for rgular processes with silent moves (1984) (67)
Instruction sequence processing operators (2009) (60)
A characterization of computable data types by means of a finite, equational specification mehod (1980) (60)
Term-Rewriting Systems with Rule Priorities (1989) (59)
Meadows and the equational specification of division (2009) (58)
Deadlock Behaviour in Split and ST Bisimulation Semantics (1998) (58)
Polarized Process Algebra and Program Equivalence (2003) (57)
Inversive meadows and divisive meadows (2009) (56)
Combining programs and state machines (2002) (53)
Top-Down Design and the Algebra of Communicating Processes (1985) (53)
Discrete Time Process Algebra with Abstraction (1995) (52)
Execution architectures for program algebra (2004) (51)
Decision problems for pushdown threads (2007) (51)
Cancellation Meadows: A Generic Basis Theorem and Some Applications (2008) (51)
Expressiveness and the Completeness of Hoare's Logic (1982) (49)
Put and get, primitives for synchronous unreliable message passing (1985) (48)
The Completeness of the Algebraic Specification Methods for Computable Data Types (1982) (47)
Process Algebra with Asynchronous Communication Mechanisms (1984) (46)
Degrees, reductions and representability in the lambda calculus (1976) (45)
Division Safe Calculation in Totalised Fields (2008) (45)
On the Power of Algebraic Specifications (1981) (42)
Handbook of Network and System Administration (2011) (41)
Synchronous cooperation for explicit multi-threading (2007) (41)
Process Algebra with Recursive Operations (2001) (41)
Thread Algebra with Multi-Level Strategies (2006) (41)
Mode transfer in process algebra (2000) (40)
Division by Zero in Common Meadows (2014) (39)
Real time process algebra with infinitesimals (1993) (39)
Process algebra semantics for queues (1983) (37)
Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time (1997) (36)
A Thread Algebra with Multi-Level Strategic Interleaving (2005) (36)
Conditional axioms and α/β-calculus in process algebra (1987) (35)
Parallel Processes with Implicit Computational Capital (2008) (34)
Interface Groups for Analytic Execution Architectures (2006) (33)
Interface groups and financial transfer architectures (2007) (33)
The ToolBus - a component interconnection architecture (1994) (32)
Process Algebra with a Zero Object (1990) (32)
Instruction Sequences with Indirect Jumps (2007) (32)
Module algebra for relational specifications (1986) (32)
Process algebra for hybrid systems (2004) (32)
Real space process algebra (1991) (32)
ACP - a universal axiom system for process specification (1987) (31)
Strong Normalization and Perpetual Reductions in the Lambda Calculus (1982) (31)
An upper bound for the equational specification of finite state services (2005) (31)
Term Rewriting Systems with Priorities (1987) (31)
Projection semantics for rigid loops (2007) (31)
Distributed strategic interleaving with load balancing (2008) (30)
Process Algebra with Backtracking (1993) (30)
Algebraic Methods: Theory, Tools and Applications (1989) (30)
Instruction Sequences for Computer Science (2012) (29)
Bitcoin: a Money-like Informational Commodity (2014) (29)
Division by zero in non-involutive meadows (2014) (29)
A convergence theorem in process algebra (1982) (29)
Thread Extraction for Polyadic Instruction Sequences (2008) (28)
Network algebra for synchronous and asynchronous dataflow (1994) (28)
Splitting bisimulations and retrospective conditions (2006) (26)
Discrete time process algebra with silent step (2000) (26)
A static theory of promises (2008) (26)
Bitcoin and Beyond: Exclusively Informational Monies (2013) (26)
Sequential data algebra primitives (1996) (26)
Equations for formally real meadows (2013) (26)
Program algebra with a jump-shift instruction (2007) (26)
Process algebra with iteration (1993) (25)
Discrete Time Process Algebra and the Semantics of SDL (1998) (25)
Proposition algebra (2008) (25)
Network algebra with demonic relation operators (1995) (25)
Recursive Assertions are not enough - or are they? (1979) (23)
Promise Theory: Principles and Applications (2014) (23)
Kleene's Three-Valued Logic and Process Algebra (1998) (23)
Program Algebra for Component Code (2000) (23)
An Interface Group for Process Components (2007) (23)
Instruction sequences and non-uniform complexity theory (2008) (23)
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs (1982) (23)
Fracpairs and fractions over a reduced commutative ring (2014) (23)
Instruction Sequences with Dynamically Instantiated Instructions (2007) (22)
A generic basis theorem for cancellation meadows (2008) (22)
ACTtau: A Universal Axiom System for Process Specification (1989) (21)
Frame algebra with synchronous communication (1995) (21)
Process Algebra with Partial Choice (1994) (21)
Machine structure oriented control code logic (2007) (21)
Instruction Sequence Based Non-uniform Complexity Classes (2013) (20)
Sequential data algebra primitives (revised version of P9602) (1996) (20)
Proving Program Inclusion Using Hoare's Logic (1984) (20)
Hoare's Logic and Peano's Arithmetic (1983) (19)
Frame-based process logics (1995) (19)
Tuplix Calculus (2007) (19)
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms (2009) (19)
Process algebra for communication and mutual exclusion (1983) (19)
Questions related to Bitcoin and other Informational Money (2013) (19)
Floyds Principle, Correctness Theories and Program Equivalence (1982) (19)
Local and Global Trust Based on the Concept of Promises (2009) (19)
Failure semantics with fair abstraction (1986) (18)
Process algebra with four-valued logic (2000) (18)
A Complete Transformational Toolkit for Compilers (1996) (18)
Models for Feature Descriptions and Interactions (1997) (17)
On the Expressiveness of Single-Pass Instruction Sequences (2008) (17)
Algebraic definition of a simple programming language (1985) (17)
Church-Rosser Strategies in the Lambda Calculus (1979) (17)
Maurer computers for pipelined instruction processing† (2008) (17)
Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals (2014) (17)
About "trivial" software patents: The IsNot case (2007) (17)
Formaleuros, formalcoins and virtual monies (2010) (16)
Two Theorems About the Completeness of Hoare's Logic (1982) (16)
On sequential composition, action prefixes and process prefix (1994) (16)
An abstraction mechanism for process algebras (1983) (16)
Short-circuit logic (2010) (16)
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions (2014) (16)
A natural data type with a finite equational final semantics specifcation, but no effective equational initial specification (1979) (16)
Grid protocols based on synchronous communication: specification and correctness (1995) (16)
ASF: an algebraic specification formalism (1987) (16)
Elementary Algebraic Specifications of the Rational Complex Numbers (2006) (16)
Note on paraconsistency and reasoning about fractions (2014) (15)
Partial Komori fields and imperative Komori fields (2009) (15)
A Data Type Variety of Stack Algebras (1995) (15)
Register-machine based processes (2001) (15)
Grid Protocols Based on Synchronous Communication (1997) (15)
Putting Instruction Sequences into Effect (2011) (15)
Instruction sequence notations with probabilistic instructions (2009) (15)
Bochvar-McCarthy Logic and Process Algebra (1998) (15)
Tuplix Calculus Specifications of Financial Transfer Networks (2008) (15)
Asynchronous Communication in Real Space Process Algebra (1992) (15)
Non-regular iterators in process algebra (2001) (15)
An Arithmetical Module for Rationals and Reals (1997) (15)
Maurer Computers with Single-Thread Control (2007) (15)
Initial and final algebra semantics for data type specifications: two characterisation theorems : (preprint) (1980) (14)
Network algebra for asynchronous dataflow (1997) (14)
Algebraically Specified Programming Systems and Hoare's Logic (1981) (14)
Non Interleaving Process Algebra (1993) (14)
Outsourcing Competence (2011) (14)
Toward a complete transformational toolkit for compilers (1997) (14)
The completeness of the algebraic specification methods for data types : (preprint) (1980) (14)
Branching time and orthogonal bisimulation equivalence (2003) (14)
Recursive Process Definitions with the State Operator (1991) (14)
Autosolvability of halting problem instances for instruction sequences (2009) (14)
Division by Zero : A Survey of Options (2019) (14)
Simulating Turing machines on Maurer machines (2008) (14)
A Bypass of Cohen's Impossibility Result (2005) (14)
Algebraic Tools for System Construction (1983) (14)
Invertible Terms in the Lambda Calculus (1980) (14)
Preliminaries to an Investigation of Reduced Product Set Finance (2010) (13)
Process Algebra with Combinators (1993) (13)
Thread algebra and risk assessment services (2007) (13)
Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds : (preprint) (1993) (13)
Transformation of fractions into simple fractions in divisive meadows (2015) (13)
Graph isomorphism models for non interleaving process algebra (1994) (12)
ACP with Signals (1988) (12)
On Specifying Sets of Integers (1984) (12)
UvA Budget Allocatie Model (2008) (12)
On Instruction Sets for Boolean Registers in Program Algebra (2015) (12)
A process algebra for the operational semantics of static data flow networks (1983) (12)
On the adequacy of finite equational methods for data type specification (1979) (12)
Transmission Protocols for Instruction Streams (2009) (12)
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract) (2013) (12)
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract) (1992) (12)
Graph isomorphism models for non interleaving process algebra (1994) (12)
Process Algebra Semantics of fSDL (1995) (12)
Which Data Types have omega-complete Initial Algebra Specifications? (1994) (11)
Programming an Interpreter Using Molecular Dynamics (2008) (11)
A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification : (preprint) (1980) (11)
Algebra of timed frames (1995) (11)
A process creation mechanism in process algebra (1985) (11)
A survey of axiom systems for process algebras (1991) (11)
Instruction Sequence Size Complexity of Parity (2014) (11)
Signed Meadow valued Probability Mass Functions (2013) (11)
Polarized process algebra with reactive composition (2005) (11)
Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras (1982) (11)
Fields, Meadows and Abstract Data Types (2008) (10)
Proposition Algebra and Short-Circuit Logic (2011) (10)
A progression ring for interfaces of instruction sequences, threads, and services (2009) (10)
Instruction sequence expressions for the secure hash algorithm SHA-256 (2013) (10)
Bitcoin and Islamic Finance (2014) (10)
A thread calculus with molecular dynamics (2007) (10)
An operational semantics for process algebra (1985) (10)
A Process Specification Formalism Based on Static COLD (1989) (10)
Meadow Enriched ACP Process Algebras (2009) (10)
Representability in lambda algebras (1976) (10)
Predictable and Reliable Program Code: Virtual Machine-Based Projection Semantics (2006) (10)
Real Islamic Logic (2011) (10)
Indirect Jumps Improve Instruction Sequence Performance (2009) (10)
Stratified Outsourcing Theory (2011) (10)
Informatics Perspectives on Decision Taking (2011) (10)
A Real Time Process Logic (1994) (9)
Algebraic specifications of computable and semi-computable data structures : (preprint) (1979) (9)
Functional units for natural numbers (2009) (9)
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation (2009) (9)
I/O-computable data structures (1981) (9)
Process algebra and conditional composition (2001) (9)
Preferential choice and coordination conditions (2007) (9)
Initial Algebra Specifications for Parametrized Data Types (1981) (9)
Discrete time process algebra (revised version of P9208b) (1995) (9)
Continuity controlled hybrid automata (2004) (9)
Bounded Stacks, Bags and Queues (1997) (9)
Interest Prohibition and Financial Product Innovation (2011) (9)
The inescapable stack: an exercise in algebraic specification with total functions (1988) (8)
Process algebra with feedback (1994) (8)
On Hoare-McCarthy algebras (2010) (8)
Model Theory for Process Algebra (2005) (8)
A Process Calculus with Finitary Comprehended Terms (2009) (8)
Elementary Algebraic Specifications of the Rational Function Field (2006) (8)
Arithmetical Datatypes, Fracterms, and the Fraction Definition Problem (2020) (8)
Algebraic Methods II: Theory, Tools and Applications (1991) (8)
Thread algebra for poly-threading (2008) (8)
Failures without chaos : a new process model for fair abstraction (1987) (8)
Skew Meadows (2009) (8)
Thread algebra for sequential poly-threading (2008) (8)
Informal Control code logic (2010) (8)
Subvarieties of the Variety of Meadows (2015) (8)
Informatics Perspectives on Decision Taking, a Case Study on Resolving Process Product Ambiguity (2011) (7)
A proof rule for restoring logic circuits (1983) (7)
Some simple calculations in relative discrete time process algebra (1995) (7)
Four Complete Datatype Defining Rewrite Systems for an Abstract Datatype of Natural Numbers (2014) (7)
Correctness theories and program equivalence : (preprint) (1979) (7)
Candidate Software Process Flaws for the Boeing 737 Max MCAS Algorithm and Risks for a Proposed Upgrade (2020) (7)
On the definition of a theoretical concept of an operating system (2010) (7)
An introduction to process algebra (1992) (7)
Informaticology: combining Computer Science, Data Science, and Fiction Science (2012) (7)
Hoare's Logic for Programming Languages with two Data Types (1984) (7)
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows (2009) (7)
Decision Taking as a Service (2012) (7)
Priority rewrite systems (1984) (7)
Data Linkage Dynamics with Shedding (2008) (6)
An application specific informal logic for interest prohibition theory (2011) (6)
Evaluation trees for proposition algebra (2015) (6)
Arithmetical meadows (2009) (6)
Emperical semantics for object-oriented programs (1999) (6)
Using Hoare logic in a process algebra setting (2019) (6)
The State Operator in Real Time Process Algebra (1991) (6)
Hoare's Logic is Incomplete When It Does Not Have To Be (1981) (6)
Decision Taking versus Action Determination (2012) (6)
The Refinement of Specifications and the Stabiliy of Hoare's Logic (1981) (6)
Global renaming operators in concrete process algebra:(revised version) (1987) (6)
Algebra of communicating processes : part II (1984) (6)
Process Algebra with Five-Valued Conditions (2001) (6)
Degrees of sensible lambda theories (1978) (6)
On the operating unit size of load/store architectures† (2007) (6)
Conditional Values in Signed Meadow Based Axiomatic Probability Calculus (2016) (6)
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting (2008) (6)
Fractions in Transrational Arithmetic (2020) (5)
Translations Between Flowchart Schemes and Process Graphs (1993) (5)
On the Behaviours Produced by Instruction Sequences under Execution (2011) (5)
About Instruction Sequence Testing (2012) (5)
Promise Theory as a Tool for Informaticians (2020) (5)
What is an Abstract Datatype? (1978) (5)
A Promise Theoretic Account of the Boeing 737 Max MCAS Algorithm Affair (2019) (5)
The continuous functionals and 2E (1978) (5)
Business Mereology: Imaginative Definitions of Insourcing and Outsourcing Transformations (2010) (5)
Instruction sequences for the production of processes (2008) (5)
The variety of process algebra (DRAFT) (1991) (5)
Decision Taking for Selling Thread Startup (2012) (5)
Process Algebra with Strategic Interleaving (2017) (5)
Equational specifications of finite minimal unoids, using unary hidden functions only (1982) (5)
A calculus for sequential logic with 4 values (1996) (5)
Process algebra with five-valued logic (1999) (5)
Regular extensions of iterative algebras and metric interpretations (1980) (5)
Contradiction-Tolerant Process Algebra with Propositional Signals (2015) (5)
Long multiplication by instruction sequences with backward jump instructions (2013) (5)
Bitcoin: not a currency-like informational commodity (2014) (5)
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness (2010) (5)
Theoretische software-engineering (1998) (4)
Strong Splitting Bisimulation Equivalence (2005) (4)
Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view (2016) (4)
Bisimulation is Two-Way Simulation (1994) (4)
Two recursive generalisations of iteration in process algebra (1998) (4)
Syntax and semantics of a high-level intermediate representation for ASF+SDF (2000) (4)
The Transrational Numbers as an Abstract Data Type (2020) (4)
A formalized proof system for total correctness of while programs (1982) (4)
An algebraic specification method for processes over a finite action set (1983) (4)
Implicit definability of algebraic structures by means of program properties (1979) (4)
Abstract : The "real ordinal" of the 1-section of a continuous functional (1977) (4)
A process algebra based framework for promise theory (2007) (4)
A short introduction to program algebra with instructions for Boolean registers (2018) (4)
Arithmetical datatypes with true fractions (2020) (4)
A negative result on algebraic specifications of the meadow of rational numbers (2015) (4)
Object-oriented algebraic specification proposal for a notation and $12$ examples (1984) (4)
Instruction Sequences Expressing Multiplication Algorithms (2018) (4)
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference (2016) (4)
Periodic Single-Pass Instruction Sequences (2008) (4)
Square root meadows (2009) (4)
Uniform Algebraic Specifications of Finite Sets with Equality (1991) (4)
Differential Meadows (2008) (4)
Another Incompleteness Result for Hoare's Logic (1982) (4)
Located Actions in Process Algebra with Timing (2003) (4)
Operator programs and operator processes (2003) (4)
A simple programming language and its implementation (1989) (4)
Which data types have w-complete initial algebra specifications?* (2006) (4)
Four Conceptions of Instruction Sequence Faults (2012) (4)
Molecular dynamics (2002) (4)
Promise Theory: Principles and Applications (Volume 1) (2014) (4)
Specification of Parameterized Data Types (1982) (4)
Process algebra with siugnals and conditions (1992) (4)
Introducing Sourcements (2011) (4)
Floyd's principle, correctness theories and program equivalence : (preprint) (1980) (3)
The axiomatic semantics of programs based on Hoare's logic (1984) (3)
Instruction Sequence Faults with Formal Change Justification (2020) (3)
Fair FIFO queues satisfy an algebraic criterion for protocol correctness (1984) (3)
Small specifications for large finite data structures (1981) (3)
Personal Multi-threading (2014) (3)
Machine Function Based Control Code Algebras (2003) (3)
A calculus for four-valued sequential logic (2011) (3)
On the complexity of the correctness problem for non-zeroness test instruction sequences (2018) (3)
Processes with Multiple Entries and Exits (1995) (3)
Network Algebra for Synchronous and Asynchronous Dataaow Gh. S Teff Anescu (1995) (3)
A Nopreprint on the Pragmatic Logic of Fractions (2015) (3)
On bounds for the specification of finite data types by means of equations and conditional equations : (preprint) (1980) (3)
Refinement of specifications and the stability of Hoare's logic (1982) (3)
Program Algebra with Repeat Instruction (2006) (3)
School Algebra as a Surrounding Container for School Arithmetic (2015) (3)
Steering Fragments of Instruction Sequences (2010) (3)
Process algebra semantics of $\varphi${SDL} (1995) (3)
Poly-infix operators and operator families (2015) (3)
The Wheel of Rational Numbers as an Abstract Data Type (2020) (3)
Towards a formalization of budgets (2008) (3)
Universality of Univariate Mixed Fractions in Divisive Meadows (2017) (3)
Process Algebra Primitives for File Transfer (1997) (3)
PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness (1983) (3)
How to find a Software Patent ? (2007) (3)
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers (2020) (3)
Grid Protocol Specifications (1998) (3)
Conditional axioms and alpha/beta-calculus in process algebra (1985) (3)
Probabilistic Thread Algebra (2015) (2)
Program algebra for Turing-machine programs (2019) (2)
Mechanistic Behavior of Single-Pass Instruction Sequences (2008) (2)
Recursion theory on processes (1979) (2)
Formal Proof Systems for Program Equivalence (1982) (2)
Non-commutative propositional logic with short-circuit evaluation (2021) (2)
Another incompleteness theorem for Hoare's logic (1983) (2)
Program Algebra and Thread Algebra (2006) (2)
A Terminology for Instruction Sequencing (2015) (2)
Decision Taking versus Promise Issuing (2013) (2)
An Instruction Sequence Semigroup with Repeaters (2008) (2)
Decision Taking Avoiding Agency (2015) (2)
Promise Theory and the Alignment of Context, Processes, Types, and Transforms (2021) (2)
“Rekenen-informatica”: Informatics for Primary School Mathematics (2015) (2)
Review of Suppes 1957 Proposals For Division by Zero (2021) (2)
Molecule-oriented programming in Java (2002) (2)
A protocol for instruction stream processing (2009) (2)
Homomorphism Preserving Algebraic Specifications Require Hidden Sorts (1995) (2)
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences (2017) (2)
A nopreprint on Algebraic Algorithmics: Paraconsistency as an Afterthought (2015) (2)
Linear Projective Program Syntax (2004) (2)
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers (2019) (2)
Six issues concerning future directions in concurrency research (1996) (2)
A logic for signal inserted timed frames (1996) (2)
Axiomatizing probabilistic processes : ACP with generative probabilities (Extended abstract) (1992) (2)
Theoretische software-engineering : kenmerken, faseringen en classificaties (1998) (2)
Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation (1996) (2)
On the Design Rationale of ACP Style Process Algebras (2006) (2)
An Axiomatization of the Rational Data Objects (1977) (2)
Instruction sequence expressions for the Karatsuba multiplication algorithm (2013) (2)
Signed Meadow Valued Probability Functions (2013) (2)
A Characterization of Program Equivalence in Terms of Hoare's Logic (1981) (2)
Meadow based Fraction Theory (2015) (1)
On the quantifier-free fragment of 'Logic of effective definitions' (1981) (1)
A Process Calculus with Finitary Comprehended Terms (2013) (1)
Timed Frame Models for Discrete Time Process Algebras Timed Frame Models for Discrete Time Process Algebras (1997) (1)
Homomorphism Preserving Algebraic Specifications Require Hidden Sorts Homomorphism Preserving Algebraic Speciications Require Hidden Sorts (1993) (1)
On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic (1982) (1)
A Simple Transfer Lemma for Algebraic Specifications (1982) (1)
Machine Structure Oriented Control Code Logic (Extended Version) (2007) (1)
Totalising Partial Algebras: Teams and Splinters (2022) (1)
Dialectical roots for interest prohibition theory (2011) (1)
Promises, Impositions, and other Directionals (2014) (1)
Accusation Theory (2021) (1)
Programs, interfaces and components (1999) (1)
Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money (2015) (1)
Network algebra for synchronous dataflow (2013) (1)
Disk allocation for cartesian product files, a counterexample (1983) (1)
From Software Crisis to Informational Money (2014) (1)
Accusations in the context of computer programming (2022) (1)
Instruction sequence processing operators (2012) (1)
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent (2021) (1)
The software invention cube: A classification scheme for software inventions (2008) (1)
Totalising Partial Algebras (2022) (1)
Defects and Faults in Algorithms, Programs and Instruction Sequences (2022) (1)
Dual Number Meadows (2019) (1)
Algorithmic degrees of algebraic structures (1981) (1)
Algebraic Methods: Theory, Tools and Applications [papers from a workshop in Passau, Germany, June 9-11, 1987] (1987) (1)
On bounds for the specification of finite data types of means of equations and conditional equations (1993) (1)
Network algebra in Java (2004) (1)
Meadow based Fracterm Theory (2015) (1)
Effective Transformations on Probabilistic Data (1979) (1)
A Thread Algebra with Probabilistic Features (2014) (1)
Conditional rewrite rules; confluency and termination : Preprint (1982) (1)
UvA-DARE ( Digital Academic Repository ) Inversive meadows and divisive meadows (2011) (1)
Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence (2015) (1)
Algebra of states and transitions (1989) (1)
Standard model semantics for DSL a data type specification language (1983) (1)
Division by Zero (2019) (1)
Timed Frame Models for Discrete Time Process Algebras Timed Frame Models for Discrete Time Process Algebras (1997) (1)
Discrete Time Network Algebra for a Semantic Foundation of Sdl Discrete Time Network Algebra for a Semantic Foundation of Sdl (1997) (1)
Personal Multithreading: Account Snippet Proposals and Missing Account Indications (2015) (1)
A ug 2 01 0 Formaleuros , formalcoins , and virtual monies (2017) (0)
Data flow networks in Java (2000) (0)
Partial arithmetical data types of rational numbers and their equational specification (2022) (0)
Sourcing Theory for Academic Teaching: the Owner-Driver-Source Provider Model (2007) (0)
Abrahamson, KA, Downey, RG and Fellows, MR (1995) (0)
18 51 v 3 [ cs . P L ] 1 7 O ct 2 01 0 Functional Units for Natural Numbers (2021) (0)
Editorial (2013) (0)
Platforms, specifications and decisions (2000) (0)
algebra semantics for queues (2006) (0)
Which Arithmetical Data Types Admit Fracterm Flattening? (2022) (0)
Algebraic methods : theory, tools and applications : workshop : proceedings, II, 1989, September, Mierlo (1991) (0)
Process algebra with conditionals in the presence of epsilon (2012) (0)
Univer sity of Amsterdam Programming Research Group Instruction Sequences and Non-uniform Complexity Theory (2008) (0)
A bypass of Cohen's impossibility result: Extended version (in html) (2006) (0)
Bounded bags, stacks and queues (1997) (0)
Transmission Control Protocols for the Internet (2004) (0)
Instruction Sequences and Process Algebra (2012) (0)
Guest Editorial (2013) (0)
D ec 2 01 4 Instruction Sequence Size Complexity of Parity (2014) (0)
Proces algebra met interrupt mechanisme (1985) (0)
UvA-DARE ( Digital Academic Repository ) Formaleuros , formalcoins and virtual monies (2010) (0)
Branchingtime and orthog onal bisimulation equivalence (2003) (0)
Obituary for Jaco de Bakker, 1939-2012 (2013) (0)
21 Proposition Algebra (2011) (0)
Software mechanics for java multi-threading. Technical Report P9906 (1999) (0)
Kurt Mehlhorn on his being Awarded the 2014 Erasmus Medal at the Academia Europaea Annual General Meeting at the Institut d’Estudis Catalans, Barcelona, Spain, Wednesday 16 July 2014 (2016) (0)
UvA-DARE ( Digital Academic Repository ) Dialectical roots for interest prohibition theory (2011) (0)
L O ] 2 M ar 2 01 3 Network Algebra for Synchronous Dataflow (2013) (0)
UvA-DARE (Digital Academic Repository) Equations for formally real meadows Equations for formally real meadows (2015) (0)
Variations on a Theme (2012) (0)
Blockchain Technology and its Applications A Promise Theory view-V 0 . 11 ∗ (2018) (0)
UvA-DARE ( Digital Academic Repository ) The data type variety of stack algebras (2003) (0)
ON THE EE MINATION OF ITERATI N QUANTIFIE A FRAGMENT OF ALGORITHMIC IXDGIC (1982) (0)
Prospective, Retrospective, and Formal Division: a contribution to philosophical arithmetic (2022) (0)
Introductory note to "Object-Oriented Algebra Specification" (1994) (0)
A New Non-Time Based Tracking Control for Mobile Robot (2020) (0)
RAPPORT A complete transformational toolkit for compilers (2011) (0)
An Opinion on Promises, Threats, and Accusations In the 2022 Russo-Ukrainian War (2022) (0)
Local and Global Trust Based on the Concept of Promises ( Draft ) (2006) (0)
Ju l 2 00 9 Inversive Meadows and Divisive Meadows (0)
The ToolBus component interconnection architecture, overview and first experiences (1994) (0)
Abstracts Control Code Logic (2007) (0)
2 Component B : Academic researchers (0)
A propositional version of Hoare's logic with modal operators (1982) (0)
Letter from the editor (2007) (0)
UvA-DARE ( Digital Academic Repository ) Division safe calculation in totalised fields (2008) (0)
A Swot Analysis of Instruction Sequence Theory (2015) (0)
Four Notions of Fault for Program Specifications (2022) (0)
UvA-DARE ( Digital Academic Repository ) Instruction sequence processing operators (0)
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness (2011) (0)
LINEAR TIME AND BRANCHING FOR RECURSION WITH MERGE TIME SEMANTICS (1984) (0)
R A ] 2 1 A pr 2 00 8 Differential Meadows (2008) (0)
RECURSIVE ASSERTNXW ARE NtDT ENOUGH - QR ARE THEY?* (1979) (0)
UvA-DARE ( Digital Academic Repository ) Informal control code logic (2010) (0)
Ju n 20 09 Instruction Sequence Notations with Probabilistic Instructions (2009) (0)
Real Time Process Algebra with Infinitesimal s (2013) (0)
A First Course on C Program Reading (2000) (0)
Equational Axioms for Expected Value Operators (2016) (0)
ToolBus (Monographs in Computer Science) (2005) (0)
Books and Edited Volumes Lambda Calculus and Rewrite Systems (2007) (0)
Informational Money, Islamic Finance, and the Dismissal of Negative Interest Rates (2015) (0)
RAPPORT Homomorphism preserving algebraic specifications require hidden sorts (2011) (0)
Univer sity of Amsterdam Programming Research Group An Interface Group for Process Components (2007) (0)
Provably correct programming and beyond (1998) (0)
Design of a Specification Language by Abstract Syntax Engineering (1989) (0)
Process algebra with pointers (2002) (0)
Preprint : Algebra of communicating processes (1984) (0)
UvA-DARE ( Digital Academic Repository ) Inversive meadows and divisive (2011) (0)
Conditional logic as a short-circuit logic (2023) (0)
Program Algebra for Flow Charts (1999) (0)
Thread Algebra with Prospecting Services and Foresight Patterns (2022) (0)
Eager Equality for Rational Number Arithmetic (2023) (0)
On the refinement of specifications and hoare's logic : (preprint) (1980) (0)
Se p 20 09 Partial Komori Fields and Imperative Komori Fields (0)
Hoare's logic and peano's arithmetic : (preprint) (1981) (0)
Division by Zero and Abstract Data Types (2014) (0)
Process algebra with zero object and non-determinacy (1990) (0)
Expressiveness of Instruction Sequences (2012) (0)
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation (2020) (0)
An equational class of I/0-computable datastructures that contains (1981) (0)
Transformation of Reduction Systemsa view on proving correctness Bas Luttik (1996) (0)
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences (2014) (0)
Turing Impossibility Properties for Stack Machine Programming (2012) (0)
UvA-DARE ( Digital Academic Repository ) Decision Taking versus Promise Issuing (2013) (0)
Formele ontwikkeling van schermverloopschema's en interaktieve programma's [Formal development of screen flow schemes and interactive programs] (1983) (0)
Datatype defining rewrite systems for naturals and integers (2016) (0)
Explorer Pure bigraphs : Structure and dynamics (2017) (0)
UvA-DARE (Digital Academic Proposition algebra with projective limits Proposition Algebra with Projective Limits (2008) (0)
Static Process Algebra as Pre-arithmetical Content for School Arithmetic (2015) (0)
Program Algebra and Coprogram Calculus (2000) (0)
Fraction theory for involutive meadows (2015) (0)
The Necker cube and the logic of fractions (2015) (0)
A propositional version of Hoare's logic (1981) (0)
The field of algebraic numbers fails to possess even a nice sound, if relatively incomplete, hoare-like logic for its while-programs : (preprint) (1980) (0)
Arithmetical datatypes with true fractions (2020) (0)
RAPPORT Branching Time and Orthogonal Bisimulation Equivalence (2000) (0)
Strong normalisation and perpetual reduction in the lambda calculus (1982) (0)
Inversive Meadows and Divisive (2011) (0)
Control code logic (2007) (0)
2 1 A pr 2 02 0 Process Algebra with Strategic Interleaving , Revised Version (2020) (0)
Axioms for SNABOK, a System and Network Administration Body of Knowledge: Missing Link Stage of Ontology Process (2004) (0)
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory (2022) (0)
Editorial (2011) (0)
Instruction sequences for computer science / Jan A. Bergstra, Cornelis A. Middelburg (2012) (0)
Univer sity of Amsterdam Programming Research Group Thread Extraction for Polyadic Instruction Sequences (2008) (0)
On the Expressiveness of Single-Pass Instruction Sequences (2010) (0)
Formal proof systems for program equivalence : (preprint) (1982) (0)
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant (2018) (0)
Formal Aspects of Computing Thread algebra for poly-threading (2011) (0)
Process semantics of algebraic data types (1981) (0)
Prospective, Retrospective, and Formal Division (2022) (0)
Editor's Note (2014) (0)
Software Mechanics for Java-Multi-Threading (1999) (0)
Six Themes for Future Concurrency Research (2006) (0)
Decision Problems Concerning Parallel Programming (1978) (0)
N ov 2 00 9 Instruction Sequence Processing Operators (0)
Process Algebra with Strategic Interleaving (2018) (0)
12345 efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES The Rational Numbers as an Abstract Data Type by (2005) (0)
Computation-Theoretic Issues (2012) (0)
Abstract. An algebra (1981) (0)
Abstract : Dynamic recursion theory (1980) (0)
Abstract. We defineareduci bility relation (1981) (0)
Discourse between processes (1980) (0)
Algebraic Methods II: Theory, Tools and Applications [papers from a workshop in Mierlo, The Netherlands, September 1989] (1989) (0)
Degrees of partial functions (1978) (0)
Univer sity of Amsterdam Programming Research Group Inversive Meadows and Divisive (2009) (0)
Bitcoin: Informational Money en het Einde van Gewoon Geld (2014) (0)
A Survey of Testing for Instruction Sequence Theory (2022) (0)
Basic Multi-Competence Programming (2000) (0)
INVERTIBLE TERMS 13 THE LAMBDA CALCULUS (1980) (0)
Platform projections, compilers, interpreters and portability (1999) (0)
12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES (2005) (0)
Computer-Architectural Issues (2012) (0)
Univer sity of Amsterdam Programming Research Group Thread Algebra for Sequential Poly (2008) (0)

This paper list is powered by the following services:

Other Resources About Jan Bergstra

en.wikipedia.org

What Schools Are Affiliated With Jan Bergstra?

Jan Bergstra is affiliated with the following schools: