Switch to: References

Add citations

You must login to add citations.
  1. Embeddings between Partial Combinatory Algebras.Anton Golov & Sebastiaan A. Terwijn - 2023 - Notre Dame Journal of Formal Logic 64 (1):129-158.
    Partial combinatory algebras (pcas) are algebraic structures that serve as generalized models of computation. In this article, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene’s models, of van Oosten’s sequential computation model, and of Scott’s graph model, showing that an embedding between two relativized models exists if and only if there exists a particular reduction between the oracles. We obtain a similar result for the lambda calculus, showing in particular that it cannot be (...)
    Download  
     
    Export citation  
     
    Bookmark