The following pages link to (Q4692880):
Displaying 50 items.
- On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- Dynamic detection of determinism in functional logic languages (Q673493) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- A uniform treatment of order of evaluation and aggregate update (Q685390) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Preliminary arrangements of arguments in lazy evaluation (Q756403) (← links)
- Semantics-directed compilation of nonlinear patterns (Q756408) (← links)
- An operational semantics for paragon: A design notation for parallel architectures (Q756433) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Directly reflective meta-programming (Q848742) (← links)
- A logic for Miranda (Q909443) (← links)
- Implementing term rewrite languages in DACTL (Q912591) (← links)
- Principles of plasma pattern and alternative structure compilation (Q913494) (← links)
- Deforestation: Transforming programs to eliminate trees (Q914358) (← links)
- Lambda calculus with patterns (Q930865) (← links)
- A compact kernel for the calculus of inductive constructions (Q1040007) (← links)
- On ``On graph rewritings'' (Q1098284) (← links)
- Confluence of indirection reductions in graph rewrite systems (Q1113692) (← links)
- Lazy variable-renumbering makes substitution cheap (Q1114386) (← links)
- The semantics of lazy functional languages (Q1124368) (← links)
- Finitely stratified polymorphism (Q1175334) (← links)
- \(Booster\): A high-level language for portable parallel algorithms (Q1181513) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem (Q1185009) (← links)
- Head-strictness is not a monotonic abstract property (Q1190512) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- Lazy dynamic-programming can be eager (Q1199883) (← links)
- The systematic construction of a one-combinator basis for lambda-terms (Q1203131) (← links)
- Capturing strong reduction in director string calculus (Q1208420) (← links)
- The development of a partial evaluator for extended lambda calculus (Q1264617) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- Usage counting analysis for lazy functional languages (Q1275747) (← links)
- Lazy techniques for fully expansive theorem proving (Q1309245) (← links)
- Interaction systems II: The practice of optimal reductions (Q1350498) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Indexed types (Q1389626) (← links)
- \(c\beta\)-Machine with \(\lambda \beta\)-reduction (Q1389686) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- Lambda-dropping: Transforming recursive equations into programs with block structure (Q1583366) (← links)
- Proof nets, garbage, and computations (Q1589650) (← links)
- Executable component-based semantics (Q1734523) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- A logic for Miranda, revisited (Q1903076) (← links)
- Evaluating lambda terms with traversals (Q2007730) (← links)
- The spirit of node replication (Q2233421) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
