Publication:3138541
From MaRDI portal
zbMath0784.68048MaRDI QIDQ3138541
Publication date: 27 March 1994
denotational semanticsprogramming language semanticsconfluent categoriesconfluently cartesian closed categoriesreduction modellingtyped \(\lambda\)-calulus
Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)
Related Items
Compositional characterization of observable program properties, Unnamed Item, Computing over K-modules