scientific article; zbMATH DE number 1142317

MaRDI QIDQ4385533zbMATH OpenFDO

Authors Henk Barendregt

Publication date 14 May 1998

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Cited in

(15)

• Alpha-conversion and typability
• Precedence-inclusion patterns and relational learning
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
• A closer look at constraints as processes
• Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Computing abstract decorations of parse forests using dynamic programming and algebraic power series
• Combinatory reduction systems: Introduction and survey
• Abstract data type systems
• Many more predecessors: a representation workout
• Decidability of bounded higher-order unification
• Proof-theoretic notions for software maintenance
• A variadic extension of Curry's fixed-point combinator
• Lambda abstraction algebras: representation theorems
• On graph rewriting, reduction, and evaluation in the presence of cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385533)