Treffer: A relative PCF-definability result for strongly stable functions and some corollaries
Title:
A relative PCF-definability result for strongly stable functions and some corollaries
Authors:
Source:
Information and computation (Print). 152(1):111-137
Publisher Information:
San Diego, CA: Elsevier, 1999.
Publication Year:
1999
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Algèbre, Algebra, Catégories, algèbre homologique, Category theory, homological algebra, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Cohérence, Coherence, Coherencia, Sémantique dénotationnelle, Denotational semantics, Semántica denotacional, Sémantique opérationnelle, Operational semantics, Semantica operacional, Théorie catégorie, Category theory, Teoría categoría, Algorithme sequentiel, Sequential algorithm, CCC, Cartesian closed category, Définissabilité, Definability
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Institut de Mathématiques de Luminy, C.N.R.S. U.P.R. 9016, 13288 Marseille, France
ISSN:
0890-5401
Rights:
Copyright 2000 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.1178833
Database:
PASCAL Archive
Weitere Informationen
We prove that, in the hierarchy of simple types based on the type of natural numbers, any finite strongly stable function is equal to the application of the semantics of a PCF-definable functional to some strongly stable (generally not PCF-definable) functionals of type two. Applying a logical relation technique, we derive from this result that the strongly stable model of PCF is the extensional collapse of its sequential algorithms model.