scientific article; zbMATH DE number 3490449

MaRDI QIDQ4072829zbMATH OpenFDO

Authors John C. Reynolds

Publication date 1974

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)

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

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)