Jan A. Bergstra - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Jan A. Bergstra' as author, editor, or advisor:

On the Contribution of Backward Jumps to Instruction Sequence ExpressivenessJan A. Bergstra, Inge Bethke. mst, 50(4):706-720, 2012. [doi]
A Short Introduction to Program Algebra with Instructions for Boolean RegistersJan A. Bergstra, Cornelis A. Middelburg. csjm, 26(3):199-232, 2018. [doi]
EditorialJan A. Bergstra. SCP, 78(9):1207, 2013. [doi]
Which Arithmetical Data Types Admit Fracterm Flattening?Jan A. Bergstra, John V. Tucker. cuza, 32(1):87-107, 2022. [doi]
Eager Term Rewriting For The Fracterm Calculus Of Common MeadowsJan A. Bergstra, John V. Tucker. cj, 67(5):1866-1871, 2024. [doi]
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract)Jan A. Bergstra, Alban Ponse. WADT 2017: 73-87 [doi]
Equations for formally real meadowsJan A. Bergstra, Inge Bethke, Alban Ponse. japll, 13(2):1-23, 2015. [doi]
On the adequacy of finite equational methods for data type specificationJan A. Bergstra, John V. Tucker. SIGPLAN, 14(11):13-18, 1979. [doi]
Contradiction-Tolerant Process Algebra with Propositional SignalsJan A. Bergstra, C. A. Middelburg. FUIN, 153(1-2):29-55, 2017. [doi]
Proposition Algebra and Short-Circuit LogicJan A. Bergstra, Alban Ponse. fsen 2012: 15-31 [doi]
Arithmetical datatypes with true fractionsJan A. Bergstra, Alban Ponse. ACTA, 57(3-5):385-402, 2020. [doi]
Instruction Sequences for Computer ScienceJan A. Bergstra, Cornelis A. Middelburg. Volume 2 of Atlantis Studies in Computing, Atlantis Press, 2012. [doi]
Network algebra for asynchronous dataflowJan A. Bergstra, C. A. Middelburg, Gheorghe Stefanescu. ijcm, 65(1-2):57-88, 1997. [doi]
A proof rule for restoring logic circuitsJan A. Bergstra, Jan Willem Klop. integration, 1(2-3):161-178, 1983. [doi]
Transformation of fractions into simple fractions in divisive meadowsJan A. Bergstra, C. A. Middelburg. japll, 16:92-110, 2016. [doi]
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit RegistersJan A. Bergstra. csjm, 27(2):131-161, 2019. [doi]
Instruction Sequence Size Complexity of ParityJan A. Bergstra, C. A. Middelburg. FUIN, 149(3):297-309, 2016. [doi]
Synthetic Fracterm CalculusJan A. Bergstra, John V. Tucker. jucs, 30(3):289-307, 2024. [doi]
On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And IncompletenessJan A. Bergstra, John V. Tucker. cj, 66(7):1565-1572, July 2023. [doi]
Division by Zero in Common MeadowsJan A. Bergstra, Alban Ponse. BIRTHDAY 2015: 46-61 [doi]
Thread Extraction for Polyadic Instruction SequencesJan A. Bergstra, Cornelis A. Middelburg. cuza, 21(2):283-310, 2011. [doi]
Non-commutative propositional logic with short-circuit evaluationJan A. Bergstra, Alban Ponse, Daan J. C. Staudt. jancl, 31(3-4):234-278, 2021. [doi]
Discrete Time Process Algebra and the Semantics of SDLJan A. Bergstra, C. A. Middelburg, Yaroslav S. Usenko. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 1209-1268, North-Holland / Elsevier, 2001. [doi]
Timed Tuplix Calculus and the Wesseling and van den Bergh EquationJan A. Bergstra, Cornelis A. Middelburg. cuza, 23(2):169-190, 2013. [doi]
Four Notions of Fault for Program SpecificationsJan A. Bergstra. cuza, 32(2):183-209, 2022. [doi]
Discourse between processesJan A. Bergstra. ndjfl, 21(1):131-134, 1980. [doi]
Naive Fracterm CalculusJan A. Bergstra, John V. Tucker. jucs, 29(9):961-987, September 2023. [doi]
Process Algebra with Recursive OperationsJan A. Bergstra, Wan Fokkink, Alban Ponse. In Jan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, Handbook of Process Algebra. pages 333-389, North-Holland / Elsevier, 2001. [doi]
Handbook of Process AlgebraJan A. Bergstra, Alban Ponse, Scott A. Smolka, editors, North-Holland / Elsevier, 2001. [doi]
Instruction sequence processing operatorsJan A. Bergstra, C. A. Middelburg. ACTA, 49(3):139-172, 2012. [doi]
Cancellation Meadows: A Generic Basis Theorem and Some ApplicationsJan A. Bergstra, Inge Bethke, Alban Ponse. cj, 56(1):3-14, 2013. [doi]
Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational TheoryJan A. Bergstra, John V. Tucker. BIRTHDAY 2022: 63-80 [doi]
Effective Transformations on Probabilistic DataJan A. Bergstra. mlq, 25(13-18):219-226, 1979. [doi]
Degrees of partial functionsJan A. Bergstra. ndjfl, 19(1):152-154, 1978. [doi]
I/O-computable data structuresJan A. Bergstra, John-Jules Ch. Meyer. SIGPLAN, 16(4):27-32, 1981. [doi]
Instruction Sequences Expressing Multiplication AlgorithmsJan A. Bergstra, Cornelis A. Middelburg. cuza, 28(1):39-66, 2018. [doi]
On the Expressiveness of Single-Pass Instruction SequencesJan A. Bergstra, C. A. Middelburg. mst, 50(2):313-328, 2012. [doi]
Subvarieties of the Variety of MeadowsJan A. Bergstra, Inge Bethke. cuza, 27(1):1-18, 2017. [doi]
Precautionary Logic and Ignorance Interval Transfer Mediated InferenceJan A. Bergstra. cuza, 35(1):1-31, 2025. [doi]
Eager Equality for Rational Number ArithmeticJan A. Bergstra, John V. Tucker. tocl, 24(3), 2023. [doi]
Formal Proof Systems for Program EquivalenceJan A. Bergstra, Jan Willem Klop. ifip2 1983: 289-304
On the Behaviours Produced by Instruction Sequences under ExecutionJan A. Bergstra, C. A. Middelburg. FUIN, 120(2):111-144, 2012. [doi]
Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation CongruenceJan A. Bergstra, Alban Ponse. BIRTHDAY 2015: 44-61 [doi]
Guest EditorialJan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer. cj, 56(1):2, 2013. [doi]
Using Hoare Logic in a Process Algebra SettingJan A. Bergstra, Cornelis A. Middelburg. FUIN, 179(4):321-344, 2021. [doi]
Datatype defining rewrite systems for naturals and integersJan A. Bergstra, Alban Ponse. lmcs, 17(1), 2021. [doi]
Algebra of timed framesJan A. Bergstra, Wan J. Fokkink, C. A. Middelburg. ijcm, 61(3-4):227-255, 1996. [doi]
On the complexity of the correctness problem for non-zeroness test instruction sequencesJan A. Bergstra, Cornelis A. Middelburg. TCS, 802:1-18, 2020. [doi]
A Hoare-Like Logic of Asserted Single-Pass Instruction SequencesJan A. Bergstra, C. A. Middelburg. cuza, 26(2):125-156, 2016. [doi]
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String FunctionsJan A. Bergstra, C. A. Middelburg. FUIN, 138(4):411-434, 2015. [doi]
Most General Algebraic Specifications for an Abstract Datatype of Rational NumbersJan A. Bergstra. cuza, 30(1):1-24, 2020. [doi]
Division by zero in non-involutive meadowsJan A. Bergstra, C. A. Middelburg. japll, 13(1):1-12, 2015. [doi]
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvabilityJan A. Bergstra, John V. Tucker. TCS, 1034:115124, 2025. [doi]
Editor's NoteJan A. Bergstra, John V. Tucker. jlp, 83(2):82, 2014. [doi]
A Survey of Testing for Instruction Sequence TheoryJan A. Bergstra. cuza, 32(1):5-86, 2022. [doi]
Partial arithmetical data types of rational numbers and their equational specificationJan A. Bergstra, John V. Tucker. jlap, 128:100797, 2022. [doi]
On Instruction Sets for Boolean Registers in Program AlgebraJan A. Bergstra, C. A. Middelburg. cuza, 26(1):1-26, 2016. [doi]
Real space process algebraJos C. M. Baeten, Jan A. Bergstra. fac, 5(6):481-529, 1993. [doi]
A Complete Finite Axiomatisation of the Equational Theory of Common MeadowsJan A. Bergstra, John V. Tucker. tocl, 26(1), January 2025. [doi]
Instruction Sequence Faults with Formal Change JustificationJan A. Bergstra. cuza, 30(2):105-166, 2020. [doi]
Probabilistic Thread AlgebraJan A. Bergstra, Cornelis A. Middelburg. cuza, 25(2):211-243, 2015. [doi]
A Process Calculus with Finitary Comprehended TermsJan A. Bergstra, C. A. Middelburg. mst, 53(4):645-668, 2013. [doi]
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of SummationJan A. Bergstra. cuza, 30(2):167-203, 2020. [doi]
Program Algebra for Turing-Machine ProgramsJan A. Bergstra, Cornelis A. Middelburg. cuza, 29(2):113-139, 2019. [doi]
Failures without chaos: a new process semantics for fair abstractionJan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog. ifip2 1987: 77-104
Indirect Jumps Improve Instruction Sequence PerformanceJan A. Bergstra, Cornelis A. Middelburg. cuza, 22(2):253-265, 2012. [doi]
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and PermanentJan A. Bergstra. cuza, 31(1):1-50, 2021. [doi]
The Wheel of Rational Numbers as an Abstract Data TypeJan A. Bergstra, John V. Tucker. WADT 2021: 13-30 [doi]
Process Algebra with Strategic InterleavingJan A. Bergstra, C. A. Middelburg. mst, 63(3):488-505, 2019. [doi]
Logical Models of Mathematical Texts: The Case of Conventions for Division by ZeroJan A. Bergstra, John V. Tucker. jolli, 33(4):277-298, December 2024. [doi]
Adams Conditioning and Likelihood Ratio Transfer Mediated InferenceJan A. Bergstra. cuza, 29(1):1-58, 2019. [doi]
Obituary for Jaco de Bakker, 1939-2012Jan A. Bergstra, Jan Willem Klop, Jan Rutten. eatcs, 109:14-16, 2013. [doi]
Data Linkage Algebra, Data Linkage Dynamics, and Priority RewritingJan A. Bergstra, C. A. Middelburg. FUIN, 128(4):367-412, 2013. [doi]
Axioms for Behavioural Congruence of Single-Pass Instruction SequencesJan A. Bergstra, C. A. Middelburg. cuza, 27(2):111-135, 2017. [doi]
Note on paraconsistency and reasoning about fractionsJan A. Bergstra, Inge Bethke. jancl, 25(2):120-124, 2015. [doi]
Conditional axioms and α/β-calculus in process algebraJos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop. ifip2 1987: 53-76
Instruction Sequence Based Non-uniform Complexity ClassesJan A. Bergstra, Cornelis A. Middelburg. cuza, 24(1):47-89, 2014. [doi]
Finite Approximations of the Common Meadow of Rational NumbersJan A. Bergstra, John V. Tucker. adt 2025: 3-22 [doi]

runs on WebDSL