Memoryful geometry of interaction. II: Recursion and adequacy

DOI10.1145/2837614.2837672MaRDI QIDQ2828318zbMATH OpenOpenAlexFDO

Authors Koko Muroya, Naohiko Hoshino, Ichiro Hasuo

Publication date 24 October 2016

Published in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2837614.2837672

zbMATH Keywords

adequacyalgebraic effectgeometry of interactionmonad

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Memoryful geometry of interaction: from coalgebraic components to algebraic effects
• scientific article; zbMATH DE number 4099289
• Towards a geometry of recursion
• scientific article; zbMATH DE number 1342271
• Geometry of interaction and the dynamics of proof reduction: a tutorial
• Elementary complexity and geometry of interaction
• On the geometry behind a recurrent relation
• scientific article; zbMATH DE number 785046
• New foundations for the geometry of interaction

Cited in

(6)

• Memory and geometry in Bruno: some analogies
• Memoryful geometry of interaction: from coalgebraic components to algebraic effects
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• scientific article; zbMATH DE number 7456059 (Why is no real title available?)
• The geometry of Bayesian programming
• A robust graph-based approach to observational equivalence

This page was built for publication: Memoryful geometry of interaction. II: Recursion and adequacy

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