[top ][top ]-closed relations and admissibility

DOI10.1017/S0960129500003054MaRDI QIDQ4500170zbMATH OpenOpenAlexFDO

Authors Martín Abadi

Publication date 4 September 2000

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129500003054

zbMATH Keywords

reasoning about programs

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Non-deterministic closure theory and universal arrows
• Closure operators associated with relations
• Topological relations
• A relation between modal logic and language closure operators
• Fuzzy closure relations

Cited in

(3)

• Semantics of higher-order quantum computation via geometry of interaction
• Realisability semantics of parametric polymorphism, general references and recursive types
• Codensity lifting of monads and its dual

This page was built for publication: [top ][top ]-closed relations and admissibility

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