Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Formalizing non-termination of recursive programs
Autore:
Kahle, R; Studer, T;
Indirizzi:
Univ Tubingen, WSI, D-72076 Tubingen, Germany Univ Tubingen Tubingen Germany D-72076 n, WSI, D-72076 Tubingen, Germany Univ Bern, Inst Informat & Angew Math, CH-3012 Bern, Switzerland Univ Bern Bern Switzerland CH-3012 Angew Math, CH-3012 Bern, Switzerland
Titolo Testata:
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
fascicolo: 1-2, volume: 49, anno: 2001,
pagine: 1 - 14
SICI:
1567-8326(200109/12)49:1-2<1:FNORP>2.0.ZU;2-T
Fonte:
ISI
Lingua:
ENG
Keywords:
applicative theories; least fixed point operator; non-termination;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
35
Recensione:
Indirizzi per estratti:
Indirizzo: Kahle, R Univ Tubingen, WSI, Sand 13, D-72076 Tubingen, Germany Univ Tubingen Sand 13 Tubingen Germany D-72076 Tubingen, Germany
Citazione:
R. Kahle e T. Studer, "Formalizing non-termination of recursive programs", J LOGIC ALG, 49(1-2), 2001, pp. 1-14

Abstract

In applicative theories the recursion theorem provides a term rec which solves recursive equations. However, it is not provable that a solution obtained by rec is minimal. In the present paper we introduce an applicative theory in which it is possible to define a least fixed point operator. Still, our theory has a standard recursion theoretic interpretation. (C) 2001 Elsevier Science Inc. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 03/04/20 alle ore 03:24:36