A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification

@article{Miller1991ALP,
  title={A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification},
  author={Dale Miller},
  journal={J. Log. Comput.},
  year={1991},
  volume={1},
  pages={497-536}
}
A meta programming language must be able to represent and manipulate such syntactic structures as programs, formulas, types, and proofs. A common characteristic of all these structures is that they involve notions of abstractions, scope, bound and free variables, substitution instances, and equality up to alphabetic changes of bound variables. Although the data types available in most computer programming languages are rich enough to represent all these kinds of structures, such data types do… CONTINUE READING
Highly Influential
This paper has highly influenced 40 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem

  • N. de Bruijn
  • Indag. Math. (34:5),
  • 1972
Highly Influential
4 Excerpts

A Representation of lambda terms suitable for operations on their intensions , ACM Conference on Lisp and Functional Programming , edited by M . Wand

  • D. Wilson
  • 1990

A Meta Language for Functional Programs , Chapter 24 of MetaProgramming in Logic Programming , edited by H . Rogers and H

  • F. Honsell Harper, G. Plotkin
  • 1989

The Foundation of a Generic Theorem Prover

  • L. Pauslon
  • Journal of Automated Reasoning,
  • 1989

Towards a WAM Model for λ Prolog , North American Conference on Logic Programming , Cleveland , Ohio , edited by Ewing Lusk and Ross Overbeek

  • B. Jayaraman
  • 1989

Similar Papers

Loading similar papers…