What people are saying - Write a review
We haven't found any reviews in the usual places.
Computing with Abstract Bohm Trees
Postponing Redex Contractions in Equational Programs
12 other sections not shown
2-category A-calculus A-representable A-term Abstract Machine algorithm application arity axY.FY Backtr backtracking bifunctors binary trees called catamorphism cell compilation Computer Science concurrent CONS A CONS constraint construction corresponding cyclic structures defined definition denotes dynamic elim environment equational evaluation system example execution F-Algebras Figure functional programming functor GAEA game semantics GoFFIN Haskell hylomorphism imperative programs implementation induction input instance interpretation intN inverse computation lambda logic programming matching monad transformer mutual recursive negin nodes non-standard semantics normal form notation object P-value pattern-matching port position primal strategies primitive operators program transformation programming language Prolog proof r-type rational trees redex replacements residual result rewrite rules rewriting logic satisfies semantics modifier semi-adjoint send rec sequence specification static step substitution subterm syntax T;A h template term schema Theorem theory type-directed partial evaluation variables