Formalizing non-termination of recursive programs
From MaRDI portal
Publication:1349246
DOI10.1016/S1567-8326(01)00006-6zbMATH Open1015.68026MaRDI QIDQ1349246FDOQ1349246
Publication date: 21 May 2002
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Cites Work
- Constructivism in mathematics. An introduction. Volume I
- Elementary induction on abstract structures
- Proof theory. An introduction
- Combinatory logic. Vol. II
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- N-strictness in applicative theories
- A semantics for \(\lambda_{str}^{\{\,\}}\): A calculus with overloading and late-binding
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
- Weak Theories of Operations and Types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Formalizing non-termination of recursive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349246)