Computational adequacy of the FIX-logic

DOI10.1016/0304-3975(95)90335-IzbMath0874.68267OpenAlexW1978485780MaRDI QIDQ1349677

Roy L. Crole

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)90335-i

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• Categories for Types
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational adequacy of the FIX-logic