Regresar

An extensional partial combinatory algebra based on λ-terms

Abstract:

We build an extensional partial combinatory algebra on λ-terms. The main tool for our construction is the equality between two relations ~c and ~ on λ-terms.The first relation has been defined by Plotkin in [13]. The second relation looks like the bisimulation relation of Abramsky [1] but in the setting of eager evaluation. One consequence of this equality is that the algebra obtained is monotonic.

Año de publicación:

1991

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Optimización matemática
    • Modelo matemático
    • Lógica matemática

    Áreas temáticas:

    • Ciencias de la computación

    Contribuidores:

    Ramón Pino-PérezRamón Pino-Pérez