Efficient multi-variate abstraction using an array representation for combinators

Authors:
Antoni Diller
Affiliations:
University of Birmingham, School of Computer Science, Birmingham, UK B15 2TT
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 1

Efficient combinator code

Computer Languages
Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
Variable abstraction in O(n log n) space

Information Processing Letters
Variable Substitution with Iconic Combinators

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science

Proof pearl: using combinators to manipulate let-expressions in proof

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	0.89

Visualization

Abstract