The following pages link to (Q4692880):
Displaying 50 items.
- Implementing hybrid semantics: from functional to imperative (Q2037951) (← links)
- The spirit of node replication (Q2233421) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- Safe typing of functional logic programs with opaque patterns and local bindings (Q2437797) (← links)
- Translating higher-order clauses to first-order clauses (Q2471742) (← links)
- Functional parallel typified language and its implementation on clusters (Q2498279) (← links)
- More efficient left-to-right matching for overlapping pattern (Q2569399) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- Structuring operational semantics: simplification and computation (Q2864160) (← links)
- From functional programs to interaction nets via the rewriting calculus (Q2864528) (← links)
- An account of implementing applicative term rewriting (Q2866805) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Complete laziness: a natural semantics (Q2873681) (← links)
- Minimality in a linear calculus with iteration (Q2873683) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Pattern Matches in HOL: (Q2945657) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- (Q3104401) (← links)
- New dimensions in heap profiling (Q3125160) (← links)
- π-RED<sup>+</sup> An interactive compiling graph reduction system for an applied λ-calculus (Q3125230) (← links)
- The Reduceron reconfigured and re-evaluated (Q3165526) (← links)
- Comprehending Ringads (Q3188283) (← links)
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting (Q3522032) (← links)
- From Interpretation to Compilation (Q3599186) (← links)
- First-class patterns (Q3616447) (← links)
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine (Q3625516) (← links)
- Jumping Boxes (Q3644740) (← links)
- (Q4029598) (← links)
- (Q4274972) (← links)
- Determining periodicity: a case study of a functional specification (Q4359977) (← links)
- Convergence in infinitary term graph rewriting systems is simple (Q4585010) (← links)
- A complete proof system for Nested Term Graphs (Q4645805) (← links)
- (Q4668854) (← links)
- Tail recursion without space leaks (Q4763981) (← links)
- Lilac: a functional programming language based on linear logic (Q4764609) (← links)
- A domain-theoretic approach to functional and logic programming (Q4764614) (← links)
- Formal basis for the refinement of rule based transition systems (Q4895556) (← links)
- From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
- Demonstrating Lambda Calculus Reduction (Q4917067) (← links)
- Explicit Substitutions à la de Bruijn (Q4924548) (← links)
- Using transformations in the implementation of higher-order functions (Q4939691) (← links)
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus (Q4972064) (← links)
- (Q4991956) (← links)
- (Q5013814) (← links)
- (Q5015373) (← links)
- Transfinite reductions in orthogonal term rewriting systems (Q5055744) (← links)
- Redex capturing in term graph rewriting (concise version) (Q5055745) (← links)
- Left-to-right tree pattern matching (Q5055771) (← links)
