LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS (Q5249246): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Rekursive Wortfunktionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic synthesis of typed \(\Lambda\)-programs on term algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formulation of the simple theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions over free algebras definable in the simply typed lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definierbare Funktionen imλ-Kalkül mit Typen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word operation definable in the typed \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda\)-definability of free algebras / rank
 
Normal rank

Revision as of 01:28, 10 July 2024

scientific article; zbMATH DE number 6432476
Language Label Description Also known as
English
LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS
scientific article; zbMATH DE number 6432476

    Statements

    LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS (English)
    0 references
    0 references
    30 April 2015
    0 references
    \(\lambda_{\to}\)-representable functions
    0 references
    term algebras
    0 references
    free structures
    0 references
    recursion-theoretic characterization
    0 references
    recursive word functions
    0 references

    Identifiers