The following pages link to J. A. Bergstra (Q190306):
Displaying 46 items.
- (Q4825707) (← links)
- (Q4865611) (← links)
- (Q4865612) (← links)
- A propositional logic with 4 values: true, false, divergent and meaningless (Q4868228) (← links)
- (Q4890705) (← links)
- On the Behaviours Produced by Instruction Sequences under Execution (Q4902302) (← links)
- An Interface Group for Process Components (Q4932073) (← links)
- Discrete time process algebra with abstraction (Q5055876) (← links)
- Processes with multiple entries and exits (Q5055885) (← links)
- Adams Conditioning and Likelihood Ratio Transfer Mediated Inference (Q5089602) (← links)
- Program Algebra for Turing-Machine Programs (Q5089609) (← links)
- Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers (Q5089612) (← links)
- Instruction Sequence Faults with Formal Change Justification (Q5089616) (← links)
- Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation (Q5089617) (← links)
- Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent (Q5089619) (← links)
- Using Hoare Logic in a Process Algebra Setting (Q5164860) (← links)
- (Q5186716) (← links)
- (Q5186720) (← links)
- Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract) (Q5208500) (← links)
- A negative result on algebraic specifications of the meadow of rational numbers (Q5224683) (← links)
- Division by Zero in Common Meadows (Q5256337) (← links)
- Formal Methods for Components and Objects (Q5311298) (← links)
- Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting (Q5411662) (← links)
- (Q5431926) (← links)
- Fields, Meadows and Abstract Data Types (Q5452178) (← links)
- (Q5457378) (← links)
- Maurer computers for pipelined instruction processing (Q5458071) (← links)
- (Q5480652) (← links)
- Algebra and Coalgebra in Computer Science (Q5492815) (← links)
- New Computational Paradigms (Q5717067) (← links)
- Elementary Algebraic Specifications of the Rational Complex Numbers (Q5757936) (← links)
- (Q5856421) (← links)
- Non-commutative propositional logic with short-circuit evaluation (Q5862001) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898166) (← links)
- Logical Approaches to Computational Barriers (Q5898801) (← links)
- A simple transfer lemma for algebraic specifications (Q5902688) (← links)
- A simple transfer lemma for algebraic specifications (Q5905240) (← links)
- Bochvar-McCarthy logic and process algebra (Q5937831) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)
- Bounded stacks, bags and queues (Q6044112) (← links)
- Symmetric transrationals: the data type and the algorithmic degree of its equational theory (Q6163881) (← links)
- Cancellation Meadows: a Generic Basis Theorem and Some Applications (Q6208922) (← links)
- A survey of testing for instruction sequence theory (Q6588073) (← links)
- Which arithmetical data types admit fracterm flattening? (Q6588074) (← links)
- Four notions of fault for program specifications (Q6588078) (← links)
- Logical models of mathematical texts: the case of conventions for division by zero. (Q6661237) (← links)
