[top ][top ]-closed relations and admissibility

DOI10.1017/S0960129500003054zbMath0955.68072OpenAlexW2038176982MaRDI QIDQ4500170

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

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

Related Items (3)

Semantics of higher-order quantum computation via geometry of interaction ⋮ Codensity Lifting of Monads and its Dual ⋮ Realisability semantics of parametric polymorphism, general references and recursive types

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