scientific article
From MaRDI portal
Publication:4072829
zbMath0313.68023MaRDI QIDQ4072829
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)
Related Items (24)
Computational adequacy via ‘mixed’ inductive definitions ⋮ On the transformation between direct and continuation semantics ⋮ Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics ⋮ Fully abstract submodels of typed lambda calculi ⋮ Strictness analysis and denotational abstract interpretation ⋮ Morphism axioms ⋮ Combining algebraic effects with continuations ⋮ On the relations between monadic semantics ⋮ Unnamed Item ⋮ Galois connecting call-by-value and call-by-name ⋮ The congruence of two programming language definitions ⋮ Chain properties in Pomega ⋮ Two-level semantics and abstract interpretation ⋮ Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control ⋮ Recursive types for Fun ⋮ State-transition machines for lambda-calculus expressions ⋮ State-transition machines, revisited ⋮ Fully abstract models of typed \(\lambda\)-calculi ⋮ Fixed-point constructions in order-enriched categories ⋮ Semantics of interference control ⋮ An adequacy theorem for dependent type theory ⋮ Relational interpretations of recursive types in an operational setting. ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ Kleene's Logic with equality
This page was built for publication:
