


default search action
Jan A. Bergstra
Person information
- affiliation: University of Amsterdam, Netherlands
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j174]Jan A. Bergstra
, John V. Tucker:
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows. Comput. J. 67(5): 1866-1871 (2024) - [j173]Jan A. Bergstra, John V. Tucker
:
Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero. J. Log. Lang. Inf. 33(4): 277-298 (2024) - [j172]Jan A. Bergstra
, John V. Tucker
:
Synthetic Fracterm Calculus. J. Univers. Comput. Sci. 30(3): 289-307 (2024) - [i111]Jan A. Bergstra, John V. Tucker:
Rings with common division, common meadows and their conditional equational theories. CoRR abs/2405.01733 (2024) - [i110]Jan A. Bergstra, Cornelis A. Middelburg:
Space-time process algebra with asynchronous communication. CoRR abs/2409.15120 (2024) - 2023
- [j171]Jan A. Bergstra, John V. Tucker:
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness. Comput. J. 66(7): 1565-1572 (2023) - [j170]Jan A. Bergstra
, John V. Tucker
:
Naive Fracterm Calculus. J. Univers. Comput. Sci. 29(9): 961-987 (2023) - [j169]Jan A. Bergstra
, John V. Tucker
:
Eager Equality for Rational Number Arithmetic. ACM Trans. Comput. Log. 24(3): 22:1-22:28 (2023) - [i109]Jan A. Bergstra, Alban Ponse:
Conditional logic as a short-circuit logic. CoRR abs/2304.14821 (2023) - [i108]Jan A. Bergstra, John V. Tucker:
A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows. CoRR abs/2307.04270 (2023) - 2022
- [j168]Jan A. Bergstra
:
A Survey of Testing for Instruction Sequence Theory. Sci. Ann. Comput. Sci. 32(1): 5-86 (2022) - [j167]Jan A. Bergstra
, John V. Tucker:
Which Arithmetical Data Types Admit Fracterm Flattening? Sci. Ann. Comput. Sci. 32(1): 87-107 (2022) - [j166]Jan A. Bergstra
:
Four Notions of Fault for Program Specifications. Sci. Ann. Comput. Sci. 32(2): 183-209 (2022) - [j165]Jan A. Bergstra, John V. Tucker:
Partial arithmetical data types of rational numbers and their equational specification. J. Log. Algebraic Methods Program. 128: 100797 (2022) - [c70]Jan A. Bergstra, John V. Tucker:
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 63-80 - 2021
- [j164]Jan A. Bergstra
:
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent. Sci. Ann. Comput. Sci. 31(1): 1-50 (2021) - [j163]Jan A. Bergstra, Cornelis A. Middelburg
:
Using Hoare Logic in a Process Algebra Setting. Fundam. Informaticae 179(4): 321-344 (2021) - [j162]Jan A. Bergstra
, Alban Ponse
, Daan J. C. Staudt:
Non-commutative propositional logic with short-circuit evaluation. J. Appl. Non Class. Logics 31(3-4): 234-278 (2021) - [j161]Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for naturals and integers. Log. Methods Comput. Sci. 17(1) (2021) - 2020
- [j160]Jan A. Bergstra, Alban Ponse
:
Arithmetical datatypes with true fractions. Acta Informatica 57(3-5): 385-402 (2020) - [j159]Jan A. Bergstra
:
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers. Sci. Ann. Comput. Sci. 30(1): 1-24 (2020) - [j158]Jan A. Bergstra
:
Instruction Sequence Faults with Formal Change Justification. Sci. Ann. Comput. Sci. 30(2): 105-166 (2020) - [j157]Jan A. Bergstra
:
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation. Sci. Ann. Comput. Sci. 30(2): 167-203 (2020) - [j156]Jan A. Bergstra, Cornelis A. Middelburg
:
On the complexity of the correctness problem for non-zeroness test instruction sequences. Theor. Comput. Sci. 802: 1-18 (2020) - [c69]Jan A. Bergstra, John V. Tucker:
The Wheel of Rational Numbers as an Abstract Data Type. WADT 2020: 13-30 - [i107]Jan A. Bergstra, Mark Burgess:
A Promise Theoretic Account of the Boeing 737 Max MCAS Algorithm Affair. CoRR abs/2001.01543 (2020) - [i106]Jan A. Bergstra, Mark Burgess:
Candidate Software Process Flaws for the Boeing 737 Max MCAS Algorithm and Risks for a Proposed Upgrade. CoRR abs/2001.05690 (2020)
2010 – 2019
- 2019
- [j155]Jan A. Bergstra:
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers. Comput. Sci. J. Moldova 27(2): 131-161 (2019) - [j154]Jan A. Bergstra
:
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference. Sci. Ann. Comput. Sci. 29(1): 1-58 (2019) - [j153]Jan A. Bergstra
, Cornelis A. Middelburg
:
Program Algebra for Turing-Machine Programs. Sci. Ann. Comput. Sci. 29(2): 113-139 (2019) - [j152]Jan A. Bergstra, Cornelis A. Middelburg
:
Process Algebra with Strategic Interleaving. Theory Comput. Syst. 63(3): 488-505 (2019) - [i105]Jan A. Bergstra, Cornelis A. Middelburg:
Program algebra for Turing-machine programs. CoRR abs/1901.08840 (2019) - [i104]Jan A. Bergstra:
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers. CoRR abs/1904.08722 (2019) - [i103]Jan A. Bergstra, Cornelis A. Middelburg:
Using Hoare logic in a process algebra setting. CoRR abs/1906.04491 (2019) - 2018
- [j151]Jan A. Bergstra, Cornelis A. Middelburg:
A Short Introduction to Program Algebra with Instructions for Boolean Registers. Comput. Sci. J. Moldova 26(3): 199-232 (2018) - [j150]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction Sequences Expressing Multiplication Algorithms. Sci. Ann. Comput. Sci. 28(1): 39-66 (2018) - [i102]Jan A. Bergstra, Cornelis A. Middelburg:
On the complexity of the correctness problem for non-zeroness test instruction sequences. CoRR abs/1805.05845 (2018) - [i101]Jan A. Bergstra, Cornelis A. Middelburg:
A short introduction to program algebra with instructions for Boolean registers. CoRR abs/1808.04264 (2018) - [i100]Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt:
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. CoRR abs/1810.02142 (2018) - 2017
- [j149]Jan A. Bergstra, Inge Bethke:
Subvarieties of the Variety of Meadows. Sci. Ann. Comput. Sci. 27(1): 1-18 (2017) - [j148]Jan A. Bergstra, Cornelis A. Middelburg:
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 27(2): 111-135 (2017) - [j147]Jan A. Bergstra, Cornelis A. Middelburg
:
Contradiction-Tolerant Process Algebra with Propositional Signals. Fundam. Informaticae 153(1-2): 29-55 (2017) - [i99]Jan A. Bergstra, Cornelis A. Middelburg:
Axioms for behavioural congruence of single-pass instruction sequences. CoRR abs/1702.03511 (2017) - [i98]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra with strategic interleaving. CoRR abs/1703.06822 (2017) - [i97]Jan A. Bergstra, Inge Bethke, Dimitri Hendriks:
Universality of Univariate Mixed Fractions in Divisive Meadows. CoRR abs/1707.00499 (2017) - 2016
- [j146]Jan A. Bergstra, Cornelis A. Middelburg
:
On Instruction Sets for Boolean Registers in Program Algebra. Sci. Ann. Comput. Sci. 26(1): 1-26 (2016) - [j145]Jan A. Bergstra, Cornelis A. Middelburg:
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Sci. Ann. Comput. Sci. 26(2): 125-156 (2016) - [j144]Jan A. Bergstra, Cornelis A. Middelburg
:
Instruction Sequence Size Complexity of Parity. Fundam. Informaticae 149(3): 297-309 (2016) - [j143]Jan A. Bergstra, Cornelis A. Middelburg
:
Transformation of fractions into simple fractions in divisive meadows. J. Appl. Log. 16: 92-110 (2016) - [c68]Jan A. Bergstra, Alban Ponse:
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract). WADT 2016: 73-87 - [i96]Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. CoRR abs/1608.06212 (2016) - [i95]Jan A. Bergstra:
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference. CoRR abs/1611.09351 (2016) - 2015
- [j142]Jan A. Bergstra, Cornelis A. Middelburg
:
Probabilistic Thread Algebra. Sci. Ann. Comput. Sci. 25(2): 211-243 (2015) - [j141]Jan A. Bergstra, Cornelis A. Middelburg
:
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions. Fundam. Informaticae 138(4): 411-434 (2015) - [j140]Jan A. Bergstra, Inge Bethke:
Note on paraconsistency and reasoning about fractions. J. Appl. Non Class. Logics 25(2): 120-124 (2015) - [j139]Jan A. Bergstra, Cornelis A. Middelburg
:
Division by zero in non-involutive meadows. J. Appl. Log. 13(1): 1-12 (2015) - [j138]Jan A. Bergstra, Inge Bethke, Alban Ponse
:
Equations for formally real meadows. J. Appl. Log. 13(2): 1-23 (2015) - [c67]Jan A. Bergstra, Alban Ponse
:
Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence. Correct System Design 2015: 44-61 - [c66]Jan A. Bergstra, Alban Ponse:
Division by Zero in Common Meadows. Software, Services, and Systems 2015: 46-61 - [i94]Jan A. Bergstra, Cornelis A. Middelburg:
On instruction sets for Boolean registers in program algebra. CoRR abs/1502.00238 (2015) - [i93]Jan A. Bergstra:
Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money. CoRR abs/1504.07184 (2015) - [i92]Jan A. Bergstra, Alban Ponse:
Evaluation trees for proposition algebra. CoRR abs/1504.08321 (2015) - [i91]Jan A. Bergstra, Inge Bethke:
A negative result on algebraic specifications of the meadow of rational numbers. CoRR abs/1507.00548 (2015) - [i90]Jan A. Bergstra, Cornelis A. Middelburg:
Contradiction-tolerant process algebra with propositional signals. CoRR abs/1508.06899 (2015) - [i89]Jan A. Bergstra, Inge Bethke:
Subvarieties of the variety of meadows. CoRR abs/1510.04021 (2015) - [i88]Jan A. Bergstra, Cornelis A. Middelburg:
Transformation of fractions into simple fractions in divisive meadows. CoRR abs/1510.06233 (2015) - 2014
- [j137]Jan A. Bergstra, Cornelis A. Middelburg
:
Instruction Sequence Based Non-uniform Complexity Classes. Sci. Ann. Comput. Sci. 24(1): 47-89 (2014) - [j136]Jan A. Bergstra, John V. Tucker:
Editor's Note. J. Log. Algebraic Methods Program. 83(2): 82 (2014) - [i87]Jan A. Bergstra, Mark Burgess:
Promises, Impositions, and other Directionals. CoRR abs/1401.3381 (2014) - [i86]Jan A. Bergstra, Peter Weijland:
Bitcoin: a Money-like Informational Commodity. CoRR abs/1402.4778 (2014) - [i85]Jan A. Bergstra, Cornelis A. Middelburg:
On algorithmic equivalence of instruction sequences for computing bit string functions. CoRR abs/1402.4950 (2014) - [i84]Jan A. Bergstra, Cornelis A. Middelburg:
Division by zero in non-involutive meadows. CoRR abs/1406.2092 (2014) - [i83]Jan A. Bergstra, Alban Ponse:
Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. CoRR abs/1406.3280 (2014) - [i82]Jan A. Bergstra, Cornelis A. Middelburg:
A Hoare-like logic of asserted single-pass instruction sequences. CoRR abs/1408.2955 (2014) - [i81]Jan A. Bergstra, Cornelis A. Middelburg:
A Thread Algebra with Probabilistic Features. CoRR abs/1409.6873 (2014) - [i80]Jan A. Bergstra, Inge Bethke:
Note on paraconsistency and the logic of fractions. CoRR abs/1410.8692 (2014) - [i79]Jan A. Bergstra:
Personal Multi-threading. CoRR abs/1412.3579 (2014) - [i78]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence size complexity of parity. CoRR abs/1412.6787 (2014) - 2013
- [j135]Jan A. Bergstra, Jens Blanck, Faron Moller
, Stanley S. Wainer:
Guest Editorial. Comput. J. 56(1): 2 (2013) - [j134]Jan A. Bergstra, Inge Bethke, Alban Ponse
:
Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56(1): 3-14 (2013) - [j133]Jan A. Bergstra, Cornelis A. Middelburg
:
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation. Sci. Ann. Comput. Sci. 23(2): 169-190 (2013) - [j132]Jan A. Bergstra, Jan Willem Klop, Jan Rutten:
Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS 109: 14-16 (2013) - [j131]Jan A. Bergstra, Cornelis A. Middelburg
:
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundam. Informaticae 128(4): 367-412 (2013) - [j130]Jan A. Bergstra, Cornelis A. Middelburg
:
A Process Calculus with Finitary Comprehended Terms. Theory Comput. Syst. 53(4): 645-668 (2013) - [j129]Jan A. Bergstra:
Editorial. Sci. Comput. Program. 78(9): 1207 (2013) - [i77]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence based non-uniform complexity classes. CoRR abs/1301.3297 (2013) - [i76]Jan A. Bergstra, Cornelis A. Middelburg, Gheorghe Stefanescu:
Network algebra for synchronous dataflow. CoRR abs/1303.0382 (2013) - [i75]Jan A. Bergstra, Karl de Leeuw:
Bitcoin and Beyond: Exclusively Informational Monies. CoRR abs/1304.4758 (2013) - [i74]Jan A. Bergstra, Karl de Leeuw:
Questions related to Bitcoin and other Informational Money. CoRR abs/1305.5956 (2013) - [i73]Jan A. Bergstra:
Decision Taking versus Promise Issuing. CoRR abs/1306.6412 (2013) - [i72]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence expressions for the secure hash algorithm SHA-256. CoRR abs/1308.0219 (2013) - [i71]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Equations for formally real meadows. CoRR abs/1310.5011 (2013) - [i70]Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence expressions for the Karatsuba multiplication algorithm. CoRR abs/1312.1529 (2013) - [i69]Jan A. Bergstra, Cornelis A. Middelburg:
Long multiplication by instruction sequences with backward jump instructions. CoRR abs/1312.1812 (2013) - 2012
- [b1]Jan A. Bergstra, Cornelis A. Middelburg
:
Instruction Sequences for Computer Science. Atlantis Studies in Computing 2, Atlantis Press 2012, ISBN 978-94-91216-64-0, pp. i-xvi, 1-229 - [j128]Jan A. Bergstra, Cornelis A. Middelburg
:
Instruction sequence processing operators. Acta Informatica 49(3): 139-172 (2012) - [j127]Jan A. Bergstra, Cornelis A. Middelburg:
Indirect Jumps Improve Instruction Sequence Performance. Sci. Ann. Comput. Sci. 22(2): 253-265 (2012) - [j126]Jan A. Bergstra, Cornelis A. Middelburg
:
On the Behaviours Produced by Instruction Sequences under Execution. Fundam. Informaticae 120(2): 111-144 (2012) - [j125]Jan A. Bergstra, Cornelis A. Middelburg
:
On the Expressiveness of Single-Pass Instruction Sequences. Theory Comput. Syst. 50(2): 313-328 (2012) - [j124]Jan A. Bergstra, Inge Bethke:
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50(4): 706-720 (2012) - [i68]Jan A. Bergstra:
About Instruction Sequence Testing. CoRR abs/1201.3929 (2012) - [i67]Jan A. Bergstra, Cornelis A. Middelburg:
Turing Impossibility Properties for Stack Machine Programming. CoRR abs/1201.6028 (2012) - [i66]Jan A. Bergstra:
Four Conceptions of Instruction Sequence Faults. CoRR abs/1204.1881 (2012) - [i65]Jan A. Bergstra, Cornelis A. Middelburg:
Process algebra with conditionals in the presence of epsilon. CoRR abs/1204.3249 (2012) - [i64]Jan A. Bergstra:
Decision Taking as a Service. CoRR abs/1205.4194 (2012) - [i63]Jan A. Bergstra:
Decision Taking versus Action Determination. CoRR abs/1205.6177 (2012) - [i62]Jan A. Bergstra:
Decision Taking for Selling Thread Startup. CoRR abs/1208.2460 (2012) - [i61]Jan A. Bergstra:
Informaticology: combining Computer Science, Data Science, and Fiction Science. CoRR abs/1210.6636 (2012) - 2011
- [j123]Jan A. Bergstra, Cornelis A. Middelburg:
Thread Extraction for Polyadic Instruction Sequences. Sci. Ann. Comput. Sci. 21(2): 283-310 (2011) - [j122]Jan A. Bergstra, Cornelis A. Middelburg
:
Thread algebra for poly-threading. Formal Aspects Comput. 23(4): 567-583 (2011) - [j121]Jan A. Bergstra, Cornelis A. Middelburg
:
Inversive meadows and divisive meadows. J. Appl. Log. 9(3): 203-220 (2011) - [j120]Jan A. Bergstra, Inge Bethke:
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48(4): 840-864 (2011) - [j119]Jan A. Bergstra:
Editorial. Sci. Comput. Program. 76(7): 541 (2011) - [j118]Jan A. Bergstra, Jaco van de Pol:
A calculus for four-valued sequential logic. Theor. Comput. Sci. 412(28): 3122-3128 (2011) - [j117]Jan A. Bergstra, Alban Ponse
:
Proposition algebra. ACM Trans. Comput. Log. 12(3): 21:1-21:36 (2011) - [c65]Jan A. Bergstra, Alban Ponse
:
Proposition Algebra and Short-Circuit Logic. FSEN 2011: 15-31 - [i60]Jan A. Bergstra:
Real Islamic Logic. CoRR abs/1103.4515 (2011) - [i59]Jan A. Bergstra, Cornelis A. Middelburg:
On the behaviours produced by instruction sequences under execution. CoRR abs/1106.6196 (2011) - [i58]Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen:
Introducing Sourcements. CoRR abs/1107.4684 (2011) - [i57]Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen:
Outsourcing Competence. CoRR abs/1109.6536 (2011) - [i56]Jan A. Bergstra:
Putting Instruction Sequences into Effect. CoRR abs/1110.1866 (2011) - [i55]Jan A. Bergstra, Guus P. A. J. Delen, S. F. M. van Vlijmen:
Stratified Outsourcing Theory. CoRR abs/1110.1957 (2011) - [i54]Jan A. Bergstra:
Informatics Perspectives on Decision Taking. CoRR abs/1112.5840 (2011) - 2010
- [j116]Jan A. Bergstra, Cornelis A. Middelburg
:
An Interface Group for Process Components. Fundam. Informaticae 99(4): 355-382 (2010) - [j115]Jan A. Bergstra, Cornelis A. Middelburg
:
Data Linkage Dynamics with Shedding. Fundam. Informaticae 103(1-4): 31-52 (2010) - [j114]Jan A. Bergstra, Cornelis A. Middelburg
:
A thread calculus with molecular dynamics. Inf. Comput. 208(7): 817-844 (2010) - [j113]