Tail recursion through universal invariants

DOI10.1016/0304-3975(93)90059-3zbMath0779.68057MaRDI QIDQ685396

C. Barry Jay

Publication date: 23 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90059-3

zbMATH Keywords

recursion; loop; universal invariant; convergent list objects

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Finite objects in a locos

Cites Work

• A note on natural numbers objects in monoidal categories
• List-arithmetic distributive categories: Locoi
• Monoidal categories with natural numbers object
• Categories of partial maps
• Categorical fixed point semantics
• Cartesian categories with natural numbers object
• A fixpoint theorem for complete categories
• Monads on symmetric monoidal closed categories
• Data types in distributive categories
• The Category-Theoretic Solution of Recursive Domain Equations
• *-Autonomous categories and linear logic
• Metric spaces, generalized logic, and closed categories
• Coalgebras and cartesian categories
• Adjointness in Foundations
• An imperative language based on distributive categories II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item