An extensional partial combinatory algebra based on -terms

DOI10.1007/3-540-54345-7_82MaRDI QIDQ4035261zbMATH OpenFDO

Authors Ramón Pino Pérez

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54345-7_82

zbMATH Keywords

bisimulation relationcall by value evaluationcontextual relationequivalence of programspartial combinatory algebra

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4004153
• On the existence of extensional partial combinatory algebras
• Limiting partial combinatory algebras
• Extending partial combinatory algebras
• On combinatory algebras and their expansions

Cited in

(9)

• A construction of one-point bases in extended lambda calculi
• Lambda terms definable as combinators
• Limiting partial combinatory algebras
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• scientific article; zbMATH DE number 4004153 (Why is no real title available?)
• Extending partial combinatory algebras
• Applications of Plotkin-terms: partitions and morphisms for closed terms
• DODD PARAMETERS AND λ-INDEXING OF EXTENDERS
• Combinatory logic and lambda calculus are equal, algebraically

This page was built for publication: An extensional partial combinatory algebra based on \(\lambda\)-terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035261)