The following pages link to J. A. Bergstra (Q190306):
Displaying 50 items.
- Kleene's three-valued logic and process algebra (Q293327) (← links)
- Fracpairs and fractions over a reduced commutative ring (Q297980) (← links)
- Transformation of fractions into simple fractions in divisive meadows (Q301374) (← links)
- (Q385507) (redirect page) (← links)
- A process calculus with finitary comprehended terms (Q385508) (← links)
- Inversive meadows and divisive meadows (Q420833) (← links)
- Instruction sequences for computer science. (Q441056) (← links)
- Straight-line instruction sequence completeness for total calculation on cancellation meadows (Q538468) (← links)
- A calculus for four-valued sequential logic (Q549178) (← links)
- Thread algebra for poly-threading (Q640299) (← links)
- On the contribution of backward jumps to instruction sequence expressiveness (Q692892) (← links)
- On the expressiveness of single-pass instruction sequences (Q692925) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- Machine structure oriented control code logic (Q731332) (← links)
- Recursive process definitions with the state operator (Q758198) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Two theorems about the completeness of Hoare's logic (Q794426) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Execution architectures for program algebra (Q881834) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Program algebra with a jump-shift instruction (Q959050) (← links)
- A thread calculus with molecular dynamics (Q988554) (← links)
- Meadows and the equational specification of division (Q1006649) (← links)
- Division safe calculation in totalised fields (Q1015383) (← links)
- An upper bound for the equational specification of finite state services (Q1041764) (← links)
- Hoare's logic for programming languages with two data types (Q1056220) (← links)
- Algebra of communicating processes with abstraction (Q1067408) (← links)
- Top-down design and the algebra of communicating processes (Q1084850) (← links)
- On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Invertible terms in the lambda calculus (Q1145689) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Hoare's logic and Peano's arithmetic (Q1170877) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- (Q1234684) (redirect page) (← links)
- Degrees of partial functions (Q1234685) (← links)
- What is an abstract datatype? (Q1244990) (← links)
- Recursive assertions are not enough - or are they? (Q1252031) (← links)
- Discourse between processes (Q1252238) (← links)
- Church-Rosser strategies in the lambda calculus (Q1256442) (← links)
- Term-rewriting systems with rule priorities (Q1262749) (← links)
- Which data types have \(\omega\)-complete initial algebra specifications? (Q1318728) (← links)
- Real space process algebra (Q1329194) (← links)
- On sequential composition, action prefixes and process prefix (Q1333405) (← links)
- Bisimulation is two-way simulation (Q1342255) (← links)
