scientific article; zbMATH DE number 3490449

zbMATH Open0313.68023MaRDI QIDQ4072829FDOQ4072829

Authors: John C. Reynolds 

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (24)

• An adequacy theorem for dependent type theory
• Fully abstract submodels of typed lambda calculi
• Kleene's Logic with equality
• The congruence of two programming language definitions
• State-transition machines for lambda-calculus expressions
• State-transition machines, revisited
• On the relations between monadic semantics
• Galois connecting call-by-value and call-by-name
• On the transformation between direct and continuation semantics
• Combining algebraic effects with continuations
• Morphism axioms
• Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
• Title not available (Why is that?)
• Computational adequacy via ‘mixed’ inductive definitions
• Semantics of interference control
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
• Syntactic logical relations for polymorphic and recursive types
• Strictness analysis and denotational abstract interpretation
• Recursive types for Fun
• Relational interpretations of recursive types in an operational setting.
• Two-level semantics and abstract interpretation
• Fixed-point constructions in order-enriched categories
• Fully abstract models of typed \(\lambda\)-calculi
• Chain properties in Pomega

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4072829)