This document in subdirectoryRS/04/25/ On the Recursive Enumerability of Fixed-Point Combinators (2004)
by Mayer Goldberg, Copyright C, Mayer Goldberg, Mayer Goldberg
http://www.brics.dk/RS/04/Ref/BRICS-RS-04-Ref/../../../../RS/04/25/BRICS-RS-04-25.ps.gz
Add To MetaCart
Abstract:
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS
Citations
| 894 | The Lambda Calculus: its Syntax and Semantics – Barendregt - 1984 |
| 259 | The calculi of lambda-conversion – Church - 1941 |
| 41 | Combinatory Logic, Volume I – Curry, Feys - 1958 |
| 6 | Some examples of non-existent combinators – Statman - 1993 |
| 3 | Fokkink, Anna Ingólfsdóttir, and Sumit Nain. Bisimilarity is not Finitely Based over BPA with Interrupt – Aceto, Jan - 2004 |
| 3 | New-HOPLA— A Higher-Order Process Language with Name Generation – Winskel, Nardelli - 2004 |
| 3 | Krukow and Andrew Twigg. Distributed Approximation of Fixed-Points in Trust Structures – Karl - 2004 |
| 2 | Turing. The p-functions in λ-k-conversion – Alan - 1937 |
| 2 | Computing Logarithms Digit-by-Digit – Goldberg - 2004 |
| 1 | Hüttel and Jiˇrí Srba. Recursion vs. Replication in Simple Cryptographic Protocols – Hans - 2004 |
| 1 | Cattani and Glynn Winskel. Profunctors, Open Maps and Bisimulation – Luca - 2004 |
