What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Algorithm
Jan A. Bergstra mainly focuses on Algebra, Process calculus, Theoretical computer science, Algebra of Communicating Processes and Programming language.
The Algebra study combines topics in areas such as Term algebra, Algebra representation and Pure mathematics.
His Process calculus research incorporates elements of Discrete mathematics, Equivalence, Bisimulation, Modulo and Axiom.
He interconnects Halting problem, Turing machine, Basis, Interface and Algebraic theory in the investigation of issues within Theoretical computer science.
Jan A. Bergstra has included themes like Simple, Alternating bit protocol, Concurrency and Abstraction in his Algebra of Communicating Processes study.
His study on Semantics, Data type and State is often connected to UML state machine as part of broader study in Programming language.
His most cited work include:
- Process algebra for synchronous communication (806 citations)
- Handbook of Process Algebra (744 citations)
- Algebra of communicating processes with abstraction (572 citations)
What are the main themes of his work throughout his whole career to date?
Jan A. Bergstra mainly investigates Algebra, Process calculus, Programming language, Theoretical computer science and Discrete mathematics.
The study incorporates disciplines such as Term algebra, Algebra of Communicating Processes and Algebra representation in addition to Algebra.
His Algebra representation research is multidisciplinary, relying on both Subalgebra and Filtered algebra.
His research in Process calculus intersects with topics in Operator, Discrete time and continuous time, Bisimulation, Concurrency and Asynchronous communication.
Programming language connects with themes related to Program algebra in his study.
His research integrates issues of Interleaving and Turing machine in his study of Theoretical computer science.
He most often published in these fields:
- Algebra (38.84%)
- Process calculus (36.56%)
- Programming language (26.21%)
What were the highlights of his more recent work (between 2012-2021)?
- Algebra (38.84%)
- Pure mathematics (7.39%)
- Discrete mathematics (21.51%)
In recent papers he was focusing on the following fields of study:
Jan A. Bergstra mostly deals with Algebra, Pure mathematics, Discrete mathematics, Instruction sequence and Axiom.
Jan A. Bergstra combines subjects such as Process calculus, Propositional calculus and Congruence with his study of Algebra.
His Process calculus study also includes fields such as
- Algebra of Communicating Processes which intersects with area such as Hoare logic,
- Property, which have a strong connection to Field.
His work carried out in the field of Discrete mathematics brings together such families of science as Field, Operator and Probability mass function.
The Axiom study combines topics in areas such as Scheme, Complex number, Completeness and Real number.
His Program algebra study incorporates themes from Programming language, Algebraic theory and Current.
Between 2012 and 2021, his most popular works were:
- Division by zero in non-involutive meadows (25 citations)
- Cancellation Meadows (24 citations)
- Division by zero in common meadows (23 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Algorithm
Jan A. Bergstra focuses on Pure mathematics, Discrete mathematics, Function, Instruction sequence and Arithmetic.
His study in Pure mathematics is interdisciplinary in nature, drawing from both Multiplicative inverse, Division by zero, Signature, Axiom and Commutative ring.
His Discrete mathematics research is multidisciplinary, incorporating elements of Completeness, Term algebra and Signature.
His study focuses on the intersection of Product and fields such as Financial services with connections in the field of Process calculus.
His study looks at the relationship between Process calculus and topics such as Property, which overlap with Algebra.
In his research on the topic of Program algebra, Theoretical computer science is strongly related with Programming language.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
