What people are saying - Write a review
We haven't found any reviews in the usual places.
Computing with Abstract Bohm Trees 2
Postponing Redex Contractions in Equational Programs
Towards Manipulation of Mutually Recursive Functions
11 other sections not shown
Other editions - View all
2-category Abstract Machine algorithm application arity Backtr backtracking bifunctors binary trees calculus called catamorphism cell compilation Computer Science concurrent CONS A CONS constraint construction corresponding cyclic structures deﬁned deﬁned as follows deﬁnition denotes dynamic elim environment equational evaluation system example execution Figure ﬁnite ﬁrst Functional Programming functor GAEA GOFFIN Haskell hylomorphism identiﬁer Ietrec imperative programs implementation induction inﬁnite input instance interpretation intN inverse computation lambda logic programming matching monad transformer mutual recursive negin nodes non-standard semantics normal form notation object Olivier Danvy P-value port position primal strategies primitive operators programming language Prolog proof rational binary trees rational trees redex replacements reﬂective residual result rewrite rules rewriting logic satisﬁes semantics modiﬁers semi-adjoint send rec sequence speciﬁcation static substitution subterm syntax template term schema TermList Theorem theory type-directed partial evaluation variables