scientific article; zbMATH DE number 431765

MaRDI QIDQ3138541zbMATH OpenFDO

Authors Barry Jay

Publication date 27 March 1994

zbMATH Keywords

confluent categoriesconfluently cartesian closed categoriesdenotational semanticsprogramming language semanticsreduction modellingtyped \(\lambda\)-calulus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• Relating two categorical models of term rewriting
• Monads and modular term rewriting
• A confluent reduction for the -calculus with surjective pairing and terminal object
• A categorical reduction system for linear logic
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL

Cited in

(6)

• Computing over K-modules
• Compositional characterization of observable program properties
• scientific article; zbMATH DE number 1231534 (Why is no real title available?)
• Monads and modular term rewriting
• Problems in rewriting applied to categorical concepts by the example of a computational comonad
• A categorical reduction system for linear logic

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 Q3138541)