Publication:3141916
From MaRDI portal
zbMath0919.68082MaRDI QIDQ3141916
Publication date: 1 November 1993
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68N15: Theory of programming languages
68Q55: Semantics in the theory of computing
Related Items
Domain mu-calculus, Encoding FIX in Object Calculi, A Hybrid Denotational Semantics for Hybrid Systems, On behavioural abstraction and behavioural satisfaction in higher-order logic, Fixed-point operations on ccc's. I, On Gabbay's temporal fixed point operator, Two models of synthetic domain theory, Call-by-push-value: Decomposing call-by-value and call-by-name, Deriving escape analysis by abstract interpretation, On the relations between monadic semantics, CPO semantics of timed interactive actor networks, Dual unbounded nondeterminacy, recursion, and fixpoints, A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++, Parallelism increases iterative learning power, Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding, Group axioms for iteration, Computational adequacy of the FIX-logic, Adequacy for a lazy functional language with recursive and polymorphic types, Equivalence of formal semantics definition methods, Full abstraction for the second order subset of an Algol-like language, From regular expressions to DFA's using compressed NFA's, The equational logic of fixed points, A general adequacy result for a linear functional language, Completeness of Park induction, An equational notion of lifting monad, Domain theory for concurrency, A game semantics for generic polymorphism, Games and full abstraction for FPC., Modular structural operational semantics, Reasoning with power defaults, A first-order one-pass CPS transformation, Secure mechanical verification of mutually recursive procedures, Computation on abstract data types. The extensional approach, with an application to streams, Structured proof procedures, Game-theoretic analysis of call-by-value computation, Operational semantics of Framed Tempura, The complexity of fixed point models of trust in distributed networks, Optimality and condensing of information flow through linear refinement, A decision procedure for propositional projection temporal logic with infinite models, Algebraic correctness proofs for compiling recursive function definitions with strictness information, Branching vs. Linear Time: Semantical Perspective, Parallelism Increases Iterative Learning Power
