The following pages link to (Q3721784):
Displayed 49 items.
- Miranda (Q17133) (← links)
- Graphical and incremental type inference. A graph transformation approach (Q526459) (← links)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- Functorial polymorphism (Q753948) (← links)
- Preliminary arrangements of arguments in lazy evaluation (Q756403) (← links)
- An operational semantics for paragon: A design notation for parallel architectures (Q756433) (← links)
- Subset-equational programming in intelligent decision systems (Q805225) (← links)
- Comparison of priority rules in pattern matching and term rewriting (Q808264) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- A logic for Miranda (Q909443) (← links)
- Cyclic reference counting with local mark-scan (Q910204) (← links)
- Implementing term rewrite languages in DACTL (Q912591) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- Semantics of types for database objects (Q915443) (← links)
- Adapting combinator and SECD machines to display snapshots of functional computations (Q1082792) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (Q1098614) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Relation algebraic domain constructions (Q1177156) (← links)
- \(Booster\): A high-level language for portable parallel algorithms (Q1181513) (← links)
- \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus (Q1186104) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- Universal algebra in higher types (Q1199827) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- OBSCURE, a specification language for abstract data types (Q1323328) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- An efficient algorithm for cyclic reference counting. (Q1853056) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- GC\(^{2}\): a generational conservative garbage collector for the ATERM library (Q1885928) (← links)
- Head boundedness of nonterminating rewritings (Q1894332) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- More efficient left-to-right matching for overlapping pattern (Q2569399) (← links)
- On the efficiency of categorical combinators as a rewriting system (Q3782744) (← links)
- Higher-order unification with dependent function types (Q5055716) (← links)
- Transfinite reductions in orthogonal term rewriting systems (Q5055744) (← links)
- Wrapper semantics of an object-oriented programming language with state (Q5096238) (← links)
- First order data types and first order logic (Q5096240) (← links)
- Strictness and totality analysis with conjunction (Q5096753) (← links)
- Functional Semantics (Q5410451) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- Generalization of final algebra semantics by relativization (Q5887520) (← links)
- Categorical semantics for programming languages (Q5887530) (← links)
- A chemical abstract machine for graph reduction extended abstract (Q5890053) (← links)
- Folding left and right matters: Direct style, accumulators, and continuations (Q6099203) (← links)