Switch to: Citations

Add references

You must login to add references.
  1. Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
    We introduce new proof systems G[β] and G ext[β], which are equivalent to the standard equational calculi of λβ- and λβη- conversion, and which may be qualified as ‘analytic’ because it is possible to establish, by purely proof-theoretical methods, that in both of them the transitivity rule admits effective elimination. This key feature, besides its intrinsic conceptual significance, turns out to provide a common logical background to new and comparatively simple demonstrations—rooted in nice proof-theoretical properties of transitivity-free derivations—of a number (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Analytic combinatory calculi and the elimination of transitivity.Pierluigi Minari - 2004 - Archive for Mathematical Logic 43 (2):159-191.
    We introduce, in a general setting, an ‘‘analytic’’ version of standard equational calculi of combinatory logic. Analyticity lies on the one side in the fact that these calculi are characterized by the presence of combinatory introduction rules in place of combinatory axioms, and on the other side in that the transitivity rule proves to be eliminable. Apart from consistency, which follows immediately, we discuss other almost direct consequences of analyticity and the main transitivity elimination theorem; in particular the Church−Rosser and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The decidability of Hindley's axioms for strong reduction.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):237-239.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A standardization theorem for strong reduction.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):271-283.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
    Introduction Combinatory logic deals with a class of formal systems designed for studying certain primitive ways in which functions can be combined to form ...
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Combinatory Logic, Volume I.Haskell B. Curry, Robert Feys & William Craig - 1959 - Philosophical Review 68 (4):548-550.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)Strong Reduction and Normal Form in Combinatory Logic.Bruce Lercher - 1971 - Journal of Symbolic Logic 36 (1):171-171.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • [Omnibus Review].Bruce Lercher - 1966 - Journal of Symbolic Logic 31 (2):272-272.
    Download  
     
    Export citation  
     
    Bookmark   1 citation