Formalizing non-termination of recursive programs
type: Item
instance of: scholarly article
title: Formalizing non-termination of recursive programs
zbMATH Open document ID: 1015.68026
DOI: 10.1016/S1567-8326(01)00006-6
author: Reinhard Kahle
author: Thomas Studer
published in: The Journal of Logic and Algebraic Programming
publication date: 2002-05-21T00:00:00Z
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 1743146
zbMATH Keywords: applicative theories
zbMATH Keywords: recursion theorem
zbMATH Keywords: least fixed point operator
MaRDI profile type: Publication
cites work: Q4222034
cites work: Q3342534
cites work: Q3679172
cites work: Combinatory logic. Vol. II
cites work: Q4128540
cites work: Q3882452
cites work: Q3478384
cites work: Q4010354
cites work: Q3138832
cites work: Q4202934
cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
cites work: Q4722037
cites work: Q4941991
cites work: Q4265595
cites work: N-strictness in applicative theories
cites work: Q2753685
cites work: Q4124327
cites work: Elementary induction on abstract structures
cites work: Proof theory. An introduction
cites work: Q4692506
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: Q4362933
cites work: Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
cites work: Q4436035
cites work: A semantics for \(\lambda_{str}^{\{\,\}}\): A calculus with overloading and late-binding
cites work: Constructivism in mathematics. An introduction. Volume I
cites work: Weak Theories of Operations and Types
description: scientific article; zbMATH DE number 1743146