• Corpus ID: 41953217

Introduction to combinatory logic

@inproceedings{Hindley1972IntroductionTC,
  title={Introduction to combinatory logic},
  author={J. Roger Hindley and Rasmus Lerdorf and Jonathan P. Seldin},
  year={1972}
}
A lambda calculus with naive substitution
  • J. Staples
  • Computer Science
    Journal of the Australian Mathematical Society
  • 1979
Abstract An alternative approach is proposed to the basic definitions of the lassical lambda calculus. A proof is sketched of the equivalence of the approach with the classical case. The new
Solution to the Range Problem for Combinatory Logic
TLDR
A solution to a natural version of the range problem for the theory H asks whether a closed term has always either an infinite range or a singleton range (that is, it is a constant function).
History of Lambda-calculus and Combinatory Logic
8 Types 23 8.1 The general development of type theories . . . . . . . . . . . . . . . 23 8.1.1 Types as grammatical categories . . . . . . . . . . . . . . . . 24 8.1.2 Types as sets . . . . . . . . .
Church-Rosser properties for graph replacement systems with unique splitting
  • H. Ehrig, J. Staples
  • Mathematics
    Graph-Grammars and Their Application to Computer Science
  • 1982
Although the theories of lambda calculus and graph grammars have many goals and techniques in common, there has been little serious study of what each has to offer the other.
ADDRESSING MACHINES AS MODELS OF λ-CALCULUS
TLDR
In order to obtain a model of the full untyped λ-calculus, a rule is introduced that bares similarities with the ω-rule and the rule ζβ from combinatory logic.
Addressing Machines as models of lambda-calculus
TLDR
In order to obtain a model of the full untyped λ -calculus, a rule is introduced that bares similarities with the ω -rule and the rule ζ β from combinatory logic.
Addressing Machines — Modelling the Core of Functional Programming Languages
TLDR
This article introduces a new class of abstract machines that are only able to manipulate memory addresses of other machines, and introduces a rule that bares similarities with the ω-rule and the rule ζβ from combinatory logic.
Criteria for Bracket Abstractions Design
Environment of Modeling Methods for Indicating Objects Based on Displaced Concepts
TLDR
The paper generates requirements to the methods of objects indication and proposes an environment that provides modeling of various methods of indication based on the support of methods for modeling the shift of concepts in an applicative computing system.
...
...