realizability structures, Semantics in the theory of computing, Metamathematics of constructive systems, modelling of recursive definitions of programs and types, Cartesian closed category, Theoretical Computer Science, Computer Science Applications, recursion on types, fixed-point operator, Computational Theory and Mathematics, Applications of computability and recursion theory, Scott domain, realizability model, Girard's system \(F\), higher-order lambda-calculus, Closed categories (closed monoidal and Cartesian closed categories, etc.), Combinatory logic and lambda calculus, higher-order domain equations, inductive types, contractive operators, complete partial orders, Information Systems