scientific article; zbMATH DE number 1142317
From MaRDI portal
zbMath0900.68110MaRDI QIDQ4385533
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A closer look at constraints as processes, Computing abstract decorations of parse forests using dynamic programming and algebraic power series, Abstract data type systems, Many more predecessors: A representation workout, Decidability of bounded higher-order unification, Lambda abstraction algebras: representation theorems, On graph rewriting, reduction, and evaluation in the presence of cycles, Proof-theoretic notions for software maintenance, Call-by-name, call-by-value and the \(\lambda\)-calculus, The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus, Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering, Precedence-inclusion patterns and relational learning, Alpha-conversion and typability, Combinatory reduction systems: Introduction and survey, A variadic extension of Curry's fixed-point combinator
