Formalizing non-termination of recursive programs

DOI10.1016/S1567-8326(01)00006-6zbMath1015.68026MaRDI QIDQ1349246

Thomas Studer, Reinhard Kahle

Publication date: 21 May 2002

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

zbMATH Keywords

applicative theoriesrecursion theoremleast fixed point operator

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (3)

Axioms for strict and lazy functional programs ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ THE UNIVERSAL SET AND DIAGONALIZATION IN FREGE STRUCTURES

Cites Work

• Constructivism in mathematics. An introduction. Volume I
• Elementary induction on abstract structures
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
• Proof theory. An introduction
• N-strictness in applicative theories
• Combinatory logic. Vol. II
• A Semantics for  : 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
• 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
• Unnamed Item

This page was built for publication: Formalizing non-termination of recursive programs