The following pages link to (Q5601829):
Displaying 50 items.
- A domain-theoretic model of nominally-typed object-oriented programming (Q276420) (← links)
- Inversive meadows and divisive meadows (Q420833) (← links)
- A map of dependencies among three-valued logics (Q497633) (← links)
- A calculus for four-valued sequential logic (Q549178) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Adas and the equational theory of if-then-else (Q690107) (← links)
- Computer theorem proving in mathematics (Q704001) (← links)
- Comparison semigroups and algebras of transformations. (Q711608) (← links)
- Recursively unsolvable word problems of modular lattices and diagram- chasing (Q759047) (← links)
- Nondeterministic three-valued logic: isotonic and guarded truth-functions (Q792750) (← links)
- A first order logic for partial functions (Q918965) (← links)
- External and internal syntax of the \(\lambda \)-calculus (Q968531) (← links)
- Relational algebraic semantics of deterministic and nondeterministic programs (Q1079010) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- On merging software extensions (Q1082067) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- \(\mathbb{T}^\omega\) as a universal domain (Q1132085) (← links)
- Computation on graph-like expressions (Q1134513) (← links)
- Optimal evaluations of graph-like expressions (Q1136217) (← links)
- Prolegomena to a theory of mechanized formal reasoning (Q1140436) (← links)
- On the algebra of order (Q1143782) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Abstract data types and algebraic semantics of programming languages (Q1171877) (← links)
- Map theory (Q1193653) (← links)
- A formal system of partial recursive functions (Q1218847) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- Language design methods based on semantic principles (Q1225927) (← links)
- Least fixed points revisited (Q1234588) (← links)
- Relationships between classes of monotonic functions (Q1235976) (← links)
- IO and OI. I (Q1241985) (← links)
- A canonical form algorithm for proving equivalence of conditional forms (Q1242671) (← links)
- IO and OI. II (Q1243578) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- A Gentzen system for conditional logic (Q1327484) (← links)
- On primitive recursive algorithms and the greatest common divisor function (Q1399976) (← links)
- Process algebra and conditional composition (Q1607116) (← links)
- Identification of biological transition systems using meta-interpreted logic programs (Q1621890) (← links)
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus (Q1763728) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- On building cyclic and shared structures in Haskell (Q1941875) (← links)
- Monoids with tests and the algebra of possibly non-halting programs (Q2258843) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- Missing values and dragonfly operations in fuzzy relational compositions (Q2302773) (← links)
- On the structure of \(C\)-algebras through atomicity and \texttt{if-then-else} (Q2310439) (← links)
