Ellipses and Lambda Definability

@article{Goldberg2015EllipsesAL,
  title={Ellipses and Lambda Definability},
  author={Mayer Goldberg},
  journal={Logical Methods in Computer Science},
  year={2015},
  volume={11}
}
Ellipses are a meta-linguistic notation for denoting terms the size of which are specified by a meta-variable that ranges over the natural numbers. In this work, we present a systematic approach for encoding such meta-expressions in the λ-calculus, without ellipses: Terms that are parameterized by meta-variables are replaced with corresponding λ-abstractions over actual variables. We call such λ-terms arity-generic. Concrete terms, for particular choices of the parameterizing variable are… CONTINUE READING

Similar Papers

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

The lambda calculus - its syntax and semantics

  • Studies in logic and the foundations of mathematics
  • 1985
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

Another Algorithm for Bracket Abstraction

  • J. Symb. Log.
  • 1979
VIEW 20 EXCERPTS
HIGHLY INFLUENTIAL

LISP 1.5 Programmer's Manual

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

An Abstraction Algorithm for Combinatory Logic

  • J. Symb. Log.
  • 1976
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

The Calculi of Lambda-Conversion

Alonzo Church
  • 1941
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Simplest poly-variadic fix-point combinators for mutual recursion

Oleg Kiselyov
  • http://okmij.org/ftp/Computation/fixed-point-combinators.html,
  • 2002
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Fundamental Concepts in Programming Languages

  • Higher-Order and Symbolic Computation
  • 2000
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL