Formalizing non-termination of recursive programs (Q1349246): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4222034 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3342534 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3679172 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatory logic. Vol. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4128540 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3882452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3478384 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4010354 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138832 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4202934 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4722037 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4941991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4265595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: N-strictness in applicative theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2753685 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4124327 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary induction on abstract structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof theory. An introduction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692506 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4362933 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4436035 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Semantics for : a Calculus with Overloading and Late-binding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructivism in mathematics. An introduction. Volume I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak Theories of Operations and Types / rank | |||
Normal rank |
Latest revision as of 08:59, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Formalizing non-termination of recursive programs |
scientific article |
Statements
Formalizing non-termination of recursive programs (English)
0 references
21 May 2002
0 references
applicative theories
0 references
recursion theorem
0 references
least fixed point operator
0 references
0 references