The following pages link to (Q3141916):
Displayed 42 items.
- On behavioural abstraction and behavioural satisfaction in higher-order logic (Q671672) (← links)
- Fixed-point operations on ccc's. I (Q672122) (← links)
- On Gabbay's temporal fixed point operator (Q673958) (← links)
- Two models of synthetic domain theory (Q678839) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- CPO semantics of timed interactive actor networks (Q959824) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++ (Q1015388) (← links)
- Parallelism increases iterative learning power (Q1017664) (← links)
- Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding (Q1127524) (← links)
- Group axioms for iteration (Q1283821) (← links)
- Computational adequacy of the FIX-logic (Q1349677) (← links)
- Adequacy for a lazy functional language with recursive and polymorphic types (Q1349683) (← links)
- Equivalence of formal semantics definition methods (Q1355752) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- A general adequacy result for a linear functional language (Q1391860) (← links)
- Completeness of Park induction (Q1391869) (← links)
- An equational notion of lifting monad (Q1398461) (← links)
- Domain theory for concurrency (Q1434357) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Modular structural operational semantics (Q1878712) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- A first-order one-pass CPS transformation (Q1884883) (← links)
- Secure mechanical verification of mutually recursive procedures (Q1887136) (← links)
- Computation on abstract data types. The extensional approach, with an application to streams (Q1923575) (← links)
- Structured proof procedures (Q1924823) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Operational semantics of Framed Tempura (Q2378283) (← links)
- The complexity of fixed point models of trust in distributed networks (Q2463564) (← links)
- Optimality and condensing of information flow through linear refinement (Q2464935) (← links)
- A decision procedure for propositional projection temporal logic with infinite models (Q2480780) (← links)
- Algebraic correctness proofs for compiling recursive function definitions with strictness information (Q2502270) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- Parallelism Increases Iterative Learning Power (Q3520049) (← links)
- Domain mu-calculus (Q4460689) (← links)
- Encoding FIX in Object Calculi (Q4494479) (← links)
- A Hybrid Denotational Semantics for Hybrid Systems (Q5458386) (← links)